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/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:16,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:16,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:16,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:16,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:16,259 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:16,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:16,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:16,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:16,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:16,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:16,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:16,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:16,268 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:16,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:16,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:16,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:16,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:16,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:16,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:16,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:16,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:16,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:16,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:16,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:16,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:16,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:16,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:16,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:16,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:16,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:16,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:16,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:16,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:16,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:16,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:16,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:16,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:16,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:16,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:16,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:16,295 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:00:16,311 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:16,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:16,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:16,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:16,313 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:16,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:16,314 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:16,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:16,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:16,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:16,314 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:16,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:16,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:16,318 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:16,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:16,319 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:16,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:16,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:16,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:16,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:16,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:16,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:16,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:16,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:16,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:16,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:16,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:16,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:16,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:16,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:16,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:16,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:16,388 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:16,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-09-20 13:00:16,462 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200ad6aa6/38ea0abe6b3a487cbae1f4c146f2e3a2/FLAG18f3da196 [2019-09-20 13:00:16,940 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:16,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-09-20 13:00:16,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200ad6aa6/38ea0abe6b3a487cbae1f4c146f2e3a2/FLAG18f3da196 [2019-09-20 13:00:17,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200ad6aa6/38ea0abe6b3a487cbae1f4c146f2e3a2 [2019-09-20 13:00:17,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:17,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:17,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:17,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:17,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:17,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31ee166d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17, skipping insertion in model container [2019-09-20 13:00:17,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,344 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:17,381 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:17,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:17,616 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:17,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:17,752 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:17,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17 WrapperNode [2019-09-20 13:00:17,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:17,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:17,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:17,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:17,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (1/1) ... [2019-09-20 13:00:17,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:17,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:17,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:17,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:17,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (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:00:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:18,217 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:18,218 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:00:18,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:18 BoogieIcfgContainer [2019-09-20 13:00:18,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:18,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:18,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:18,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:18,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:17" (1/3) ... [2019-09-20 13:00:18,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0a0f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:18, skipping insertion in model container [2019-09-20 13:00:18,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:17" (2/3) ... [2019-09-20 13:00:18,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0a0f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:18, skipping insertion in model container [2019-09-20 13:00:18,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:18" (3/3) ... [2019-09-20 13:00:18,229 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-09-20 13:00:18,239 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:18,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:18,262 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:18,301 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:18,302 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:18,302 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:18,302 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:18,302 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:18,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:18,303 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:18,303 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:18,303 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-20 13:00:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,327 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] [2019-09-20 13:00:18,330 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,334 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-09-20 13:00:18,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,552 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:00:18,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,577 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-20 13:00:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,648 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-09-20 13:00:18,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,663 INFO L225 Difference]: With dead ends: 105 [2019-09-20 13:00:18,663 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:00:18,667 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:00:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:00:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-09-20 13:00:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 13:00:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-09-20 13:00:18,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-09-20 13:00:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,720 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-09-20 13:00:18,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-09-20 13:00:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:00:18,722 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,723 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] [2019-09-20 13:00:18,724 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-09-20 13:00:18,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,820 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:00:18,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,825 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-09-20 13:00:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:18,882 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-09-20 13:00:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:18,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-20 13:00:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:18,885 INFO L225 Difference]: With dead ends: 147 [2019-09-20 13:00:18,885 INFO L226 Difference]: Without dead ends: 90 [2019-09-20 13:00:18,888 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:00:18,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-20 13:00:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-20 13:00:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-20 13:00:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-09-20 13:00:18,908 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-09-20 13:00:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:18,909 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-09-20 13:00:18,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-09-20 13:00:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:18,911 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:18,911 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] [2019-09-20 13:00:18,911 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-09-20 13:00:18,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:18,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:18,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:18,995 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:00:18,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:18,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:18,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:18,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:18,997 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-09-20 13:00:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,020 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-09-20 13:00:19,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,024 INFO L225 Difference]: With dead ends: 135 [2019-09-20 13:00:19,024 INFO L226 Difference]: Without dead ends: 93 [2019-09-20 13:00:19,025 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:00:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-20 13:00:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-20 13:00:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-20 13:00:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-09-20 13:00:19,037 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-09-20 13:00:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,037 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-09-20 13:00:19,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-09-20 13:00:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,039 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,039 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] [2019-09-20 13:00:19,039 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-09-20 13:00:19,040 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,125 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:00:19,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,128 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-09-20 13:00:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,173 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-09-20 13:00:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,177 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:00:19,178 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:00:19,178 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:00:19,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:00:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-09-20 13:00:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-20 13:00:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-09-20 13:00:19,191 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-09-20 13:00:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,192 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-09-20 13:00:19,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-09-20 13:00:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 13:00:19,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,194 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] [2019-09-20 13:00:19,194 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-09-20 13:00:19,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,262 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:00:19,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,264 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-09-20 13:00:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,290 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-09-20 13:00:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-20 13:00:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,292 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:00:19,293 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:00:19,294 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:00:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:00:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-20 13:00:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-20 13:00:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-09-20 13:00:19,316 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-09-20 13:00:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,317 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-09-20 13:00:19,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-09-20 13:00:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,320 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,320 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] [2019-09-20 13:00:19,321 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,321 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-09-20 13:00:19,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,378 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:00:19,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,380 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-09-20 13:00:19,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,398 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-09-20 13:00:19,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,400 INFO L225 Difference]: With dead ends: 255 [2019-09-20 13:00:19,400 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:00:19,401 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:00:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:00:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-20 13:00:19,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-20 13:00:19,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-09-20 13:00:19,431 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-09-20 13:00:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,434 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-09-20 13:00:19,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-09-20 13:00:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,436 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] [2019-09-20 13:00:19,436 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-09-20 13:00:19,439 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,501 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:00:19,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,503 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-09-20 13:00:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,534 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-09-20 13:00:19,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,537 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:00:19,537 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:00:19,538 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:00:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:00:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-09-20 13:00:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-20 13:00:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-09-20 13:00:19,552 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-09-20 13:00:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,553 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-09-20 13:00:19,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,553 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-09-20 13:00:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-20 13:00:19,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,566 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] [2019-09-20 13:00:19,566 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-09-20 13:00:19,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,614 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:00:19,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,617 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-09-20 13:00:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,654 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-09-20 13:00:19,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-20 13:00:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,657 INFO L225 Difference]: With dead ends: 552 [2019-09-20 13:00:19,657 INFO L226 Difference]: Without dead ends: 330 [2019-09-20 13:00:19,658 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:00:19,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-20 13:00:19,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-20 13:00:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-20 13:00:19,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-09-20 13:00:19,671 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-09-20 13:00:19,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,671 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-09-20 13:00:19,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,672 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-09-20 13:00:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,673 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,673 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] [2019-09-20 13:00:19,674 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-09-20 13:00:19,674 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,713 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:00:19,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,715 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-09-20 13:00:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,740 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-09-20 13:00:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,745 INFO L225 Difference]: With dead ends: 492 [2019-09-20 13:00:19,745 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:00:19,746 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:00:19,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:00:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-20 13:00:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-20 13:00:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-09-20 13:00:19,760 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-09-20 13:00:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,761 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-09-20 13:00:19,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-09-20 13:00:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,763 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,763 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] [2019-09-20 13:00:19,763 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-09-20 13:00:19,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,790 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:00:19,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,792 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-09-20 13:00:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,818 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-09-20 13:00:19,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,822 INFO L225 Difference]: With dead ends: 620 [2019-09-20 13:00:19,822 INFO L226 Difference]: Without dead ends: 618 [2019-09-20 13:00:19,823 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:00:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-20 13:00:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-09-20 13:00:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-20 13:00:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-09-20 13:00:19,840 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-09-20 13:00:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,840 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-09-20 13:00:19,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-09-20 13:00:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:00:19,842 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,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] [2019-09-20 13:00:19,843 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-09-20 13:00:19,843 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,865 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:00:19,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,866 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-09-20 13:00:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,905 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-09-20 13:00:19,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-20 13:00:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,910 INFO L225 Difference]: With dead ends: 1084 [2019-09-20 13:00:19,910 INFO L226 Difference]: Without dead ends: 642 [2019-09-20 13:00:19,912 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:00:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-20 13:00:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-09-20 13:00:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-20 13:00:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-09-20 13:00:19,932 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-09-20 13:00:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:19,933 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-09-20 13:00:19,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-09-20 13:00:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:19,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:19,934 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] [2019-09-20 13:00:19,935 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-09-20 13:00:19,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:19,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:19,960 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:00:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:19,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:19,962 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-09-20 13:00:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:19,984 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-09-20 13:00:19,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:19,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:19,988 INFO L225 Difference]: With dead ends: 960 [2019-09-20 13:00:19,989 INFO L226 Difference]: Without dead ends: 650 [2019-09-20 13:00:19,990 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:00:19,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-20 13:00:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-20 13:00:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-20 13:00:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-09-20 13:00:20,009 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-09-20 13:00:20,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,009 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-09-20 13:00:20,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-09-20 13:00:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,011 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,011 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] [2019-09-20 13:00:20,011 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-09-20 13:00:20,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,034 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:00:20,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,036 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-09-20 13:00:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,062 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-09-20 13:00:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,070 INFO L225 Difference]: With dead ends: 1196 [2019-09-20 13:00:20,070 INFO L226 Difference]: Without dead ends: 1194 [2019-09-20 13:00:20,071 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:00:20,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-20 13:00:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-09-20 13:00:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-20 13:00:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-09-20 13:00:20,099 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-09-20 13:00:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,099 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-09-20 13:00:20,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-09-20 13:00:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:20,102 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,102 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] [2019-09-20 13:00:20,102 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-09-20 13:00:20,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,127 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:00:20,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,128 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-09-20 13:00:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,162 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-09-20 13:00:20,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-20 13:00:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,169 INFO L225 Difference]: With dead ends: 2140 [2019-09-20 13:00:20,170 INFO L226 Difference]: Without dead ends: 1258 [2019-09-20 13:00:20,172 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:00:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-20 13:00:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-20 13:00:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-20 13:00:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-09-20 13:00:20,228 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-09-20 13:00:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,228 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-09-20 13:00:20,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-09-20 13:00:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,232 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,232 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] [2019-09-20 13:00:20,233 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-09-20 13:00:20,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,273 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:00:20,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,275 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-09-20 13:00:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,323 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-09-20 13:00:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,331 INFO L225 Difference]: With dead ends: 1884 [2019-09-20 13:00:20,331 INFO L226 Difference]: Without dead ends: 1274 [2019-09-20 13:00:20,334 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:00:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-20 13:00:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-20 13:00:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-20 13:00:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-09-20 13:00:20,405 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-09-20 13:00:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,406 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-09-20 13:00:20,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-09-20 13:00:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,410 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,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] [2019-09-20 13:00:20,411 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-09-20 13:00:20,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,459 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:00:20,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,461 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-09-20 13:00:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,513 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-09-20 13:00:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,527 INFO L225 Difference]: With dead ends: 2316 [2019-09-20 13:00:20,528 INFO L226 Difference]: Without dead ends: 2314 [2019-09-20 13:00:20,529 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:00:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-20 13:00:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-09-20 13:00:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-20 13:00:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-09-20 13:00:20,587 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-09-20 13:00:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,587 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-09-20 13:00:20,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-09-20 13:00:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:00:20,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,591 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] [2019-09-20 13:00:20,591 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-09-20 13:00:20,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,617 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-09-20 13:00:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,665 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-09-20 13:00:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-20 13:00:20,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,679 INFO L225 Difference]: With dead ends: 4236 [2019-09-20 13:00:20,679 INFO L226 Difference]: Without dead ends: 2474 [2019-09-20 13:00:20,683 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:00:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-20 13:00:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-20 13:00:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-20 13:00:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-09-20 13:00:20,757 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-09-20 13:00:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,757 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-09-20 13:00:20,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-09-20 13:00:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:20,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,762 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] [2019-09-20 13:00:20,762 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-09-20 13:00:20,762 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,785 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:00:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:20,838 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-09-20 13:00:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:20,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:20,851 INFO L225 Difference]: With dead ends: 3708 [2019-09-20 13:00:20,851 INFO L226 Difference]: Without dead ends: 2506 [2019-09-20 13:00:20,854 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:00:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-20 13:00:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-09-20 13:00:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-20 13:00:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-09-20 13:00:20,922 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-09-20 13:00:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:20,922 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-09-20 13:00:20,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-09-20 13:00:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:20,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:20,926 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] [2019-09-20 13:00:20,926 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-09-20 13:00:20,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:20,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:20,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:20,949 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:00:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:20,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:20,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:20,951 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-09-20 13:00:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,019 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-09-20 13:00:21,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:21,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,042 INFO L225 Difference]: With dead ends: 4492 [2019-09-20 13:00:21,042 INFO L226 Difference]: Without dead ends: 4490 [2019-09-20 13:00:21,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:00:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-20 13:00:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-09-20 13:00:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-09-20 13:00:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-09-20 13:00:21,173 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-09-20 13:00:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,173 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-09-20 13:00:21,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-09-20 13:00:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:21,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,179 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] [2019-09-20 13:00:21,180 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,180 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-09-20 13:00:21,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,207 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:00:21,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,208 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-09-20 13:00:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,281 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-09-20 13:00:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:00:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,331 INFO L225 Difference]: With dead ends: 8396 [2019-09-20 13:00:21,332 INFO L226 Difference]: Without dead ends: 4874 [2019-09-20 13:00:21,340 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:00:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-20 13:00:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-09-20 13:00:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-09-20 13:00:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-09-20 13:00:21,469 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-09-20 13:00:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,469 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-09-20 13:00:21,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-09-20 13:00:21,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:21,475 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,475 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] [2019-09-20 13:00:21,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,476 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-09-20 13:00:21,476 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,498 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:00:21,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,500 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-09-20 13:00:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:21,569 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-09-20 13:00:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:21,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:21,582 INFO L225 Difference]: With dead ends: 7308 [2019-09-20 13:00:21,583 INFO L226 Difference]: Without dead ends: 4938 [2019-09-20 13:00:21,589 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:00:21,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-09-20 13:00:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-09-20 13:00:21,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-09-20 13:00:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-09-20 13:00:21,877 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-09-20 13:00:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:21,878 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-09-20 13:00:21,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-09-20 13:00:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:21,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:21,885 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] [2019-09-20 13:00:21,885 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-09-20 13:00:21,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:21,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:21,919 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:00:21,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:21,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:21,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:21,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:21,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:21,920 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-09-20 13:00:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,040 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-09-20 13:00:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,062 INFO L225 Difference]: With dead ends: 14412 [2019-09-20 13:00:22,062 INFO L226 Difference]: Without dead ends: 9610 [2019-09-20 13:00:22,075 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:00:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-09-20 13:00:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-09-20 13:00:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-20 13:00:22,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-09-20 13:00:22,312 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-09-20 13:00:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,313 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-09-20 13:00:22,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-09-20 13:00:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:22,326 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,326 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] [2019-09-20 13:00:22,327 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-09-20 13:00:22,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,354 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:00:22,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,356 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-09-20 13:00:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:22,503 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-09-20 13:00:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:22,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:22,530 INFO L225 Difference]: With dead ends: 11148 [2019-09-20 13:00:22,531 INFO L226 Difference]: Without dead ends: 11146 [2019-09-20 13:00:22,536 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:00:22,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-09-20 13:00:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-09-20 13:00:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-20 13:00:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-09-20 13:00:22,920 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-09-20 13:00:22,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:22,920 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-09-20 13:00:22,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:22,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-09-20 13:00:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:22,932 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:22,932 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] [2019-09-20 13:00:22,932 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-09-20 13:00:22,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:22,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:22,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:22,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:22,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:22,958 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-09-20 13:00:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:23,150 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-09-20 13:00:23,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:23,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:23,186 INFO L225 Difference]: With dead ends: 16780 [2019-09-20 13:00:23,186 INFO L226 Difference]: Without dead ends: 16778 [2019-09-20 13:00:23,198 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:00:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-09-20 13:00:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-09-20 13:00:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-20 13:00:23,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-09-20 13:00:23,956 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-09-20 13:00:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:23,956 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-09-20 13:00:23,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-09-20 13:00:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:00:23,978 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:23,978 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] [2019-09-20 13:00:23,978 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-09-20 13:00:23,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:23,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:23,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:23,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:23,999 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:00:23,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:23,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:23,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,000 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-09-20 13:00:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:24,238 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-09-20 13:00:24,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:24,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:00:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:24,277 INFO L225 Difference]: With dead ends: 32908 [2019-09-20 13:00:24,277 INFO L226 Difference]: Without dead ends: 18826 [2019-09-20 13:00:24,306 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:00:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-09-20 13:00:24,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-09-20 13:00:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-09-20 13:00:24,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-09-20 13:00:24,699 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-09-20 13:00:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:24,700 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-09-20 13:00:24,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-09-20 13:00:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:00:24,726 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:24,726 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] [2019-09-20 13:00:24,727 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:24,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:24,727 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-09-20 13:00:24,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:24,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:24,748 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:00:24,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:24,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:24,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:24,749 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-09-20 13:00:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,024 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-09-20 13:00:25,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:00:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,061 INFO L225 Difference]: With dead ends: 28428 [2019-09-20 13:00:25,062 INFO L226 Difference]: Without dead ends: 19210 [2019-09-20 13:00:25,082 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:00:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-09-20 13:00:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-09-20 13:00:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-09-20 13:00:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-09-20 13:00:25,410 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-09-20 13:00:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:25,410 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-09-20 13:00:25,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-09-20 13:00:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:00:25,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:25,432 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] [2019-09-20 13:00:25,433 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:25,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-09-20 13:00:25,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:25,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:25,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:25,455 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:00:25,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:25,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:25,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:25,457 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-09-20 13:00:25,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:25,868 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-09-20 13:00:25,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:25,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:00:25,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:25,931 INFO L225 Difference]: With dead ends: 32780 [2019-09-20 13:00:25,931 INFO L226 Difference]: Without dead ends: 32778 [2019-09-20 13:00:25,940 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:00:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-09-20 13:00:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-09-20 13:00:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-09-20 13:00:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-09-20 13:00:26,412 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-09-20 13:00:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:26,413 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-09-20 13:00:26,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-09-20 13:00:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:00:26,461 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:26,462 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] [2019-09-20 13:00:26,462 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:26,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-09-20 13:00:26,463 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:26,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:26,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:26,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:26,491 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:00:26,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:26,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:26,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:26,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:26,493 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-09-20 13:00:27,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:27,153 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-09-20 13:00:27,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:27,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:00:27,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:27,211 INFO L225 Difference]: With dead ends: 65548 [2019-09-20 13:00:27,211 INFO L226 Difference]: Without dead ends: 37386 [2019-09-20 13:00:27,257 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:00:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-09-20 13:00:27,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-09-20 13:00:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-09-20 13:00:28,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-09-20 13:00:28,992 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-09-20 13:00:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:28,992 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-09-20 13:00:28,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-09-20 13:00:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:29,028 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:29,029 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] [2019-09-20 13:00:29,029 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:29,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-09-20 13:00:29,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:29,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:29,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:29,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:29,058 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:00:29,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:29,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:29,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:29,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:29,059 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-09-20 13:00:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:29,413 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-09-20 13:00:29,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:29,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:29,464 INFO L225 Difference]: With dead ends: 56076 [2019-09-20 13:00:29,464 INFO L226 Difference]: Without dead ends: 37898 [2019-09-20 13:00:29,496 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:00:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-09-20 13:00:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-09-20 13:00:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-09-20 13:00:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-09-20 13:00:30,117 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-09-20 13:00:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:30,117 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-09-20 13:00:30,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-09-20 13:00:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:30,147 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:30,147 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] [2019-09-20 13:00:30,147 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:30,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:30,148 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-09-20 13:00:30,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:30,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:30,170 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:00:30,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:30,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:30,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:30,172 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-09-20 13:00:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:30,876 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-09-20 13:00:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:30,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:30,939 INFO L225 Difference]: With dead ends: 63500 [2019-09-20 13:00:30,939 INFO L226 Difference]: Without dead ends: 63498 [2019-09-20 13:00:30,950 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:00:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-09-20 13:00:32,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-09-20 13:00:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-09-20 13:00:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-09-20 13:00:32,565 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-09-20 13:00:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:32,566 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-09-20 13:00:32,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:32,566 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-09-20 13:00:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:32,610 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:32,610 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] [2019-09-20 13:00:32,611 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-09-20 13:00:32,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:32,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:32,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:32,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:32,630 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:00:32,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:32,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:32,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:32,632 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-09-20 13:00:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:33,206 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-09-20 13:00:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:33,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-20 13:00:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:33,302 INFO L225 Difference]: With dead ends: 130060 [2019-09-20 13:00:33,303 INFO L226 Difference]: Without dead ends: 73738 [2019-09-20 13:00:33,369 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:00:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-09-20 13:00:34,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-09-20 13:00:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-09-20 13:00:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-09-20 13:00:34,553 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-09-20 13:00:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:34,554 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-09-20 13:00:34,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-09-20 13:00:34,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:34,602 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:34,602 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] [2019-09-20 13:00:34,602 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:34,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:34,603 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-09-20 13:00:34,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:34,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:34,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:34,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:34,627 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:00:34,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:34,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:34,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:34,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:34,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:34,628 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-09-20 13:00:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:36,756 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-09-20 13:00:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:36,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:36,817 INFO L225 Difference]: With dead ends: 110604 [2019-09-20 13:00:36,818 INFO L226 Difference]: Without dead ends: 74762 [2019-09-20 13:00:36,843 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:00:36,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-09-20 13:00:37,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-09-20 13:00:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-09-20 13:00:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-09-20 13:00:37,619 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-09-20 13:00:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:37,619 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-09-20 13:00:37,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-09-20 13:00:37,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:37,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:37,658 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] [2019-09-20 13:00:37,658 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:37,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-09-20 13:00:37,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:37,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:37,677 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:00:37,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:37,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:37,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:37,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:37,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:37,678 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-09-20 13:00:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:38,753 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-09-20 13:00:38,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:38,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:38,863 INFO L225 Difference]: With dead ends: 122892 [2019-09-20 13:00:38,863 INFO L226 Difference]: Without dead ends: 122890 [2019-09-20 13:00:38,880 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:00:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-09-20 13:00:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-09-20 13:00:41,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-09-20 13:00:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-09-20 13:00:41,456 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-09-20 13:00:41,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:41,457 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-09-20 13:00:41,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:41,457 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-09-20 13:00:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:00:41,528 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:41,529 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] [2019-09-20 13:00:41,529 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-09-20 13:00:41,529 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:41,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:41,548 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:00:41,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:41,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:41,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:41,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:41,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:41,550 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-09-20 13:00:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:43,032 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-09-20 13:00:43,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:43,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:00:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:43,185 INFO L225 Difference]: With dead ends: 258060 [2019-09-20 13:00:43,185 INFO L226 Difference]: Without dead ends: 145418 [2019-09-20 13:00:43,253 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:00:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-09-20 13:00:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-09-20 13:00:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-09-20 13:00:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-09-20 13:00:47,770 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-09-20 13:00:47,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:47,770 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-09-20 13:00:47,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-09-20 13:00:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-20 13:00:47,843 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:47,843 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] [2019-09-20 13:00:47,843 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:47,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-09-20 13:00:47,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:47,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:47,871 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:00:47,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:47,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:47,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:47,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:47,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:47,872 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-09-20 13:00:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:48,813 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2019-09-20 13:00:48,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:48,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-20 13:00:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:48,966 INFO L225 Difference]: With dead ends: 218124 [2019-09-20 13:00:48,966 INFO L226 Difference]: Without dead ends: 147466 [2019-09-20 13:00:49,032 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