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-13a467a-m [2019-10-14 23:13:36,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:36,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:36,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:36,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:36,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:36,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:36,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:36,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:36,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:36,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:36,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:36,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:36,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:36,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:36,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:36,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:36,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:36,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:36,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:36,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:36,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:36,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:36,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:36,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:36,112 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:36,112 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:36,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:36,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:36,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:36,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:36,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:36,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:36,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:36,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:36,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:36,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:36,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:36,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:36,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:36,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:36,123 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:36,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:36,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:36,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:36,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:36,150 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:36,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:36,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:36,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:36,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:36,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:36,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:36,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:36,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:36,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:36,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:36,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:36,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:36,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:36,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:36,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:36,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:36,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:36,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:36,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:36,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:36,156 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:36,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:36,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:36,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:36,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:36,502 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:36,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:36,507 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:36,508 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:36,508 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-10-14 23:13:36,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f26cab8/71899dd445f245368909153d29a9d11a/FLAGe34913238 [2019-10-14 23:13:37,049 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:37,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-14 23:13:37,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f26cab8/71899dd445f245368909153d29a9d11a/FLAGe34913238 [2019-10-14 23:13:37,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f26cab8/71899dd445f245368909153d29a9d11a [2019-10-14 23:13:37,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:37,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:37,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:37,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:37,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:37,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c679016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37, skipping insertion in model container [2019-10-14 23:13:37,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:37,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:37,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:37,650 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:37,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:37,714 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:37,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37 WrapperNode [2019-10-14 23:13:37,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:37,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:37,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:37,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:37,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... [2019-10-14 23:13:37,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:37,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:37,847 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:37,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:37,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:37,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:37,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:37,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:37,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:38,298 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:38,299 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:38,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:38 BoogieIcfgContainer [2019-10-14 23:13:38,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:38,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:38,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:38,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:38,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:37" (1/3) ... [2019-10-14 23:13:38,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ebf85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:38, skipping insertion in model container [2019-10-14 23:13:38,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:37" (2/3) ... [2019-10-14 23:13:38,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ebf85d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:38, skipping insertion in model container [2019-10-14 23:13:38,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:38" (3/3) ... [2019-10-14 23:13:38,310 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-14 23:13:38,320 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:38,328 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:38,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:38,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:38,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:38,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:38,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:38,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:38,367 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:38,367 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:38,367 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-14 23:13:38,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:38,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,403 INFO L380 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-10-14 23:13:38,405 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-10-14 23:13:38,418 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49464879] [2019-10-14 23:13:38,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,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-10-14 23:13:38,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49464879] [2019-10-14 23:13:38,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681629338] [2019-10-14 23:13:38,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,640 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-10-14 23:13:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,699 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-10-14 23:13:38,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,714 INFO L225 Difference]: With dead ends: 105 [2019-10-14 23:13:38,714 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 23:13:38,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 23:13:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-10-14 23:13:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-14 23:13:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-10-14 23:13:38,764 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-10-14 23:13:38,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,765 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-10-14 23:13:38,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,765 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-10-14 23:13:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 23:13:38,766 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,766 INFO L380 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-10-14 23:13:38,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-10-14 23:13:38,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534589223] [2019-10-14 23:13:38,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:38,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534589223] [2019-10-14 23:13:38,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:38,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:38,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148591338] [2019-10-14 23:13:38,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:38,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:38,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,851 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-10-14 23:13:38,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:38,890 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-10-14 23:13:38,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:38,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-14 23:13:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:38,893 INFO L225 Difference]: With dead ends: 147 [2019-10-14 23:13:38,893 INFO L226 Difference]: Without dead ends: 90 [2019-10-14 23:13:38,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-14 23:13:38,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-14 23:13:38,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-14 23:13:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-10-14 23:13:38,919 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-10-14 23:13:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:38,922 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-10-14 23:13:38,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-10-14 23:13:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:38,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:38,925 INFO L380 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-10-14 23:13:38,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:38,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-10-14 23:13:38,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:38,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512831043] [2019-10-14 23:13:38,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:38,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,025 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512831043] [2019-10-14 23:13:39,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943251360] [2019-10-14 23:13:39,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,026 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,027 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-10-14 23:13:39,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,054 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-10-14 23:13:39,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,056 INFO L225 Difference]: With dead ends: 135 [2019-10-14 23:13:39,057 INFO L226 Difference]: Without dead ends: 93 [2019-10-14 23:13:39,057 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-14 23:13:39,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-14 23:13:39,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-14 23:13:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-10-14 23:13:39,069 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-10-14 23:13:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,069 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-10-14 23:13:39,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-10-14 23:13:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:39,070 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,070 INFO L380 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-10-14 23:13:39,071 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-10-14 23:13:39,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256877328] [2019-10-14 23:13:39,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256877328] [2019-10-14 23:13:39,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965647068] [2019-10-14 23:13:39,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,133 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-10-14 23:13:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,165 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-10-14 23:13:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,171 INFO L225 Difference]: With dead ends: 172 [2019-10-14 23:13:39,171 INFO L226 Difference]: Without dead ends: 170 [2019-10-14 23:13:39,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-14 23:13:39,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-10-14 23:13:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-14 23:13:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-10-14 23:13:39,203 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-10-14 23:13:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,204 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-10-14 23:13:39,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-10-14 23:13:39,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:39,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,206 INFO L380 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-10-14 23:13:39,206 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-10-14 23:13:39,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377849527] [2019-10-14 23:13:39,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377849527] [2019-10-14 23:13:39,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260677934] [2019-10-14 23:13:39,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,274 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-10-14 23:13:39,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,313 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-10-14 23:13:39,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:39,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,316 INFO L225 Difference]: With dead ends: 284 [2019-10-14 23:13:39,316 INFO L226 Difference]: Without dead ends: 172 [2019-10-14 23:13:39,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-14 23:13:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-14 23:13:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-14 23:13:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-10-14 23:13:39,332 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-10-14 23:13:39,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,333 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-10-14 23:13:39,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-10-14 23:13:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:39,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,335 INFO L380 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-10-14 23:13:39,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-10-14 23:13:39,336 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100086538] [2019-10-14 23:13:39,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100086538] [2019-10-14 23:13:39,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330247297] [2019-10-14 23:13:39,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,380 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-10-14 23:13:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,408 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-10-14 23:13:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,411 INFO L225 Difference]: With dead ends: 255 [2019-10-14 23:13:39,411 INFO L226 Difference]: Without dead ends: 174 [2019-10-14 23:13:39,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-14 23:13:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-14 23:13:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-14 23:13:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-10-14 23:13:39,450 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-10-14 23:13:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,450 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-10-14 23:13:39,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,451 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-10-14 23:13:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:39,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,457 INFO L380 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-10-14 23:13:39,458 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-10-14 23:13:39,459 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726651465] [2019-10-14 23:13:39,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726651465] [2019-10-14 23:13:39,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956197544] [2019-10-14 23:13:39,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,537 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-10-14 23:13:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,575 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-10-14 23:13:39,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,580 INFO L225 Difference]: With dead ends: 324 [2019-10-14 23:13:39,580 INFO L226 Difference]: Without dead ends: 322 [2019-10-14 23:13:39,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-14 23:13:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-10-14 23:13:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-14 23:13:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-10-14 23:13:39,598 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-10-14 23:13:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,598 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-10-14 23:13:39,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-10-14 23:13:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:39,600 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,600 INFO L380 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-10-14 23:13:39,601 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-10-14 23:13:39,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717195333] [2019-10-14 23:13:39,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717195333] [2019-10-14 23:13:39,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794892548] [2019-10-14 23:13:39,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,646 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,646 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-10-14 23:13:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,691 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-10-14 23:13:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,694 INFO L225 Difference]: With dead ends: 552 [2019-10-14 23:13:39,694 INFO L226 Difference]: Without dead ends: 330 [2019-10-14 23:13:39,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-14 23:13:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-10-14 23:13:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-14 23:13:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-10-14 23:13:39,725 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-10-14 23:13:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,726 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-10-14 23:13:39,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-10-14 23:13:39,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:39,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,732 INFO L380 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-10-14 23:13:39,732 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-10-14 23:13:39,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082055565] [2019-10-14 23:13:39,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082055565] [2019-10-14 23:13:39,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223977314] [2019-10-14 23:13:39,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,795 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-10-14 23:13:39,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,826 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-10-14 23:13:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:39,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,829 INFO L225 Difference]: With dead ends: 492 [2019-10-14 23:13:39,830 INFO L226 Difference]: Without dead ends: 334 [2019-10-14 23:13:39,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-14 23:13:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-10-14 23:13:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-14 23:13:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-10-14 23:13:39,849 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-10-14 23:13:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-10-14 23:13:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-10-14 23:13:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:39,852 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,853 INFO L380 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-10-14 23:13:39,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,856 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-10-14 23:13:39,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697760878] [2019-10-14 23:13:39,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:39,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697760878] [2019-10-14 23:13:39,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:39,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:39,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150175848] [2019-10-14 23:13:39,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:39,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,916 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-10-14 23:13:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:39,948 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-10-14 23:13:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:39,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:39,953 INFO L225 Difference]: With dead ends: 620 [2019-10-14 23:13:39,953 INFO L226 Difference]: Without dead ends: 618 [2019-10-14 23:13:39,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-14 23:13:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-10-14 23:13:39,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-14 23:13:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-10-14 23:13:39,980 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-10-14 23:13:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:39,980 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-10-14 23:13:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-10-14 23:13:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:39,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:39,987 INFO L380 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-10-14 23:13:39,987 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-10-14 23:13:39,988 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:39,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533675447] [2019-10-14 23:13:39,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,988 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:39,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533675447] [2019-10-14 23:13:40,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873925329] [2019-10-14 23:13:40,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,031 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-10-14 23:13:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,073 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-10-14 23:13:40,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,079 INFO L225 Difference]: With dead ends: 1084 [2019-10-14 23:13:40,079 INFO L226 Difference]: Without dead ends: 642 [2019-10-14 23:13:40,081 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-14 23:13:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-10-14 23:13:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-14 23:13:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-10-14 23:13:40,107 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-10-14 23:13:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,107 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-10-14 23:13:40,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-10-14 23:13:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:40,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,109 INFO L380 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-10-14 23:13:40,109 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,109 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-10-14 23:13:40,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730394322] [2019-10-14 23:13:40,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730394322] [2019-10-14 23:13:40,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897135684] [2019-10-14 23:13:40,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,158 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-10-14 23:13:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,179 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-10-14 23:13:40,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,183 INFO L225 Difference]: With dead ends: 960 [2019-10-14 23:13:40,183 INFO L226 Difference]: Without dead ends: 650 [2019-10-14 23:13:40,184 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-14 23:13:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-14 23:13:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-14 23:13:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-10-14 23:13:40,204 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-10-14 23:13:40,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,204 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-10-14 23:13:40,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,205 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-10-14 23:13:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:40,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,206 INFO L380 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-10-14 23:13:40,206 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-10-14 23:13:40,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904380140] [2019-10-14 23:13:40,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904380140] [2019-10-14 23:13:40,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,230 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117666078] [2019-10-14 23:13:40,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,231 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-10-14 23:13:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,255 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-10-14 23:13:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,261 INFO L225 Difference]: With dead ends: 1196 [2019-10-14 23:13:40,262 INFO L226 Difference]: Without dead ends: 1194 [2019-10-14 23:13:40,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-14 23:13:40,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-10-14 23:13:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-14 23:13:40,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-10-14 23:13:40,292 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-10-14 23:13:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,292 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-10-14 23:13:40,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-10-14 23:13:40,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:40,295 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,295 INFO L380 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-10-14 23:13:40,295 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,296 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-10-14 23:13:40,296 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495685634] [2019-10-14 23:13:40,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495685634] [2019-10-14 23:13:40,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,325 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947997625] [2019-10-14 23:13:40,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,326 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-10-14 23:13:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,365 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-10-14 23:13:40,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,373 INFO L225 Difference]: With dead ends: 2140 [2019-10-14 23:13:40,373 INFO L226 Difference]: Without dead ends: 1258 [2019-10-14 23:13:40,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-14 23:13:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-14 23:13:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-14 23:13:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-10-14 23:13:40,433 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-10-14 23:13:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,433 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-10-14 23:13:40,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-10-14 23:13:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:40,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,435 INFO L380 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-10-14 23:13:40,436 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,436 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-10-14 23:13:40,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021358380] [2019-10-14 23:13:40,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021358380] [2019-10-14 23:13:40,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173426727] [2019-10-14 23:13:40,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,478 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-10-14 23:13:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,514 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-10-14 23:13:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,523 INFO L225 Difference]: With dead ends: 1884 [2019-10-14 23:13:40,524 INFO L226 Difference]: Without dead ends: 1274 [2019-10-14 23:13:40,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-10-14 23:13:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-10-14 23:13:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-10-14 23:13:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-10-14 23:13:40,570 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-10-14 23:13:40,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,571 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-10-14 23:13:40,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-10-14 23:13:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:40,574 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,574 INFO L380 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-10-14 23:13:40,574 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-10-14 23:13:40,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689169309] [2019-10-14 23:13:40,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689169309] [2019-10-14 23:13:40,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344200306] [2019-10-14 23:13:40,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,606 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-10-14 23:13:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,657 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-10-14 23:13:40,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,670 INFO L225 Difference]: With dead ends: 2316 [2019-10-14 23:13:40,670 INFO L226 Difference]: Without dead ends: 2314 [2019-10-14 23:13:40,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-14 23:13:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-10-14 23:13:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-10-14 23:13:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-10-14 23:13:40,728 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-10-14 23:13:40,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,729 INFO L462 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-10-14 23:13:40,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-10-14 23:13:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:40,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,732 INFO L380 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-10-14 23:13:40,732 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-10-14 23:13:40,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8129896] [2019-10-14 23:13:40,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8129896] [2019-10-14 23:13:40,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986519487] [2019-10-14 23:13:40,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,757 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-10-14 23:13:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,813 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-10-14 23:13:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,826 INFO L225 Difference]: With dead ends: 4236 [2019-10-14 23:13:40,827 INFO L226 Difference]: Without dead ends: 2474 [2019-10-14 23:13:40,831 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-10-14 23:13:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-10-14 23:13:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-10-14 23:13:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-10-14 23:13:40,904 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-10-14 23:13:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:40,904 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-10-14 23:13:40,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-10-14 23:13:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:40,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:40,908 INFO L380 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-10-14 23:13:40,908 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-10-14 23:13:40,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:40,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723390871] [2019-10-14 23:13:40,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:40,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723390871] [2019-10-14 23:13:40,931 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:40,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:40,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070704205] [2019-10-14 23:13:40,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:40,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:40,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:40,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:40,933 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-10-14 23:13:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:40,985 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-10-14 23:13:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:40,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:40,998 INFO L225 Difference]: With dead ends: 3708 [2019-10-14 23:13:40,998 INFO L226 Difference]: Without dead ends: 2506 [2019-10-14 23:13:41,001 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-14 23:13:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-10-14 23:13:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-14 23:13:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-10-14 23:13:41,088 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-10-14 23:13:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,089 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-10-14 23:13:41,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-10-14 23:13:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:41,092 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,093 INFO L380 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-10-14 23:13:41,093 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-10-14 23:13:41,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842130721] [2019-10-14 23:13:41,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842130721] [2019-10-14 23:13:41,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334093815] [2019-10-14 23:13:41,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,119 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-10-14 23:13:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,175 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-10-14 23:13:41,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,198 INFO L225 Difference]: With dead ends: 4492 [2019-10-14 23:13:41,199 INFO L226 Difference]: Without dead ends: 4490 [2019-10-14 23:13:41,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-14 23:13:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-10-14 23:13:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-14 23:13:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-10-14 23:13:41,300 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-10-14 23:13:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,300 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-10-14 23:13:41,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-10-14 23:13:41,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:41,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,307 INFO L380 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-10-14 23:13:41,307 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-10-14 23:13:41,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249493354] [2019-10-14 23:13:41,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249493354] [2019-10-14 23:13:41,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,333 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046785566] [2019-10-14 23:13:41,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,335 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-10-14 23:13:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,419 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-10-14 23:13:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,471 INFO L225 Difference]: With dead ends: 8396 [2019-10-14 23:13:41,471 INFO L226 Difference]: Without dead ends: 4874 [2019-10-14 23:13:41,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-14 23:13:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-10-14 23:13:41,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-10-14 23:13:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-10-14 23:13:41,646 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-10-14 23:13:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,646 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-10-14 23:13:41,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-10-14 23:13:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:41,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,652 INFO L380 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-10-14 23:13:41,653 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-10-14 23:13:41,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533675023] [2019-10-14 23:13:41,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533675023] [2019-10-14 23:13:41,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278349442] [2019-10-14 23:13:41,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,677 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-10-14 23:13:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:41,745 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-10-14 23:13:41,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:41,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:41,757 INFO L225 Difference]: With dead ends: 7308 [2019-10-14 23:13:41,757 INFO L226 Difference]: Without dead ends: 4938 [2019-10-14 23:13:41,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-10-14 23:13:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-10-14 23:13:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-10-14 23:13:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-10-14 23:13:41,905 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-10-14 23:13:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:41,906 INFO L462 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-10-14 23:13:41,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:41,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-10-14 23:13:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:41,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:41,916 INFO L380 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-10-14 23:13:41,916 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:41,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:41,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-10-14 23:13:41,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:41,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951575730] [2019-10-14 23:13:41,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,918 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:41,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:41,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951575730] [2019-10-14 23:13:41,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:41,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:41,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989425248] [2019-10-14 23:13:41,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:41,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:41,948 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-10-14 23:13:42,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:42,124 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-10-14 23:13:42,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:42,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:42,154 INFO L225 Difference]: With dead ends: 14412 [2019-10-14 23:13:42,155 INFO L226 Difference]: Without dead ends: 9610 [2019-10-14 23:13:42,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-10-14 23:13:42,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-10-14 23:13:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-14 23:13:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-10-14 23:13:42,615 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-10-14 23:13:42,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:42,615 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-10-14 23:13:42,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-10-14 23:13:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:42,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:42,629 INFO L380 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-10-14 23:13:42,630 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:42,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-10-14 23:13:42,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:42,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459265910] [2019-10-14 23:13:42,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:42,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:42,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459265910] [2019-10-14 23:13:42,674 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:42,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:42,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652390637] [2019-10-14 23:13:42,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:42,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:42,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,679 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-10-14 23:13:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:42,881 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-10-14 23:13:42,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:42,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:42,915 INFO L225 Difference]: With dead ends: 11148 [2019-10-14 23:13:42,916 INFO L226 Difference]: Without dead ends: 11146 [2019-10-14 23:13:42,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-14 23:13:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-10-14 23:13:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-14 23:13:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-10-14 23:13:43,405 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-10-14 23:13:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:43,406 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-10-14 23:13:43,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-10-14 23:13:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:43,417 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:43,418 INFO L380 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-10-14 23:13:43,418 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:43,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:43,418 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-10-14 23:13:43,419 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:43,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041731594] [2019-10-14 23:13:43,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,419 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:43,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:43,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041731594] [2019-10-14 23:13:43,445 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:43,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:43,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303218755] [2019-10-14 23:13:43,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:43,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:43,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:43,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,446 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-10-14 23:13:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:43,621 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-10-14 23:13:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:43,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:43,656 INFO L225 Difference]: With dead ends: 16780 [2019-10-14 23:13:43,657 INFO L226 Difference]: Without dead ends: 16778 [2019-10-14 23:13:43,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-10-14 23:13:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-10-14 23:13:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-14 23:13:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-10-14 23:13:44,711 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-10-14 23:13:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:44,711 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-10-14 23:13:44,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-10-14 23:13:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:44,738 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:44,739 INFO L380 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-10-14 23:13:44,739 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-10-14 23:13:44,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:44,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658984413] [2019-10-14 23:13:44,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:44,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:44,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:44,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658984413] [2019-10-14 23:13:44,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:44,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:44,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775722111] [2019-10-14 23:13:44,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:44,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:44,774 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-10-14 23:13:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:45,131 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-10-14 23:13:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:45,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:45,187 INFO L225 Difference]: With dead ends: 32908 [2019-10-14 23:13:45,188 INFO L226 Difference]: Without dead ends: 18826 [2019-10-14 23:13:45,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-10-14 23:13:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-10-14 23:13:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-10-14 23:13:45,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-10-14 23:13:45,787 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-10-14 23:13:45,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:45,788 INFO L462 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-10-14 23:13:45,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:45,788 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-10-14 23:13:45,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:45,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:45,809 INFO L380 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-10-14 23:13:45,810 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:45,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:45,810 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-10-14 23:13:45,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:45,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261141141] [2019-10-14 23:13:45,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:45,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:45,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261141141] [2019-10-14 23:13:45,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:45,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:45,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254294303] [2019-10-14 23:13:45,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:45,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:45,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:45,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:45,831 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-10-14 23:13:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:46,091 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-10-14 23:13:46,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:46,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:46,143 INFO L225 Difference]: With dead ends: 28428 [2019-10-14 23:13:46,143 INFO L226 Difference]: Without dead ends: 19210 [2019-10-14 23:13:46,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-10-14 23:13:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-10-14 23:13:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-10-14 23:13:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-10-14 23:13:47,071 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-10-14 23:13:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:47,072 INFO L462 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-10-14 23:13:47,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-10-14 23:13:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:47,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:47,104 INFO L380 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-10-14 23:13:47,104 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-10-14 23:13:47,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:47,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690103833] [2019-10-14 23:13:47,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:47,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:47,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690103833] [2019-10-14 23:13:47,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:47,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:47,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791140183] [2019-10-14 23:13:47,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:47,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:47,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:47,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:47,138 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-10-14 23:13:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:47,571 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-10-14 23:13:47,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:47,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:47,633 INFO L225 Difference]: With dead ends: 32780 [2019-10-14 23:13:47,633 INFO L226 Difference]: Without dead ends: 32778 [2019-10-14 23:13:47,646 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:47,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-10-14 23:13:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-10-14 23:13:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-10-14 23:13:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-10-14 23:13:48,365 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-10-14 23:13:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:48,366 INFO L462 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-10-14 23:13:48,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-10-14 23:13:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:48,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:48,414 INFO L380 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-10-14 23:13:48,414 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-10-14 23:13:48,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:48,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708291910] [2019-10-14 23:13:48,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:48,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708291910] [2019-10-14 23:13:48,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:48,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:48,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942477200] [2019-10-14 23:13:48,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:48,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:48,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,441 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-10-14 23:13:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,903 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-10-14 23:13:48,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,973 INFO L225 Difference]: With dead ends: 65548 [2019-10-14 23:13:48,973 INFO L226 Difference]: Without dead ends: 37386 [2019-10-14 23:13:49,029 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-10-14 23:13:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-10-14 23:13:50,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-10-14 23:13:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-10-14 23:13:50,642 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-10-14 23:13:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,642 INFO L462 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-10-14 23:13:50,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-10-14 23:13:50,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:50,674 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,674 INFO L380 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-10-14 23:13:50,674 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-10-14 23:13:50,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051000385] [2019-10-14 23:13:50,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051000385] [2019-10-14 23:13:50,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950181638] [2019-10-14 23:13:50,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,704 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-10-14 23:13:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,065 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-10-14 23:13:51,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,136 INFO L225 Difference]: With dead ends: 56076 [2019-10-14 23:13:51,136 INFO L226 Difference]: Without dead ends: 37898 [2019-10-14 23:13:51,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-10-14 23:13:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-10-14 23:13:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-10-14 23:13:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-10-14 23:13:52,013 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-10-14 23:13:52,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,013 INFO L462 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-10-14 23:13:52,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,013 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-10-14 23:13:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:52,045 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,045 INFO L380 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-10-14 23:13:52,046 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,047 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-10-14 23:13:52,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,047 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445159077] [2019-10-14 23:13:52,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,047 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445159077] [2019-10-14 23:13:52,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544892372] [2019-10-14 23:13:52,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,069 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-10-14 23:13:52,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,726 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-10-14 23:13:52,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,841 INFO L225 Difference]: With dead ends: 63500 [2019-10-14 23:13:52,841 INFO L226 Difference]: Without dead ends: 63498 [2019-10-14 23:13:52,866 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-10-14 23:13:53,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-10-14 23:13:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-10-14 23:13:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-10-14 23:13:54,039 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-10-14 23:13:54,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,039 INFO L462 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-10-14 23:13:54,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-10-14 23:13:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:54,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,106 INFO L380 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-10-14 23:13:54,106 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-10-14 23:13:54,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701086998] [2019-10-14 23:13:54,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,108 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,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-10-14 23:13:54,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701086998] [2019-10-14 23:13:54,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427263905] [2019-10-14 23:13:54,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,129 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-10-14 23:13:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,994 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-10-14 23:13:54,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,116 INFO L225 Difference]: With dead ends: 130060 [2019-10-14 23:13:55,116 INFO L226 Difference]: Without dead ends: 73738 [2019-10-14 23:13:55,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-10-14 23:13:57,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-10-14 23:13:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-10-14 23:13:57,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-10-14 23:13:57,793 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-10-14 23:13:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:57,793 INFO L462 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-10-14 23:13:57,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:57,794 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-10-14 23:13:57,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:13:57,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:57,839 INFO L380 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-10-14 23:13:57,839 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:57,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-10-14 23:13:57,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:57,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130725314] [2019-10-14 23:13:57,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:57,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:57,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:57,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130725314] [2019-10-14 23:13:57,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:57,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:57,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088959474] [2019-10-14 23:13:57,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:57,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:57,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:57,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,871 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-10-14 23:13:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:58,385 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-10-14 23:13:58,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:58,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:13:58,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:58,478 INFO L225 Difference]: With dead ends: 110604 [2019-10-14 23:13:58,478 INFO L226 Difference]: Without dead ends: 74762 [2019-10-14 23:13:58,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-10-14 23:13:59,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-10-14 23:13:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-10-14 23:13:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-10-14 23:13:59,625 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-10-14 23:13:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:59,625 INFO L462 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-10-14 23:13:59,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-10-14 23:13:59,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:13:59,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:59,655 INFO L380 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-10-14 23:13:59,655 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:59,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:59,655 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-10-14 23:13:59,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:59,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28292423] [2019-10-14 23:13:59,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:59,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:59,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28292423] [2019-10-14 23:13:59,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:59,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:59,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817996647] [2019-10-14 23:13:59,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:59,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:59,677 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-10-14 23:14:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:00,735 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-10-14 23:14:00,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:00,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:14:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:00,826 INFO L225 Difference]: With dead ends: 122892 [2019-10-14 23:14:00,826 INFO L226 Difference]: Without dead ends: 122890 [2019-10-14 23:14:00,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:00,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-10-14 23:14:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-10-14 23:14:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-10-14 23:14:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-10-14 23:14:04,105 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-10-14 23:14:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:04,106 INFO L462 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-10-14 23:14:04,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-10-14 23:14:04,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:14:04,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:04,165 INFO L380 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-10-14 23:14:04,165 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:04,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:04,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-10-14 23:14:04,166 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:04,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8710437] [2019-10-14 23:14:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:04,166 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:04,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:04,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8710437] [2019-10-14 23:14:04,197 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:04,197 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:04,197 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494967406] [2019-10-14 23:14:04,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:04,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:04,198 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-10-14 23:14:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:05,154 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-10-14 23:14:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:05,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:14:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:05,283 INFO L225 Difference]: With dead ends: 258060 [2019-10-14 23:14:05,283 INFO L226 Difference]: Without dead ends: 145418 [2019-10-14 23:14:05,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-10-14 23:14:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-10-14 23:14:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-10-14 23:14:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-10-14 23:14:07,437 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-10-14 23:14:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:07,437 INFO L462 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-10-14 23:14:07,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-10-14 23:14:07,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:07,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:07,496 INFO L380 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-10-14 23:14:07,497 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-10-14 23:14:07,497 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:07,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316242134] [2019-10-14 23:14:07,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:07,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316242134] [2019-10-14 23:14:07,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:07,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:07,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526815688] [2019-10-14 23:14:07,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:07,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:07,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:07,518 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states.