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-f4eb214f-m [2019-10-13 19:14:36,730 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:36,733 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:36,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:36,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:36,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:36,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:36,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:36,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:36,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:36,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:36,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:36,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:36,761 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:36,762 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:36,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:36,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:36,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:36,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:36,768 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:36,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:36,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:36,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:36,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:36,774 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:36,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:36,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:36,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:36,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:36,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:36,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:36,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:36,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:36,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:36,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:36,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:36,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:36,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:36,782 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:36,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:36,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:36,787 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-13 19:14:36,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:36,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:36,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:36,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:36,810 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:36,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:36,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:36,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:36,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:36,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:36,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:36,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:36,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:36,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:36,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:36,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:36,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:36,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:36,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:36,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:36,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:36,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:36,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:36,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:36,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:36,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:36,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:36,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:36,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:37,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:37,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:37,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:37,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:37,135 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:37,136 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-13 19:14:37,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1980068ee/e590c4df738f4510985f8ac44ab262cc/FLAG1614502fa [2019-10-13 19:14:37,657 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:37,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-13 19:14:37,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1980068ee/e590c4df738f4510985f8ac44ab262cc/FLAG1614502fa [2019-10-13 19:14:38,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1980068ee/e590c4df738f4510985f8ac44ab262cc [2019-10-13 19:14:38,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:38,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:38,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:38,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:38,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:38,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337d46e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38, skipping insertion in model container [2019-10-13 19:14:38,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,097 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:38,134 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:38,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:38,365 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:38,399 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:38,516 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:38,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38 WrapperNode [2019-10-13 19:14:38,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:38,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:38,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:38,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:38,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (1/1) ... [2019-10-13 19:14:38,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:38,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:38,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:38,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:38,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (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-13 19:14:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:38,982 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:38,982 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:38,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:38 BoogieIcfgContainer [2019-10-13 19:14:38,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:38,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:38,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:38,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:39,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:38" (1/3) ... [2019-10-13 19:14:39,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6702d117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:39, skipping insertion in model container [2019-10-13 19:14:39,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:38" (2/3) ... [2019-10-13 19:14:39,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6702d117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:39, skipping insertion in model container [2019-10-13 19:14:39,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:38" (3/3) ... [2019-10-13 19:14:39,006 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-13 19:14:39,031 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:39,042 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:39,053 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:39,086 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:39,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:39,087 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:39,087 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:39,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:39,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:39,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:39,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-10-13 19:14:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:39,120 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,121 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-13 19:14:39,122 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-10-13 19:14:39,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523756967] [2019-10-13 19:14:39,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523756967] [2019-10-13 19:14:39,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147440662] [2019-10-13 19:14:39,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,385 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,402 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-10-13 19:14:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,468 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-10-13 19:14:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,482 INFO L225 Difference]: With dead ends: 105 [2019-10-13 19:14:39,483 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 19:14:39,486 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-13 19:14:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 19:14:39,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-10-13 19:14:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-13 19:14:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-10-13 19:14:39,538 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-10-13 19:14:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,539 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-10-13 19:14:39,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-10-13 19:14:39,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-13 19:14:39,540 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,540 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-13 19:14:39,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-10-13 19:14:39,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577393737] [2019-10-13 19:14:39,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577393737] [2019-10-13 19:14:39,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927311625] [2019-10-13 19:14:39,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,620 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-10-13 19:14:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,667 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-10-13 19:14:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-13 19:14:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,672 INFO L225 Difference]: With dead ends: 147 [2019-10-13 19:14:39,673 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 19:14:39,674 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-13 19:14:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 19:14:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-10-13 19:14:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-13 19:14:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-10-13 19:14:39,691 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-10-13 19:14:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,692 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-10-13 19:14:39,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-10-13 19:14:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:39,693 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,694 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-13 19:14:39,694 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,695 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-10-13 19:14:39,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167326646] [2019-10-13 19:14:39,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,801 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-13 19:14:39,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167326646] [2019-10-13 19:14:39,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,802 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,802 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674823065] [2019-10-13 19:14:39,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,804 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-10-13 19:14:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,844 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-10-13 19:14:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,848 INFO L225 Difference]: With dead ends: 135 [2019-10-13 19:14:39,850 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:14:39,851 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-13 19:14:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:14:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-10-13 19:14:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-13 19:14:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-10-13 19:14:39,874 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-10-13 19:14:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:39,875 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-10-13 19:14:39,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-10-13 19:14:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:39,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:39,876 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-13 19:14:39,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:39,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-10-13 19:14:39,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:39,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750047182] [2019-10-13 19:14:39,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:39,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:39,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:39,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750047182] [2019-10-13 19:14:39,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:39,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:39,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319823114] [2019-10-13 19:14:39,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:39,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:39,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:39,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:39,961 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-10-13 19:14:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:39,989 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-10-13 19:14:39,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:39,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:39,992 INFO L225 Difference]: With dead ends: 172 [2019-10-13 19:14:39,992 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 19:14:39,993 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-13 19:14:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 19:14:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-10-13 19:14:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-13 19:14:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-10-13 19:14:40,007 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-10-13 19:14:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,007 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-10-13 19:14:40,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-10-13 19:14:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:14:40,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,009 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-13 19:14:40,010 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-10-13 19:14:40,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337979628] [2019-10-13 19:14:40,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,054 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-13 19:14:40,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337979628] [2019-10-13 19:14:40,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67182434] [2019-10-13 19:14:40,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,059 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-10-13 19:14:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,092 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-10-13 19:14:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-13 19:14:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,095 INFO L225 Difference]: With dead ends: 284 [2019-10-13 19:14:40,096 INFO L226 Difference]: Without dead ends: 172 [2019-10-13 19:14:40,099 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-13 19:14:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-13 19:14:40,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-13 19:14:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-13 19:14:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-10-13 19:14:40,117 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-10-13 19:14:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,117 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-10-13 19:14:40,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-10-13 19:14:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:40,119 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,119 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-13 19:14:40,120 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-10-13 19:14:40,121 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985188186] [2019-10-13 19:14:40,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,200 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-13 19:14:40,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985188186] [2019-10-13 19:14:40,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619740297] [2019-10-13 19:14:40,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,203 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-10-13 19:14:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,233 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-10-13 19:14:40,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,235 INFO L225 Difference]: With dead ends: 255 [2019-10-13 19:14:40,235 INFO L226 Difference]: Without dead ends: 174 [2019-10-13 19:14:40,238 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-13 19:14:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-13 19:14:40,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-10-13 19:14:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-10-13 19:14:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-10-13 19:14:40,264 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-10-13 19:14:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-10-13 19:14:40,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-10-13 19:14:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:40,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,269 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-13 19:14:40,269 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-10-13 19:14:40,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785250220] [2019-10-13 19:14:40,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,311 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-13 19:14:40,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785250220] [2019-10-13 19:14:40,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528130187] [2019-10-13 19:14:40,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,313 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,313 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-10-13 19:14:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,348 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-10-13 19:14:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,352 INFO L225 Difference]: With dead ends: 324 [2019-10-13 19:14:40,352 INFO L226 Difference]: Without dead ends: 322 [2019-10-13 19:14:40,353 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-13 19:14:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-13 19:14:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-10-13 19:14:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 19:14:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-10-13 19:14:40,378 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-10-13 19:14:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-10-13 19:14:40,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-10-13 19:14:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:40,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,382 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-13 19:14:40,382 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-10-13 19:14:40,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787249992] [2019-10-13 19:14:40,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,422 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-13 19:14:40,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787249992] [2019-10-13 19:14:40,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033728292] [2019-10-13 19:14:40,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,426 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-10-13 19:14:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,466 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-10-13 19:14:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,468 INFO L225 Difference]: With dead ends: 552 [2019-10-13 19:14:40,469 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 19:14:40,470 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-13 19:14:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 19:14:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-10-13 19:14:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-10-13 19:14:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-10-13 19:14:40,482 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-10-13 19:14:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,483 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-10-13 19:14:40,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-10-13 19:14:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:40,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,485 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-13 19:14:40,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-10-13 19:14:40,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799665946] [2019-10-13 19:14:40,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,515 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-13 19:14:40,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799665946] [2019-10-13 19:14:40,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942593561] [2019-10-13 19:14:40,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,517 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-10-13 19:14:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,536 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-10-13 19:14:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,539 INFO L225 Difference]: With dead ends: 492 [2019-10-13 19:14:40,539 INFO L226 Difference]: Without dead ends: 334 [2019-10-13 19:14:40,540 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-13 19:14:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-13 19:14:40,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-10-13 19:14:40,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-10-13 19:14:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-10-13 19:14:40,551 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-10-13 19:14:40,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,552 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-10-13 19:14:40,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-10-13 19:14:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:40,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,553 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-13 19:14:40,554 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-10-13 19:14:40,554 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155923618] [2019-10-13 19:14:40,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,593 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-13 19:14:40,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155923618] [2019-10-13 19:14:40,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528568336] [2019-10-13 19:14:40,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,595 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-10-13 19:14:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,616 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-10-13 19:14:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,621 INFO L225 Difference]: With dead ends: 620 [2019-10-13 19:14:40,621 INFO L226 Difference]: Without dead ends: 618 [2019-10-13 19:14:40,621 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-13 19:14:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-13 19:14:40,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-10-13 19:14:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 19:14:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-10-13 19:14:40,637 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-10-13 19:14:40,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,638 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-10-13 19:14:40,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-10-13 19:14:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:40,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,640 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-13 19:14:40,640 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,640 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-10-13 19:14:40,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21571482] [2019-10-13 19:14:40,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,663 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-13 19:14:40,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21571482] [2019-10-13 19:14:40,664 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487687551] [2019-10-13 19:14:40,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,666 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-10-13 19:14:40,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,697 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-10-13 19:14:40,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:40,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,703 INFO L225 Difference]: With dead ends: 1084 [2019-10-13 19:14:40,703 INFO L226 Difference]: Without dead ends: 642 [2019-10-13 19:14:40,705 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-13 19:14:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-13 19:14:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-10-13 19:14:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-10-13 19:14:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-10-13 19:14:40,730 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-10-13 19:14:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,730 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-10-13 19:14:40,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-10-13 19:14:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:40,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14: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] [2019-10-13 19:14:40,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-10-13 19:14:40,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708484930] [2019-10-13 19:14:40,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,773 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-13 19:14:40,776 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708484930] [2019-10-13 19:14:40,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696011326] [2019-10-13 19:14:40,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,778 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-10-13 19:14:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,803 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-10-13 19:14:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,807 INFO L225 Difference]: With dead ends: 960 [2019-10-13 19:14:40,807 INFO L226 Difference]: Without dead ends: 650 [2019-10-13 19:14:40,808 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-13 19:14:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-10-13 19:14:40,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-10-13 19:14:40,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-13 19:14:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-10-13 19:14:40,828 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-10-13 19:14:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,829 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-10-13 19:14:40,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,830 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-10-13 19:14:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:40,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,831 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-13 19:14:40,831 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-10-13 19:14:40,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457324358] [2019-10-13 19:14:40,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,862 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-13 19:14:40,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457324358] [2019-10-13 19:14:40,868 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097036002] [2019-10-13 19:14:40,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,873 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-10-13 19:14:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:40,904 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-10-13 19:14:40,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:40,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:40,912 INFO L225 Difference]: With dead ends: 1196 [2019-10-13 19:14:40,912 INFO L226 Difference]: Without dead ends: 1194 [2019-10-13 19:14:40,913 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-13 19:14:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-10-13 19:14:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-10-13 19:14:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-10-13 19:14:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-10-13 19:14:40,946 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-10-13 19:14:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:40,947 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-10-13 19:14:40,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-10-13 19:14:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:40,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:40,950 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-13 19:14:40,950 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-10-13 19:14:40,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:40,951 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76173109] [2019-10-13 19:14:40,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,951 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:40,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:40,977 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-13 19:14:40,978 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76173109] [2019-10-13 19:14:40,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:40,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:40,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658760693] [2019-10-13 19:14:40,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:40,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:40,980 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-10-13 19:14:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,016 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-10-13 19:14:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,023 INFO L225 Difference]: With dead ends: 2140 [2019-10-13 19:14:41,023 INFO L226 Difference]: Without dead ends: 1258 [2019-10-13 19:14:41,026 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-13 19:14:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-10-13 19:14:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-10-13 19:14:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-10-13 19:14:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-10-13 19:14:41,073 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-10-13 19:14:41,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,073 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-10-13 19:14:41,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-10-13 19:14:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:41,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,076 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-13 19:14:41,076 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,077 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-10-13 19:14:41,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173332974] [2019-10-13 19:14:41,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,123 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-13 19:14:41,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173332974] [2019-10-13 19:14:41,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003193151] [2019-10-13 19:14:41,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,127 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-10-13 19:14:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,168 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-10-13 19:14:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,175 INFO L225 Difference]: With dead ends: 1884 [2019-10-13 19:14:41,175 INFO L226 Difference]: Without dead ends: 1274 [2019-10-13 19:14:41,179 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-13 19:14:41,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-10-13 19:14:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-10-13 19:14:41,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-10-13 19:14:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-10-13 19:14:41,225 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-10-13 19:14:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,226 INFO L462 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-10-13 19:14:41,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-10-13 19:14:41,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:41,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,229 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-13 19:14:41,230 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-10-13 19:14:41,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620156037] [2019-10-13 19:14:41,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,265 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-13 19:14:41,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620156037] [2019-10-13 19:14:41,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538226000] [2019-10-13 19:14:41,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,269 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-10-13 19:14:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,315 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-10-13 19:14:41,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,327 INFO L225 Difference]: With dead ends: 2316 [2019-10-13 19:14:41,328 INFO L226 Difference]: Without dead ends: 2314 [2019-10-13 19:14:41,329 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-13 19:14:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-10-13 19:14:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-10-13 19:14:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-10-13 19:14:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-10-13 19:14:41,391 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-10-13 19:14:41,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,392 INFO L462 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-10-13 19:14:41,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-10-13 19:14:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:41,396 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,396 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-13 19:14:41,396 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-10-13 19:14:41,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288299282] [2019-10-13 19:14:41,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,423 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-13 19:14:41,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288299282] [2019-10-13 19:14:41,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43265183] [2019-10-13 19:14:41,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,425 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-10-13 19:14:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,476 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-10-13 19:14:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:41,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,489 INFO L225 Difference]: With dead ends: 4236 [2019-10-13 19:14:41,489 INFO L226 Difference]: Without dead ends: 2474 [2019-10-13 19:14:41,494 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-13 19:14:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-10-13 19:14:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-10-13 19:14:41,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-10-13 19:14:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-10-13 19:14:41,566 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-10-13 19:14:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,567 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-10-13 19:14:41,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-10-13 19:14:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:41,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,571 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-13 19:14:41,572 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-10-13 19:14:41,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,574 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614847208] [2019-10-13 19:14:41,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,594 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-13 19:14:41,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614847208] [2019-10-13 19:14:41,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929734086] [2019-10-13 19:14:41,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,596 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-10-13 19:14:41,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,667 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-10-13 19:14:41,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,681 INFO L225 Difference]: With dead ends: 3708 [2019-10-13 19:14:41,681 INFO L226 Difference]: Without dead ends: 2506 [2019-10-13 19:14:41,684 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-13 19:14:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-13 19:14:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-10-13 19:14:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-13 19:14:41,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-10-13 19:14:41,763 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-10-13 19:14:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,764 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-10-13 19:14:41,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-10-13 19:14:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:41,768 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,768 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-13 19:14:41,768 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-10-13 19:14:41,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744951694] [2019-10-13 19:14:41,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,770 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:41,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744951694] [2019-10-13 19:14:41,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012130428] [2019-10-13 19:14:41,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,799 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-10-13 19:14:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:41,850 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-10-13 19:14:41,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:41,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:41,871 INFO L225 Difference]: With dead ends: 4492 [2019-10-13 19:14:41,871 INFO L226 Difference]: Without dead ends: 4490 [2019-10-13 19:14:41,873 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-13 19:14:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-10-13 19:14:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-10-13 19:14:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-10-13 19:14:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-10-13 19:14:41,964 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-10-13 19:14:41,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:41,965 INFO L462 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-10-13 19:14:41,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:41,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-10-13 19:14:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:41,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:41,970 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-13 19:14:41,971 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-10-13 19:14:41,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:41,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92933163] [2019-10-13 19:14:41,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:41,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:41,994 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-13 19:14:41,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92933163] [2019-10-13 19:14:41,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:41,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:41,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213506476] [2019-10-13 19:14:41,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:41,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:41,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:41,997 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-10-13 19:14:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,070 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-10-13 19:14:42,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,128 INFO L225 Difference]: With dead ends: 8396 [2019-10-13 19:14:42,129 INFO L226 Difference]: Without dead ends: 4874 [2019-10-13 19:14:42,134 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-13 19:14:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-13 19:14:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-10-13 19:14:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-10-13 19:14:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-10-13 19:14:42,248 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-10-13 19:14:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:42,248 INFO L462 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-10-13 19:14:42,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-10-13 19:14:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:42,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:42,254 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-13 19:14:42,255 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:42,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-10-13 19:14:42,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:42,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20181692] [2019-10-13 19:14:42,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,275 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-13 19:14:42,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20181692] [2019-10-13 19:14:42,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:42,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:42,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64705498] [2019-10-13 19:14:42,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:42,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,277 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-10-13 19:14:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,344 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-10-13 19:14:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,355 INFO L225 Difference]: With dead ends: 7308 [2019-10-13 19:14:42,355 INFO L226 Difference]: Without dead ends: 4938 [2019-10-13 19:14:42,361 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-13 19:14:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-10-13 19:14:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-10-13 19:14:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-10-13 19:14:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-10-13 19:14:42,500 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-10-13 19:14:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:42,501 INFO L462 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-10-13 19:14:42,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-10-13 19:14:42,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:42,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:42,510 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-13 19:14:42,511 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-10-13 19:14:42,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:42,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488188717] [2019-10-13 19:14:42,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:42,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:42,540 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-13 19:14:42,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488188717] [2019-10-13 19:14:42,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:42,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:42,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161041806] [2019-10-13 19:14:42,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:42,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:42,542 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-10-13 19:14:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:42,767 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-10-13 19:14:42,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:42,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:42,788 INFO L225 Difference]: With dead ends: 14412 [2019-10-13 19:14:42,788 INFO L226 Difference]: Without dead ends: 9610 [2019-10-13 19:14:42,802 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-13 19:14:42,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-10-13 19:14:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-10-13 19:14:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-13 19:14:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-10-13 19:14:43,038 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-10-13 19:14:43,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:43,038 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-10-13 19:14:43,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:43,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-10-13 19:14:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:43,049 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:43,049 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-13 19:14:43,049 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:43,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:43,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-10-13 19:14:43,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:43,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541283322] [2019-10-13 19:14:43,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,051 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,075 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-13 19:14:43,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541283322] [2019-10-13 19:14:43,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:43,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:43,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139906559] [2019-10-13 19:14:43,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:43,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:43,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:43,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:43,077 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-10-13 19:14:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:43,260 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-10-13 19:14:43,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:43,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:43,280 INFO L225 Difference]: With dead ends: 11148 [2019-10-13 19:14:43,280 INFO L226 Difference]: Without dead ends: 11146 [2019-10-13 19:14:43,283 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-13 19:14:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-13 19:14:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-10-13 19:14:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-10-13 19:14:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-10-13 19:14:43,504 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-10-13 19:14:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:43,504 INFO L462 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-10-13 19:14:43,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-10-13 19:14:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:43,516 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:43,516 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-13 19:14:43,516 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-10-13 19:14:43,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:43,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135449641] [2019-10-13 19:14:43,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:43,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:43,536 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-13 19:14:43,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135449641] [2019-10-13 19:14:43,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:43,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:43,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719266712] [2019-10-13 19:14:43,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:43,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:43,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:43,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:43,538 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-10-13 19:14:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:43,720 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-10-13 19:14:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:43,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:43,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:43,754 INFO L225 Difference]: With dead ends: 16780 [2019-10-13 19:14:43,754 INFO L226 Difference]: Without dead ends: 16778 [2019-10-13 19:14:43,762 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-13 19:14:43,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-10-13 19:14:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-10-13 19:14:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-10-13 19:14:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-10-13 19:14:44,086 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-10-13 19:14:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:44,087 INFO L462 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-10-13 19:14:44,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:44,087 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-10-13 19:14:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:44,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:44,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, 1, 1, 1, 1] [2019-10-13 19:14:44,110 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-10-13 19:14:44,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:44,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675936917] [2019-10-13 19:14:44,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,111 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,138 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-13 19:14:44,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675936917] [2019-10-13 19:14:44,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:44,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:44,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732246191] [2019-10-13 19:14:44,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:44,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:44,140 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-10-13 19:14:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:44,496 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-10-13 19:14:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:44,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:44,532 INFO L225 Difference]: With dead ends: 32908 [2019-10-13 19:14:44,532 INFO L226 Difference]: Without dead ends: 18826 [2019-10-13 19:14:44,557 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-13 19:14:44,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-10-13 19:14:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-10-13 19:14:44,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-10-13 19:14:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-10-13 19:14:44,901 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-10-13 19:14:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:44,901 INFO L462 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-10-13 19:14:44,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:44,901 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-10-13 19:14:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:44,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:44,923 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-13 19:14:44,924 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-10-13 19:14:44,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:44,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616483503] [2019-10-13 19:14:44,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:44,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:44,945 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616483503] [2019-10-13 19:14:44,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:44,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:44,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026431776] [2019-10-13 19:14:44,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:44,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:44,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:44,946 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-10-13 19:14:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:45,579 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-10-13 19:14:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:45,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:45,610 INFO L225 Difference]: With dead ends: 28428 [2019-10-13 19:14:45,611 INFO L226 Difference]: Without dead ends: 19210 [2019-10-13 19:14:45,628 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-13 19:14:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-10-13 19:14:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-10-13 19:14:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-10-13 19:14:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-10-13 19:14:45,942 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-10-13 19:14:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:45,942 INFO L462 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-10-13 19:14:45,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-10-13 19:14:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:45,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:45,965 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-13 19:14:45,966 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:45,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:45,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-10-13 19:14:45,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:45,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570196743] [2019-10-13 19:14:45,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:45,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:45,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:45,985 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-13 19:14:45,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570196743] [2019-10-13 19:14:45,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:45,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:45,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236624710] [2019-10-13 19:14:45,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:45,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:45,987 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-10-13 19:14:46,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:46,337 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-10-13 19:14:46,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:46,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:46,400 INFO L225 Difference]: With dead ends: 32780 [2019-10-13 19:14:46,400 INFO L226 Difference]: Without dead ends: 32778 [2019-10-13 19:14:46,410 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-13 19:14:46,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-10-13 19:14:47,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-10-13 19:14:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-10-13 19:14:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-10-13 19:14:47,170 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-10-13 19:14:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:47,171 INFO L462 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-10-13 19:14:47,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:47,171 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-10-13 19:14:47,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:47,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:47,214 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-13 19:14:47,214 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-10-13 19:14:47,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:47,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988532660] [2019-10-13 19:14:47,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:47,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:47,235 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-13 19:14:47,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988532660] [2019-10-13 19:14:47,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:47,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:47,236 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572084377] [2019-10-13 19:14:47,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:47,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:47,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:47,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:47,237 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-10-13 19:14:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:47,567 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-10-13 19:14:47,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:47,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:47,643 INFO L225 Difference]: With dead ends: 65548 [2019-10-13 19:14:47,643 INFO L226 Difference]: Without dead ends: 37386 [2019-10-13 19:14:47,697 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-13 19:14:47,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-10-13 19:14:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-10-13 19:14:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-10-13 19:14:48,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-10-13 19:14:48,501 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-10-13 19:14:48,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:48,501 INFO L462 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-10-13 19:14:48,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-10-13 19:14:48,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:48,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:48,522 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-13 19:14:48,522 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:48,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:48,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-10-13 19:14:48,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:48,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187751050] [2019-10-13 19:14:48,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:48,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:48,544 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-13 19:14:48,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187751050] [2019-10-13 19:14:48,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:48,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:48,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489982522] [2019-10-13 19:14:48,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:48,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:48,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:48,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:48,546 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-10-13 19:14:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:48,855 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-10-13 19:14:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:48,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:48,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:48,906 INFO L225 Difference]: With dead ends: 56076 [2019-10-13 19:14:48,906 INFO L226 Difference]: Without dead ends: 37898 [2019-10-13 19:14:48,932 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-13 19:14:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-10-13 19:14:50,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-10-13 19:14:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-10-13 19:14:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-10-13 19:14:50,464 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-10-13 19:14:50,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:50,465 INFO L462 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-10-13 19:14:50,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-10-13 19:14:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:50,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:50,494 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-13 19:14:50,495 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-10-13 19:14:50,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:50,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503943691] [2019-10-13 19:14:50,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,496 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:50,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:50,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503943691] [2019-10-13 19:14:50,528 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:50,528 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:50,528 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969559586] [2019-10-13 19:14:50,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:50,529 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:50,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:50,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:50,530 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-10-13 19:14:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:51,597 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-10-13 19:14:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:51,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:51,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:51,681 INFO L225 Difference]: With dead ends: 63500 [2019-10-13 19:14:51,681 INFO L226 Difference]: Without dead ends: 63498 [2019-10-13 19:14:51,697 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-13 19:14:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-10-13 19:14:52,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-10-13 19:14:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-10-13 19:14:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-10-13 19:14:52,450 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-10-13 19:14:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,451 INFO L462 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-10-13 19:14:52,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-10-13 19:14:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:52,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,483 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-13 19:14:52,483 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-10-13 19:14:52,484 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364261472] [2019-10-13 19:14:52,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,484 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,502 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-13 19:14:52,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364261472] [2019-10-13 19:14:52,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410143362] [2019-10-13 19:14:52,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,504 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,504 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-10-13 19:14:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,354 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-10-13 19:14:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,436 INFO L225 Difference]: With dead ends: 130060 [2019-10-13 19:14:53,436 INFO L226 Difference]: Without dead ends: 73738 [2019-10-13 19:14:53,481 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-13 19:14:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-10-13 19:14:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-10-13 19:14:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-10-13 19:14:55,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-10-13 19:14:55,538 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-10-13 19:14:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,539 INFO L462 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-10-13 19:14:55,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-10-13 19:14:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:55,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,566 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-13 19:14:55,566 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-10-13 19:14:55,567 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076819453] [2019-10-13 19:14:55,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,567 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,586 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-13 19:14:55,586 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076819453] [2019-10-13 19:14:55,586 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,587 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279953402] [2019-10-13 19:14:55,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,587 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,588 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-10-13 19:14:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,408 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-10-13 19:14:56,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:14:56,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,483 INFO L225 Difference]: With dead ends: 110604 [2019-10-13 19:14:56,483 INFO L226 Difference]: Without dead ends: 74762 [2019-10-13 19:14:56,501 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-13 19:14:56,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-10-13 19:14:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-10-13 19:14:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-10-13 19:14:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-10-13 19:14:57,257 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-10-13 19:14:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,258 INFO L462 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-10-13 19:14:57,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-10-13 19:14:57,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:57,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,285 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-13 19:14:57,285 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,286 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-10-13 19:14:57,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822565435] [2019-10-13 19:14:57,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:57,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822565435] [2019-10-13 19:14:57,304 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912655174] [2019-10-13 19:14:57,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,305 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,306 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-10-13 19:14:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:59,024 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-10-13 19:14:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:59,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:14:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:59,136 INFO L225 Difference]: With dead ends: 122892 [2019-10-13 19:14:59,137 INFO L226 Difference]: Without dead ends: 122890 [2019-10-13 19:14:59,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-13 19:14:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-10-13 19:15:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-10-13 19:15:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-10-13 19:15:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-10-13 19:15:00,438 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-10-13 19:15:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:00,439 INFO L462 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-10-13 19:15:00,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-10-13 19:15:00,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:15:00,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:00,490 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-13 19:15:00,490 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:00,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-10-13 19:15:00,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:00,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207670267] [2019-10-13 19:15:00,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:00,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:00,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:15:00,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207670267] [2019-10-13 19:15:00,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:00,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:00,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551866814] [2019-10-13 19:15:00,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:00,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:00,520 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-10-13 19:15:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:02,221 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-10-13 19:15:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:02,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:15:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:02,348 INFO L225 Difference]: With dead ends: 258060 [2019-10-13 19:15:02,348 INFO L226 Difference]: Without dead ends: 145418 [2019-10-13 19:15:02,416 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-13 19:15:02,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-10-13 19:15:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-10-13 19:15:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-10-13 19:15:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-10-13 19:15:06,646 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-10-13 19:15:06,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:06,646 INFO L462 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-10-13 19:15:06,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-10-13 19:15:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:06,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:06,703 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-13 19:15:06,703 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-10-13 19:15:06,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:06,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994471079] [2019-10-13 19:15:06,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:06,704 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:06,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:06,724 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-13 19:15:06,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994471079] [2019-10-13 19:15:06,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:06,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:06,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787557188] [2019-10-13 19:15:06,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:06,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:06,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:06,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:06,726 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-10-13 19:15:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:08,151 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2019-10-13 19:15:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:08,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:08,329 INFO L225 Difference]: With dead ends: 218124 [2019-10-13 19:15:08,330 INFO L226 Difference]: Without dead ends: 147466 [2019-10-13 19:15:08,404 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-13 19:15:08,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states.