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_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:14:49,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:14:49,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:14:49,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:14:49,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:14:49,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:14:49,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:14:49,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:14:49,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:14:49,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:14:49,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:14:49,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:14:49,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:14:49,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:14:49,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:14:49,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:14:49,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:14:49,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:14:49,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:14:49,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:14:49,374 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:14:49,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:14:49,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:14:49,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:14:49,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:14:49,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:14:49,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:14:49,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:14:49,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:14:49,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:14:49,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:14:49,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:14:49,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:14:49,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:14:49,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:14:49,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:14:49,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:14:49,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:14:49,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:14:49,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:14:49,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:14:49,390 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:49,410 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:14:49,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:14:49,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:14:49,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:14:49,413 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:14:49,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:14:49,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:14:49,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:14:49,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:14:49,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:14:49,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:14:49,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:14:49,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:14:49,416 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:14:49,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:14:49,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:14:49,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:14:49,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:14:49,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:14:49,417 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:14:49,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:14:49,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:14:49,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:14:49,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:14:49,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:14:49,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:14:49,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:14:49,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:14:49,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:14:49,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:14:49,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:14:49,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:14:49,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:14:49,750 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:14:49,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-13 19:14:49,826 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80dbb7fb2/f2e13e5d5b9845639c2103c2699293bb/FLAG007a67cd6 [2019-10-13 19:14:50,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:14:50,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-10-13 19:14:50,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80dbb7fb2/f2e13e5d5b9845639c2103c2699293bb/FLAG007a67cd6 [2019-10-13 19:14:50,655 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80dbb7fb2/f2e13e5d5b9845639c2103c2699293bb [2019-10-13 19:14:50,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:14:50,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:14:50,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:50,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:14:50,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:14:50,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:50" (1/1) ... [2019-10-13 19:14:50,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:50, skipping insertion in model container [2019-10-13 19:14:50,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:14:50" (1/1) ... [2019-10-13 19:14:50,691 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:14:50,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:14:51,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:51,017 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:14:51,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:14:51,196 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:14:51,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51 WrapperNode [2019-10-13 19:14:51,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:14:51,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:14:51,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:14:51,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:14:51,211 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:51" (1/1) ... [2019-10-13 19:14:51,212 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:51" (1/1) ... [2019-10-13 19:14:51,218 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:51" (1/1) ... [2019-10-13 19:14:51,218 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:51" (1/1) ... [2019-10-13 19:14:51,226 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:51" (1/1) ... [2019-10-13 19:14:51,242 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:51" (1/1) ... [2019-10-13 19:14:51,246 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:51" (1/1) ... [2019-10-13 19:14:51,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:14:51,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:14:51,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:14:51,258 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:14:51,259 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (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:51,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:14:51,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:14:51,315 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:14:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:14:51,734 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:14:51,735 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:14:51,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:51 BoogieIcfgContainer [2019-10-13 19:14:51,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:14:51,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:14:51,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:14:51,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:14:51,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:14:50" (1/3) ... [2019-10-13 19:14:51,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356308a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:51, skipping insertion in model container [2019-10-13 19:14:51,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:14:51" (2/3) ... [2019-10-13 19:14:51,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356308a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:14:51, skipping insertion in model container [2019-10-13 19:14:51,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:14:51" (3/3) ... [2019-10-13 19:14:51,745 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-10-13 19:14:51,755 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:14:51,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:14:51,788 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:14:51,811 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:14:51,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:14:51,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:14:51,812 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:14:51,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:14:51,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:14:51,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:14:51,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:14:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2019-10-13 19:14:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:51,836 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:51,837 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:51,838 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2019-10-13 19:14:51,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:51,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415360037] [2019-10-13 19:14:51,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:51,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:51,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,097 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,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415360037] [2019-10-13 19:14:52,100 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721086357] [2019-10-13 19:14:52,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,118 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2019-10-13 19:14:52,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,191 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2019-10-13 19:14:52,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,206 INFO L225 Difference]: With dead ends: 117 [2019-10-13 19:14:52,206 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 19:14:52,210 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:52,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 19:14:52,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2019-10-13 19:14:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-13 19:14:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2019-10-13 19:14:52,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2019-10-13 19:14:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,260 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2019-10-13 19:14:52,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2019-10-13 19:14:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-13 19:14:52,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,262 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:52,262 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2019-10-13 19:14:52,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50291579] [2019-10-13 19:14:52,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:52,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50291579] [2019-10-13 19:14:52,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244391273] [2019-10-13 19:14:52,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,366 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2019-10-13 19:14:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,403 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2019-10-13 19:14:52,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-13 19:14:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,406 INFO L225 Difference]: With dead ends: 167 [2019-10-13 19:14:52,406 INFO L226 Difference]: Without dead ends: 102 [2019-10-13 19:14:52,408 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:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-10-13 19:14:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-10-13 19:14:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-13 19:14:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2019-10-13 19:14:52,425 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2019-10-13 19:14:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,426 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2019-10-13 19:14:52,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2019-10-13 19:14:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:52,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,428 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:52,428 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,429 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2019-10-13 19:14:52,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509163209] [2019-10-13 19:14:52,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,481 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,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509163209] [2019-10-13 19:14:52,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301756820] [2019-10-13 19:14:52,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,484 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2019-10-13 19:14:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,514 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2019-10-13 19:14:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:52,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,516 INFO L225 Difference]: With dead ends: 153 [2019-10-13 19:14:52,516 INFO L226 Difference]: Without dead ends: 105 [2019-10-13 19:14:52,517 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:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-13 19:14:52,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-13 19:14:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-13 19:14:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2019-10-13 19:14:52,528 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2019-10-13 19:14:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,529 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2019-10-13 19:14:52,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2019-10-13 19:14:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:52,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,530 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:52,530 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2019-10-13 19:14:52,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114117844] [2019-10-13 19:14:52,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,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:52,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114117844] [2019-10-13 19:14:52,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29294673] [2019-10-13 19:14:52,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,598 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2019-10-13 19:14:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,637 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2019-10-13 19:14:52,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,643 INFO L225 Difference]: With dead ends: 196 [2019-10-13 19:14:52,644 INFO L226 Difference]: Without dead ends: 194 [2019-10-13 19:14:52,644 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:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-10-13 19:14:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2019-10-13 19:14:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-10-13 19:14:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2019-10-13 19:14:52,675 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2019-10-13 19:14:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,675 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2019-10-13 19:14:52,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2019-10-13 19:14:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 19:14:52,677 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,677 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:52,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2019-10-13 19:14:52,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860577439] [2019-10-13 19:14:52,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,776 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,778 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860577439] [2019-10-13 19:14:52,778 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,778 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,779 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300851837] [2019-10-13 19:14:52,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,780 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,781 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2019-10-13 19:14:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,815 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2019-10-13 19:14:52,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-13 19:14:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,817 INFO L225 Difference]: With dead ends: 324 [2019-10-13 19:14:52,817 INFO L226 Difference]: Without dead ends: 196 [2019-10-13 19:14:52,820 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:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-13 19:14:52,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-10-13 19:14:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-13 19:14:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2019-10-13 19:14:52,853 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2019-10-13 19:14:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,853 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2019-10-13 19:14:52,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,854 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2019-10-13 19:14:52,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:52,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,857 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:52,857 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2019-10-13 19:14:52,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359955389] [2019-10-13 19:14:52,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:52,939 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,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359955389] [2019-10-13 19:14:52,940 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:52,940 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:52,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445782121] [2019-10-13 19:14:52,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:52,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:52,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:52,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:52,948 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2019-10-13 19:14:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:52,969 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2019-10-13 19:14:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:52,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:52,972 INFO L225 Difference]: With dead ends: 291 [2019-10-13 19:14:52,972 INFO L226 Difference]: Without dead ends: 198 [2019-10-13 19:14:52,973 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:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-13 19:14:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2019-10-13 19:14:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-10-13 19:14:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2019-10-13 19:14:52,989 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2019-10-13 19:14:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:52,991 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2019-10-13 19:14:52,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2019-10-13 19:14:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:52,993 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:52,993 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:52,993 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:52,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2019-10-13 19:14:52,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:52,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296203417] [2019-10-13 19:14:52,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:52,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,056 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:53,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296203417] [2019-10-13 19:14:53,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,057 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370660004] [2019-10-13 19:14:53,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,058 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2019-10-13 19:14:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,094 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2019-10-13 19:14:53,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:53,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,098 INFO L225 Difference]: With dead ends: 372 [2019-10-13 19:14:53,098 INFO L226 Difference]: Without dead ends: 370 [2019-10-13 19:14:53,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:53,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-10-13 19:14:53,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2019-10-13 19:14:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-10-13 19:14:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2019-10-13 19:14:53,115 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2019-10-13 19:14:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,116 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2019-10-13 19:14:53,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2019-10-13 19:14:53,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 19:14:53,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,124 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:53,124 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,125 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2019-10-13 19:14:53,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637595465] [2019-10-13 19:14:53,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,125 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,183 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:53,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637595465] [2019-10-13 19:14:53,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837438393] [2019-10-13 19:14:53,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,186 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2019-10-13 19:14:53,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,218 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2019-10-13 19:14:53,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-13 19:14:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,221 INFO L225 Difference]: With dead ends: 632 [2019-10-13 19:14:53,221 INFO L226 Difference]: Without dead ends: 378 [2019-10-13 19:14:53,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-13 19:14:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2019-10-13 19:14:53,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-10-13 19:14:53,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2019-10-13 19:14:53,237 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2019-10-13 19:14:53,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,237 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2019-10-13 19:14:53,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2019-10-13 19:14:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:53,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,239 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:53,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2019-10-13 19:14:53,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620258524] [2019-10-13 19:14:53,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,270 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:53,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620258524] [2019-10-13 19:14:53,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676737995] [2019-10-13 19:14:53,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,274 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2019-10-13 19:14:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,299 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2019-10-13 19:14:53,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,305 INFO L225 Difference]: With dead ends: 564 [2019-10-13 19:14:53,305 INFO L226 Difference]: Without dead ends: 382 [2019-10-13 19:14:53,306 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,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-13 19:14:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2019-10-13 19:14:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-10-13 19:14:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2019-10-13 19:14:53,322 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2019-10-13 19:14:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,323 INFO L462 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2019-10-13 19:14:53,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2019-10-13 19:14:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:53,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,326 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:53,326 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2019-10-13 19:14:53,327 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,327 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204422745] [2019-10-13 19:14:53,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,327 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,356 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:53,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204422745] [2019-10-13 19:14:53,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893878310] [2019-10-13 19:14:53,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,359 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2019-10-13 19:14:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,385 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2019-10-13 19:14:53,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,390 INFO L225 Difference]: With dead ends: 716 [2019-10-13 19:14:53,390 INFO L226 Difference]: Without dead ends: 714 [2019-10-13 19:14:53,391 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,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-10-13 19:14:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2019-10-13 19:14:53,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2019-10-13 19:14:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2019-10-13 19:14:53,410 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2019-10-13 19:14:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,410 INFO L462 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2019-10-13 19:14:53,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2019-10-13 19:14:53,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-13 19:14:53,412 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,412 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:53,412 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2019-10-13 19:14:53,413 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,413 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372913620] [2019-10-13 19:14:53,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,414 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,440 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:53,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372913620] [2019-10-13 19:14:53,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,442 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903005] [2019-10-13 19:14:53,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,443 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,443 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2019-10-13 19:14:53,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,479 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2019-10-13 19:14:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-13 19:14:53,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,484 INFO L225 Difference]: With dead ends: 1244 [2019-10-13 19:14:53,484 INFO L226 Difference]: Without dead ends: 738 [2019-10-13 19:14:53,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:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-10-13 19:14:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2019-10-13 19:14:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-10-13 19:14:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2019-10-13 19:14:53,516 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2019-10-13 19:14:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,516 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2019-10-13 19:14:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2019-10-13 19:14:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:53,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,518 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:53,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2019-10-13 19:14:53,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633262108] [2019-10-13 19:14:53,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:14:53,553 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633262108] [2019-10-13 19:14:53,553 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,553 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753544205] [2019-10-13 19:14:53,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,554 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2019-10-13 19:14:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,584 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2019-10-13 19:14:53,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,588 INFO L225 Difference]: With dead ends: 1104 [2019-10-13 19:14:53,589 INFO L226 Difference]: Without dead ends: 746 [2019-10-13 19:14:53,590 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,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-13 19:14:53,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2019-10-13 19:14:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-10-13 19:14:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2019-10-13 19:14:53,612 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2019-10-13 19:14:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,614 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2019-10-13 19:14:53,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2019-10-13 19:14:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:53,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,615 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:53,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2019-10-13 19:14:53,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431998275] [2019-10-13 19:14:53,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,646 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:53,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431998275] [2019-10-13 19:14:53,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015123657] [2019-10-13 19:14:53,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,651 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,652 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2019-10-13 19:14:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,690 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2019-10-13 19:14:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,700 INFO L225 Difference]: With dead ends: 1388 [2019-10-13 19:14:53,700 INFO L226 Difference]: Without dead ends: 1386 [2019-10-13 19:14:53,701 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,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-10-13 19:14:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2019-10-13 19:14:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2019-10-13 19:14:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2019-10-13 19:14:53,742 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2019-10-13 19:14:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,743 INFO L462 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2019-10-13 19:14:53,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2019-10-13 19:14:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:14:53,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,747 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:53,747 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2019-10-13 19:14:53,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965374758] [2019-10-13 19:14:53,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,784 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:53,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965374758] [2019-10-13 19:14:53,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719612100] [2019-10-13 19:14:53,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,787 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2019-10-13 19:14:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:53,848 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2019-10-13 19:14:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:53,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-13 19:14:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:53,860 INFO L225 Difference]: With dead ends: 2460 [2019-10-13 19:14:53,860 INFO L226 Difference]: Without dead ends: 1450 [2019-10-13 19:14:53,864 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,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-13 19:14:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2019-10-13 19:14:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-10-13 19:14:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2019-10-13 19:14:53,916 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2019-10-13 19:14:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2019-10-13 19:14:53,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2019-10-13 19:14:53,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:53,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:53,920 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:53,921 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:53,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2019-10-13 19:14:53,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:53,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582455648] [2019-10-13 19:14:53,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:53,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:53,971 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:53,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582455648] [2019-10-13 19:14:53,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:53,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:53,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500730018] [2019-10-13 19:14:53,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:53,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:53,975 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2019-10-13 19:14:54,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,024 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2019-10-13 19:14:54,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,034 INFO L225 Difference]: With dead ends: 2172 [2019-10-13 19:14:54,034 INFO L226 Difference]: Without dead ends: 1466 [2019-10-13 19:14:54,038 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:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-10-13 19:14:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2019-10-13 19:14:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2019-10-13 19:14:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2019-10-13 19:14:54,090 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2019-10-13 19:14:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2019-10-13 19:14:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2019-10-13 19:14:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:54,093 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,093 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:14:54,094 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2019-10-13 19:14:54,095 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818648228] [2019-10-13 19:14:54,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,124 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:54,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818648228] [2019-10-13 19:14:54,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965373215] [2019-10-13 19:14:54,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,130 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2019-10-13 19:14:54,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,196 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2019-10-13 19:14:54,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,197 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:54,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,215 INFO L225 Difference]: With dead ends: 2700 [2019-10-13 19:14:54,216 INFO L226 Difference]: Without dead ends: 2698 [2019-10-13 19:14:54,217 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:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-13 19:14:54,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2019-10-13 19:14:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-13 19:14:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2019-10-13 19:14:54,303 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2019-10-13 19:14:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,303 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2019-10-13 19:14:54,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2019-10-13 19:14:54,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 19:14:54,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,308 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:54,308 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2019-10-13 19:14:54,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331766807] [2019-10-13 19:14:54,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,342 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:54,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331766807] [2019-10-13 19:14:54,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122615894] [2019-10-13 19:14:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,345 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2019-10-13 19:14:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,410 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2019-10-13 19:14:54,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-13 19:14:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,428 INFO L225 Difference]: With dead ends: 4876 [2019-10-13 19:14:54,429 INFO L226 Difference]: Without dead ends: 2858 [2019-10-13 19:14:54,434 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:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-13 19:14:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2019-10-13 19:14:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2019-10-13 19:14:54,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2019-10-13 19:14:54,526 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2019-10-13 19:14:54,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,526 INFO L462 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2019-10-13 19:14:54,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2019-10-13 19:14:54,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:54,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,532 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:54,532 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2019-10-13 19:14:54,533 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941289834] [2019-10-13 19:14:54,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,534 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,565 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:54,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941289834] [2019-10-13 19:14:54,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526155604] [2019-10-13 19:14:54,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,567 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2019-10-13 19:14:54,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,629 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2019-10-13 19:14:54,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:54,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,644 INFO L225 Difference]: With dead ends: 4284 [2019-10-13 19:14:54,645 INFO L226 Difference]: Without dead ends: 2890 [2019-10-13 19:14:54,648 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:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-10-13 19:14:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2019-10-13 19:14:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2019-10-13 19:14:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2019-10-13 19:14:54,731 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2019-10-13 19:14:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,732 INFO L462 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2019-10-13 19:14:54,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2019-10-13 19:14:54,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:54,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,736 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:54,736 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2019-10-13 19:14:54,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643562588] [2019-10-13 19:14:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:54,762 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:54,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643562588] [2019-10-13 19:14:54,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:54,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:54,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724809363] [2019-10-13 19:14:54,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:54,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:54,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:54,769 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2019-10-13 19:14:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:54,835 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2019-10-13 19:14:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:54,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:54,862 INFO L225 Difference]: With dead ends: 5260 [2019-10-13 19:14:54,863 INFO L226 Difference]: Without dead ends: 5258 [2019-10-13 19:14:54,865 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:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-13 19:14:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2019-10-13 19:14:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2019-10-13 19:14:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2019-10-13 19:14:54,975 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2019-10-13 19:14:54,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:54,976 INFO L462 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2019-10-13 19:14:54,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2019-10-13 19:14:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:14:54,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:54,983 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:54,983 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2019-10-13 19:14:54,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:54,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061554160] [2019-10-13 19:14:54,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,984 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:54,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,008 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,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061554160] [2019-10-13 19:14:55,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849120051] [2019-10-13 19:14:55,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,010 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2019-10-13 19:14:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,101 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2019-10-13 19:14:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 19:14:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,137 INFO L225 Difference]: With dead ends: 9676 [2019-10-13 19:14:55,138 INFO L226 Difference]: Without dead ends: 5642 [2019-10-13 19:14:55,182 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:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-10-13 19:14:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2019-10-13 19:14:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2019-10-13 19:14:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2019-10-13 19:14:55,325 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2019-10-13 19:14:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,325 INFO L462 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2019-10-13 19:14:55,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2019-10-13 19:14:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:55,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,332 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:55,332 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2019-10-13 19:14:55,333 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,333 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922035271] [2019-10-13 19:14:55,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,360 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,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922035271] [2019-10-13 19:14:55,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484789916] [2019-10-13 19:14:55,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,364 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2019-10-13 19:14:55,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,436 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2019-10-13 19:14:55,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:55,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,450 INFO L225 Difference]: With dead ends: 8460 [2019-10-13 19:14:55,450 INFO L226 Difference]: Without dead ends: 5706 [2019-10-13 19:14:55,461 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:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-10-13 19:14:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2019-10-13 19:14:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-10-13 19:14:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2019-10-13 19:14:55,593 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2019-10-13 19:14:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:55,593 INFO L462 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2019-10-13 19:14:55,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2019-10-13 19:14:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:55,601 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:55,601 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:55,601 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2019-10-13 19:14:55,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:55,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770047523] [2019-10-13 19:14:55,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:55,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:55,634 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,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770047523] [2019-10-13 19:14:55,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:55,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:55,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83117589] [2019-10-13 19:14:55,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:55,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:55,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:55,638 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2019-10-13 19:14:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:55,839 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2019-10-13 19:14:55,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:55,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:55,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:55,862 INFO L225 Difference]: With dead ends: 16716 [2019-10-13 19:14:55,862 INFO L226 Difference]: Without dead ends: 11146 [2019-10-13 19:14:55,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:55,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-10-13 19:14:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2019-10-13 19:14:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-13 19:14:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2019-10-13 19:14:56,115 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2019-10-13 19:14:56,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,115 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2019-10-13 19:14:56,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2019-10-13 19:14:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-13 19:14:56,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,132 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:56,132 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2019-10-13 19:14:56,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387631833] [2019-10-13 19:14:56,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,158 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:56,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387631833] [2019-10-13 19:14:56,159 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,159 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481576491] [2019-10-13 19:14:56,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,163 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2019-10-13 19:14:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,297 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2019-10-13 19:14:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-13 19:14:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,324 INFO L225 Difference]: With dead ends: 13196 [2019-10-13 19:14:56,324 INFO L226 Difference]: Without dead ends: 13194 [2019-10-13 19:14:56,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:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2019-10-13 19:14:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2019-10-13 19:14:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2019-10-13 19:14:56,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2019-10-13 19:14:56,645 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2019-10-13 19:14:56,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:56,645 INFO L462 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2019-10-13 19:14:56,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2019-10-13 19:14:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:56,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:56,658 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:56,658 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2019-10-13 19:14:56,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:56,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776115775] [2019-10-13 19:14:56,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:56,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:56,681 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:56,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776115775] [2019-10-13 19:14:56,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:56,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:56,682 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160257307] [2019-10-13 19:14:56,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:56,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:56,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:56,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:56,683 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2019-10-13 19:14:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:56,845 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2019-10-13 19:14:56,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:56,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:56,884 INFO L225 Difference]: With dead ends: 19852 [2019-10-13 19:14:56,884 INFO L226 Difference]: Without dead ends: 19850 [2019-10-13 19:14:56,892 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,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2019-10-13 19:14:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2019-10-13 19:14:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2019-10-13 19:14:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2019-10-13 19:14:57,304 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2019-10-13 19:14:57,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:57,305 INFO L462 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2019-10-13 19:14:57,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:57,305 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2019-10-13 19:14:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 19:14:57,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:57,325 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:57,325 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:57,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2019-10-13 19:14:57,326 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:57,326 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305739289] [2019-10-13 19:14:57,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,326 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:57,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:57,346 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,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305739289] [2019-10-13 19:14:57,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:57,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:57,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733447139] [2019-10-13 19:14:57,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:57,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:57,347 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2019-10-13 19:14:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:57,555 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2019-10-13 19:14:57,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:57,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-13 19:14:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:57,597 INFO L225 Difference]: With dead ends: 38028 [2019-10-13 19:14:57,597 INFO L226 Difference]: Without dead ends: 21898 [2019-10-13 19:14:57,629 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:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2019-10-13 19:14:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2019-10-13 19:14:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2019-10-13 19:14:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2019-10-13 19:14:58,586 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2019-10-13 19:14:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:58,586 INFO L462 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2019-10-13 19:14:58,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2019-10-13 19:14:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:58,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:58,610 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:58,610 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2019-10-13 19:14:58,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:58,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336474662] [2019-10-13 19:14:58,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:58,662 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:58,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336474662] [2019-10-13 19:14:58,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:58,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:58,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367730539] [2019-10-13 19:14:58,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:58,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:58,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:58,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:58,665 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2019-10-13 19:14:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:14:58,873 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2019-10-13 19:14:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:14:58,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:14:58,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:14:58,919 INFO L225 Difference]: With dead ends: 33036 [2019-10-13 19:14:58,920 INFO L226 Difference]: Without dead ends: 22282 [2019-10-13 19:14:59,060 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2019-10-13 19:14:59,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2019-10-13 19:14:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2019-10-13 19:14:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2019-10-13 19:14:59,475 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2019-10-13 19:14:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:14:59,475 INFO L462 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2019-10-13 19:14:59,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:14:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2019-10-13 19:14:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:14:59,502 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:14:59,502 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:59,502 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:14:59,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:14:59,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2019-10-13 19:14:59,504 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:14:59,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425511691] [2019-10-13 19:14:59,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:14:59,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:14:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:14:59,541 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:59,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425511691] [2019-10-13 19:14:59,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:14:59,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:14:59,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061183210] [2019-10-13 19:14:59,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:14:59,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:14:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:14:59,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:14:59,544 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2019-10-13 19:15:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:00,009 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2019-10-13 19:15:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:00,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:15:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:00,084 INFO L225 Difference]: With dead ends: 38924 [2019-10-13 19:15:00,085 INFO L226 Difference]: Without dead ends: 38922 [2019-10-13 19:15:00,091 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:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2019-10-13 19:15:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2019-10-13 19:15:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2019-10-13 19:15:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2019-10-13 19:15:00,696 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2019-10-13 19:15:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:00,696 INFO L462 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2019-10-13 19:15:00,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2019-10-13 19:15:00,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-13 19:15:00,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:00,732 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:15:00,732 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:00,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:00,733 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2019-10-13 19:15:00,733 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:00,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410202908] [2019-10-13 19:15:00,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:00,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:00,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:00,942 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,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410202908] [2019-10-13 19:15:00,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:00,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:00,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265803798] [2019-10-13 19:15:00,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:00,944 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:00,944 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2019-10-13 19:15:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:01,312 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2019-10-13 19:15:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:01,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-13 19:15:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:01,366 INFO L225 Difference]: With dead ends: 75788 [2019-10-13 19:15:01,366 INFO L226 Difference]: Without dead ends: 43530 [2019-10-13 19:15:01,417 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:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2019-10-13 19:15:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2019-10-13 19:15:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2019-10-13 19:15:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2019-10-13 19:15:02,304 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2019-10-13 19:15:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:02,304 INFO L462 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2019-10-13 19:15:02,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2019-10-13 19:15:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:02,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:02,355 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:02,355 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2019-10-13 19:15:02,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:02,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557519640] [2019-10-13 19:15:02,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:02,356 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:02,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:02,393 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:02,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557519640] [2019-10-13 19:15:02,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:02,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:02,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060347055] [2019-10-13 19:15:02,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:02,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:02,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:02,395 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2019-10-13 19:15:02,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:02,722 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2019-10-13 19:15:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:02,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:02,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:02,766 INFO L225 Difference]: With dead ends: 65292 [2019-10-13 19:15:02,766 INFO L226 Difference]: Without dead ends: 44042 [2019-10-13 19:15:02,793 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,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2019-10-13 19:15:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2019-10-13 19:15:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2019-10-13 19:15:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2019-10-13 19:15:03,610 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2019-10-13 19:15:03,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:03,610 INFO L462 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2019-10-13 19:15:03,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:03,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2019-10-13 19:15:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:03,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:03,635 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:03,635 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2019-10-13 19:15:03,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:03,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302681847] [2019-10-13 19:15:03,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:03,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:03,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:03,656 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:03,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302681847] [2019-10-13 19:15:03,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:03,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:03,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517669251] [2019-10-13 19:15:03,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:03,658 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:03,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:03,658 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2019-10-13 19:15:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:04,054 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2019-10-13 19:15:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:04,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:04,121 INFO L225 Difference]: With dead ends: 75788 [2019-10-13 19:15:04,121 INFO L226 Difference]: Without dead ends: 75786 [2019-10-13 19:15:04,137 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:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2019-10-13 19:15:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2019-10-13 19:15:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2019-10-13 19:15:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2019-10-13 19:15:05,820 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2019-10-13 19:15:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:05,820 INFO L462 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2019-10-13 19:15:05,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2019-10-13 19:15:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-13 19:15:05,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:05,857 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:05,857 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2019-10-13 19:15:05,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:05,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923273979] [2019-10-13 19:15:05,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:05,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:05,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:15:05,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923273979] [2019-10-13 19:15:05,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:05,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:05,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510909585] [2019-10-13 19:15:05,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:05,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:05,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:05,876 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2019-10-13 19:15:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:06,744 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2019-10-13 19:15:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:06,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-13 19:15:06,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:06,826 INFO L225 Difference]: With dead ends: 150540 [2019-10-13 19:15:06,826 INFO L226 Difference]: Without dead ends: 86026 [2019-10-13 19:15:06,871 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:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2019-10-13 19:15:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2019-10-13 19:15:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2019-10-13 19:15:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2019-10-13 19:15:09,400 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2019-10-13 19:15:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:09,400 INFO L462 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2019-10-13 19:15:09,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:09,400 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2019-10-13 19:15:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:15:09,433 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:09,433 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, 1] [2019-10-13 19:15:09,433 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2019-10-13 19:15:09,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:09,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758677967] [2019-10-13 19:15:09,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:09,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:09,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:09,458 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:09,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758677967] [2019-10-13 19:15:09,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:09,459 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:09,459 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136483544] [2019-10-13 19:15:09,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:09,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:09,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:09,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:09,460 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2019-10-13 19:15:09,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:09,992 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2019-10-13 19:15:09,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:09,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-13 19:15:09,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:10,065 INFO L225 Difference]: With dead ends: 129036 [2019-10-13 19:15:10,065 INFO L226 Difference]: Without dead ends: 87050 [2019-10-13 19:15:10,098 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:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2019-10-13 19:15:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2019-10-13 19:15:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2019-10-13 19:15:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2019-10-13 19:15:11,320 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2019-10-13 19:15:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:11,320 INFO L462 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2019-10-13 19:15:11,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2019-10-13 19:15:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:15:11,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:11,358 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, 1] [2019-10-13 19:15:11,358 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:11,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:11,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2019-10-13 19:15:11,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:11,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440769913] [2019-10-13 19:15:11,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:11,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:11,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:15:11,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440769913] [2019-10-13 19:15:11,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:11,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:11,377 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945694507] [2019-10-13 19:15:11,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:11,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:11,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:11,378 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2019-10-13 19:15:13,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:13,835 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2019-10-13 19:15:13,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:13,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-13 19:15:13,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:13,955 INFO L225 Difference]: With dead ends: 147468 [2019-10-13 19:15:13,956 INFO L226 Difference]: Without dead ends: 147466 [2019-10-13 19:15:13,972 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:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-10-13 19:15:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2019-10-13 19:15:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2019-10-13 19:15:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2019-10-13 19:15:15,574 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2019-10-13 19:15:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:15,574 INFO L462 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2019-10-13 19:15:15,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2019-10-13 19:15:15,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:15:15,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:15,634 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, 1] [2019-10-13 19:15:15,634 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2019-10-13 19:15:15,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:15,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310067591] [2019-10-13 19:15:15,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:15,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:15,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:15,662 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:15,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310067591] [2019-10-13 19:15:15,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:15,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:15,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505187336] [2019-10-13 19:15:15,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:15,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:15,663 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2019-10-13 19:15:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:15:16,754 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2019-10-13 19:15:16,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:15:16,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-13 19:15:16,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:15:16,914 INFO L225 Difference]: With dead ends: 299020 [2019-10-13 19:15:16,914 INFO L226 Difference]: Without dead ends: 169994 [2019-10-13 19:15:17,004 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:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2019-10-13 19:15:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2019-10-13 19:15:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2019-10-13 19:15:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2019-10-13 19:15:21,821 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2019-10-13 19:15:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:15:21,821 INFO L462 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2019-10-13 19:15:21,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:15:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2019-10-13 19:15:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 19:15:21,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:15:21,886 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, 1, 1] [2019-10-13 19:15:21,886 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:15:21,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:15:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2019-10-13 19:15:21,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:15:21,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492976887] [2019-10-13 19:15:21,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:21,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:15:21,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:15:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:15:21,904 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:21,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492976887] [2019-10-13 19:15:21,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:15:21,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:15:21,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276015803] [2019-10-13 19:15:21,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:15:21,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:15:21,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:15:21,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:15:21,906 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states.