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_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:13:45,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:13:45,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:13:45,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:13:45,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:13:45,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:13:45,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:13:45,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:13:45,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:13:45,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:13:45,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:13:45,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:13:45,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:13:45,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:13:45,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:13:45,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:13:45,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:13:45,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:13:45,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:13:45,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:13:45,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:13:45,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:13:45,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:13:45,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:13:45,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:13:45,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:13:45,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:13:45,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:13:45,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:13:45,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:13:45,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:13:45,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:13:45,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:13:45,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:13:45,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:13:45,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:13:45,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:13:45,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:13:45,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:13:45,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:13:45,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:13:45,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:13:45,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:13:45,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:13:45,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:13:45,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:13:45,745 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:13:45,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:13:45,745 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:13:45,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:13:45,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:13:45,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:13:45,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:13:45,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:13:45,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:13:45,747 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:13:45,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:13:45,747 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:13:45,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:13:45,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:13:45,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:13:45,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:13:45,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:13:45,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:45,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:13:45,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:13:45,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:13:45,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:13:45,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:13:45,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:13:45,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:13:46,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:13:46,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:13:46,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:13:46,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:13:46,069 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:13:46,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-14 23:13:46,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ada9a8/214327d9ced64872b5288a89c7000312/FLAG451fe6046 [2019-10-14 23:13:46,570 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:13:46,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2019-10-14 23:13:46,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ada9a8/214327d9ced64872b5288a89c7000312/FLAG451fe6046 [2019-10-14 23:13:46,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363ada9a8/214327d9ced64872b5288a89c7000312 [2019-10-14 23:13:46,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:13:46,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:13:46,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:46,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:13:46,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:13:46,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:46" (1/1) ... [2019-10-14 23:13:46,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3335b144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:46, skipping insertion in model container [2019-10-14 23:13:46,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:13:46" (1/1) ... [2019-10-14 23:13:46,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:13:46,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:13:47,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:47,229 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:13:47,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:13:47,301 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:13:47,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47 WrapperNode [2019-10-14 23:13:47,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:13:47,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:13:47,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:13:47,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:13:47,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... [2019-10-14 23:13:47,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:13:47,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:13:47,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:13:47,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:13:47,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:13:47,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:13:47,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:13:47,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:13:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:13:47,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:13:47,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:13:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:13:47,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:13:47,919 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:13:47,920 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:13:47,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:47 BoogieIcfgContainer [2019-10-14 23:13:47,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:13:47,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:13:47,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:13:47,932 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:13:47,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:13:46" (1/3) ... [2019-10-14 23:13:47,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170bc673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:47, skipping insertion in model container [2019-10-14 23:13:47,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:13:47" (2/3) ... [2019-10-14 23:13:47,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170bc673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:13:47, skipping insertion in model container [2019-10-14 23:13:47,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:13:47" (3/3) ... [2019-10-14 23:13:47,936 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-10-14 23:13:47,945 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:13:47,953 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:13:47,965 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:13:47,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:13:47,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:13:47,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:13:47,998 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:13:47,998 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:13:47,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:13:47,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:13:47,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:13:48,018 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2019-10-14 23:13:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:48,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:48,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:48,029 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2019-10-14 23:13:48,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:48,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885679102] [2019-10-14 23:13:48,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:48,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885679102] [2019-10-14 23:13:48,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:48,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:48,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480794495] [2019-10-14 23:13:48,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:48,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:48,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,281 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2019-10-14 23:13:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,348 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2019-10-14 23:13:48,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,370 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:13:48,372 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:13:48,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:13:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2019-10-14 23:13:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:13:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2019-10-14 23:13:48,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2019-10-14 23:13:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:48,476 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2019-10-14 23:13:48,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:48,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2019-10-14 23:13:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-14 23:13:48,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:48,481 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:48,482 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:48,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2019-10-14 23:13:48,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:48,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967203136] [2019-10-14 23:13:48,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:48,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967203136] [2019-10-14 23:13:48,622 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:48,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:48,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397510967] [2019-10-14 23:13:48,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:48,625 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:48,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,626 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2019-10-14 23:13:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,696 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2019-10-14 23:13:48,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-14 23:13:48,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,699 INFO L225 Difference]: With dead ends: 157 [2019-10-14 23:13:48,701 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:13:48,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:13:48,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-10-14 23:13:48,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-14 23:13:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2019-10-14 23:13:48,730 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2019-10-14 23:13:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:48,731 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2019-10-14 23:13:48,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:48,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2019-10-14 23:13:48,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:48,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:48,735 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:48,736 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2019-10-14 23:13:48,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:48,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147414864] [2019-10-14 23:13:48,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:48,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147414864] [2019-10-14 23:13:48,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:48,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:48,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676561436] [2019-10-14 23:13:48,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:48,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,844 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2019-10-14 23:13:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,878 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2019-10-14 23:13:48,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:48,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,880 INFO L225 Difference]: With dead ends: 144 [2019-10-14 23:13:48,881 INFO L226 Difference]: Without dead ends: 99 [2019-10-14 23:13:48,881 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-14 23:13:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2019-10-14 23:13:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-14 23:13:48,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2019-10-14 23:13:48,891 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2019-10-14 23:13:48,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:48,892 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2019-10-14 23:13:48,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2019-10-14 23:13:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:48,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:48,893 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:48,893 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2019-10-14 23:13:48,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:48,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25932890] [2019-10-14 23:13:48,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,895 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:48,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:48,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25932890] [2019-10-14 23:13:48,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:48,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:48,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176235551] [2019-10-14 23:13:48,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:48,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,953 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2019-10-14 23:13:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:48,985 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2019-10-14 23:13:48,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:48,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:48,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:48,988 INFO L225 Difference]: With dead ends: 184 [2019-10-14 23:13:48,988 INFO L226 Difference]: Without dead ends: 182 [2019-10-14 23:13:48,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:48,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-14 23:13:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2019-10-14 23:13:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-14 23:13:49,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2019-10-14 23:13:49,003 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2019-10-14 23:13:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,003 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2019-10-14 23:13:49,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,003 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2019-10-14 23:13:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:13:49,005 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,005 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2019-10-14 23:13:49,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064890914] [2019-10-14 23:13:49,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,007 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064890914] [2019-10-14 23:13:49,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426553188] [2019-10-14 23:13:49,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,068 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2019-10-14 23:13:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,112 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2019-10-14 23:13:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-14 23:13:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,115 INFO L225 Difference]: With dead ends: 304 [2019-10-14 23:13:49,115 INFO L226 Difference]: Without dead ends: 184 [2019-10-14 23:13:49,116 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-14 23:13:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-14 23:13:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-14 23:13:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2019-10-14 23:13:49,131 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2019-10-14 23:13:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,132 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2019-10-14 23:13:49,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2019-10-14 23:13:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:49,134 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,134 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,135 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2019-10-14 23:13:49,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691441924] [2019-10-14 23:13:49,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691441924] [2019-10-14 23:13:49,200 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,201 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,201 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55028252] [2019-10-14 23:13:49,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,202 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,203 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2019-10-14 23:13:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,229 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2019-10-14 23:13:49,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,232 INFO L225 Difference]: With dead ends: 273 [2019-10-14 23:13:49,235 INFO L226 Difference]: Without dead ends: 186 [2019-10-14 23:13:49,236 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-14 23:13:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2019-10-14 23:13:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-14 23:13:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2019-10-14 23:13:49,277 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2019-10-14 23:13:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,278 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2019-10-14 23:13:49,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2019-10-14 23:13:49,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:49,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,282 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2019-10-14 23:13:49,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643401317] [2019-10-14 23:13:49,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,337 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643401317] [2019-10-14 23:13:49,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590428304] [2019-10-14 23:13:49,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,340 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2019-10-14 23:13:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,379 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2019-10-14 23:13:49,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,384 INFO L225 Difference]: With dead ends: 348 [2019-10-14 23:13:49,384 INFO L226 Difference]: Without dead ends: 346 [2019-10-14 23:13:49,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-14 23:13:49,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2019-10-14 23:13:49,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-14 23:13:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2019-10-14 23:13:49,408 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2019-10-14 23:13:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,408 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2019-10-14 23:13:49,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2019-10-14 23:13:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:13:49,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,413 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,413 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2019-10-14 23:13:49,414 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765979116] [2019-10-14 23:13:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765979116] [2019-10-14 23:13:49,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223894432] [2019-10-14 23:13:49,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,456 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2019-10-14 23:13:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,491 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2019-10-14 23:13:49,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:13:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,494 INFO L225 Difference]: With dead ends: 592 [2019-10-14 23:13:49,494 INFO L226 Difference]: Without dead ends: 354 [2019-10-14 23:13:49,497 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-10-14 23:13:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2019-10-14 23:13:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-10-14 23:13:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2019-10-14 23:13:49,521 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2019-10-14 23:13:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,522 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2019-10-14 23:13:49,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2019-10-14 23:13:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:49,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,526 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,526 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,527 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2019-10-14 23:13:49,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849972077] [2019-10-14 23:13:49,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,527 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,581 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849972077] [2019-10-14 23:13:49,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915035503] [2019-10-14 23:13:49,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,585 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2019-10-14 23:13:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,610 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2019-10-14 23:13:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,614 INFO L225 Difference]: With dead ends: 528 [2019-10-14 23:13:49,614 INFO L226 Difference]: Without dead ends: 358 [2019-10-14 23:13:49,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-10-14 23:13:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-10-14 23:13:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-10-14 23:13:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2019-10-14 23:13:49,629 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2019-10-14 23:13:49,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,632 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2019-10-14 23:13:49,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2019-10-14 23:13:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:49,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,636 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2019-10-14 23:13:49,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488729387] [2019-10-14 23:13:49,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488729387] [2019-10-14 23:13:49,670 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,671 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743251417] [2019-10-14 23:13:49,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,672 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2019-10-14 23:13:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,707 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2019-10-14 23:13:49,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,712 INFO L225 Difference]: With dead ends: 668 [2019-10-14 23:13:49,713 INFO L226 Difference]: Without dead ends: 666 [2019-10-14 23:13:49,716 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2019-10-14 23:13:49,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2019-10-14 23:13:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-14 23:13:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2019-10-14 23:13:49,734 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2019-10-14 23:13:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,735 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2019-10-14 23:13:49,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2019-10-14 23:13:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:13:49,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,738 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2019-10-14 23:13:49,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-14 23:13:49,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980683174] [2019-10-14 23:13:49,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333948638] [2019-10-14 23:13:49,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,788 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2019-10-14 23:13:49,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,816 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2019-10-14 23:13:49,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-14 23:13:49,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,821 INFO L225 Difference]: With dead ends: 1164 [2019-10-14 23:13:49,821 INFO L226 Difference]: Without dead ends: 690 [2019-10-14 23:13:49,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-14 23:13:49,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2019-10-14 23:13:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-14 23:13:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2019-10-14 23:13:49,844 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2019-10-14 23:13:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,844 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2019-10-14 23:13:49,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2019-10-14 23:13:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:49,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,846 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2019-10-14 23:13:49,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432369884] [2019-10-14 23:13:49,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,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-14 23:13:49,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432369884] [2019-10-14 23:13:49,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705770840] [2019-10-14 23:13:49,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,876 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2019-10-14 23:13:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,902 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2019-10-14 23:13:49,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:49,907 INFO L225 Difference]: With dead ends: 1032 [2019-10-14 23:13:49,907 INFO L226 Difference]: Without dead ends: 698 [2019-10-14 23:13:49,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-14 23:13:49,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2019-10-14 23:13:49,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-14 23:13:49,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2019-10-14 23:13:49,930 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2019-10-14 23:13:49,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:49,931 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2019-10-14 23:13:49,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2019-10-14 23:13:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:49,932 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:49,932 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:49,933 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:49,933 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2019-10-14 23:13:49,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:49,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129663865] [2019-10-14 23:13:49,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:49,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:49,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:49,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129663865] [2019-10-14 23:13:49,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:49,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:49,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662495767] [2019-10-14 23:13:49,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:49,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:49,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:49,962 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2019-10-14 23:13:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:49,995 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2019-10-14 23:13:49,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:49,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:49,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,004 INFO L225 Difference]: With dead ends: 1292 [2019-10-14 23:13:50,004 INFO L226 Difference]: Without dead ends: 1290 [2019-10-14 23:13:50,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-10-14 23:13:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2019-10-14 23:13:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-10-14 23:13:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2019-10-14 23:13:50,041 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2019-10-14 23:13:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,041 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2019-10-14 23:13:50,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2019-10-14 23:13:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:13:50,044 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,045 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2019-10-14 23:13:50,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042817623] [2019-10-14 23:13:50,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042817623] [2019-10-14 23:13:50,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983520682] [2019-10-14 23:13:50,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,078 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2019-10-14 23:13:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,115 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2019-10-14 23:13:50,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-14 23:13:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,123 INFO L225 Difference]: With dead ends: 2300 [2019-10-14 23:13:50,123 INFO L226 Difference]: Without dead ends: 1354 [2019-10-14 23:13:50,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-10-14 23:13:50,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2019-10-14 23:13:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2019-10-14 23:13:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2019-10-14 23:13:50,199 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2019-10-14 23:13:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,200 INFO L462 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2019-10-14 23:13:50,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2019-10-14 23:13:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:50,204 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,205 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,205 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2019-10-14 23:13:50,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923552934] [2019-10-14 23:13:50,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923552934] [2019-10-14 23:13:50,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,253 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316132174] [2019-10-14 23:13:50,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,255 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,256 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2019-10-14 23:13:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,312 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2019-10-14 23:13:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,320 INFO L225 Difference]: With dead ends: 2028 [2019-10-14 23:13:50,321 INFO L226 Difference]: Without dead ends: 1370 [2019-10-14 23:13:50,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-10-14 23:13:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2019-10-14 23:13:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-10-14 23:13:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2019-10-14 23:13:50,390 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2019-10-14 23:13:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,391 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2019-10-14 23:13:50,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2019-10-14 23:13:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:50,394 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,394 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,394 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2019-10-14 23:13:50,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493991647] [2019-10-14 23:13:50,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493991647] [2019-10-14 23:13:50,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,426 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888300458] [2019-10-14 23:13:50,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,427 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,428 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2019-10-14 23:13:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,490 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2019-10-14 23:13:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:50,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,505 INFO L225 Difference]: With dead ends: 2508 [2019-10-14 23:13:50,506 INFO L226 Difference]: Without dead ends: 2506 [2019-10-14 23:13:50,507 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-14 23:13:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2019-10-14 23:13:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-10-14 23:13:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2019-10-14 23:13:50,589 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2019-10-14 23:13:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,589 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2019-10-14 23:13:50,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2019-10-14 23:13:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:13:50,593 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,594 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,594 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2019-10-14 23:13:50,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973631696] [2019-10-14 23:13:50,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973631696] [2019-10-14 23:13:50,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180850431] [2019-10-14 23:13:50,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,632 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2019-10-14 23:13:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,694 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2019-10-14 23:13:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-14 23:13:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,708 INFO L225 Difference]: With dead ends: 4556 [2019-10-14 23:13:50,708 INFO L226 Difference]: Without dead ends: 2666 [2019-10-14 23:13:50,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-10-14 23:13:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2019-10-14 23:13:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2019-10-14 23:13:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2019-10-14 23:13:50,785 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2019-10-14 23:13:50,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,786 INFO L462 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2019-10-14 23:13:50,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2019-10-14 23:13:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:50,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,790 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,791 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2019-10-14 23:13:50,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922469628] [2019-10-14 23:13:50,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:50,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922469628] [2019-10-14 23:13:50,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:50,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:50,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080636518] [2019-10-14 23:13:50,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:50,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:50,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:50,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,821 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2019-10-14 23:13:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:50,869 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2019-10-14 23:13:50,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:50,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:50,882 INFO L225 Difference]: With dead ends: 3996 [2019-10-14 23:13:50,883 INFO L226 Difference]: Without dead ends: 2698 [2019-10-14 23:13:50,886 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-10-14 23:13:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2019-10-14 23:13:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2019-10-14 23:13:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2019-10-14 23:13:50,975 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2019-10-14 23:13:50,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:50,976 INFO L462 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2019-10-14 23:13:50,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:50,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2019-10-14 23:13:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:50,980 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:50,980 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:50,981 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2019-10-14 23:13:50,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:50,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072684879] [2019-10-14 23:13:50,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:50,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:51,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072684879] [2019-10-14 23:13:51,003 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905747226] [2019-10-14 23:13:51,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,004 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,005 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2019-10-14 23:13:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,060 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2019-10-14 23:13:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,084 INFO L225 Difference]: With dead ends: 4876 [2019-10-14 23:13:51,084 INFO L226 Difference]: Without dead ends: 4874 [2019-10-14 23:13:51,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-10-14 23:13:51,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2019-10-14 23:13:51,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-10-14 23:13:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2019-10-14 23:13:51,191 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2019-10-14 23:13:51,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:51,191 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2019-10-14 23:13:51,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2019-10-14 23:13:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:13:51,199 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,199 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:51,199 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2019-10-14 23:13:51,200 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497639270] [2019-10-14 23:13:51,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:51,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497639270] [2019-10-14 23:13:51,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658570517] [2019-10-14 23:13:51,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,223 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2019-10-14 23:13:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,297 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2019-10-14 23:13:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:13:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,321 INFO L225 Difference]: With dead ends: 9036 [2019-10-14 23:13:51,322 INFO L226 Difference]: Without dead ends: 5258 [2019-10-14 23:13:51,330 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2019-10-14 23:13:51,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2019-10-14 23:13:51,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2019-10-14 23:13:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2019-10-14 23:13:51,506 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2019-10-14 23:13:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:51,506 INFO L462 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2019-10-14 23:13:51,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2019-10-14 23:13:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:51,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,516 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:51,516 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2019-10-14 23:13:51,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130578753] [2019-10-14 23:13:51,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,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-14 23:13:51,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130578753] [2019-10-14 23:13:51,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304657525] [2019-10-14 23:13:51,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,544 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2019-10-14 23:13:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,627 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2019-10-14 23:13:51,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,641 INFO L225 Difference]: With dead ends: 7884 [2019-10-14 23:13:51,641 INFO L226 Difference]: Without dead ends: 5322 [2019-10-14 23:13:51,647 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2019-10-14 23:13:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2019-10-14 23:13:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2019-10-14 23:13:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2019-10-14 23:13:51,770 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2019-10-14 23:13:51,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:51,771 INFO L462 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2019-10-14 23:13:51,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2019-10-14 23:13:51,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:51,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:51,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:51,778 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:51,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2019-10-14 23:13:51,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:51,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609648616] [2019-10-14 23:13:51,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:51,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:51,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609648616] [2019-10-14 23:13:51,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:51,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:51,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193590282] [2019-10-14 23:13:51,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:51,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:51,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:51,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,807 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2019-10-14 23:13:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:51,934 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2019-10-14 23:13:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:51,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:51,957 INFO L225 Difference]: With dead ends: 15564 [2019-10-14 23:13:51,958 INFO L226 Difference]: Without dead ends: 10378 [2019-10-14 23:13:51,970 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2019-10-14 23:13:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2019-10-14 23:13:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-14 23:13:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2019-10-14 23:13:52,286 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2019-10-14 23:13:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,286 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2019-10-14 23:13:52,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2019-10-14 23:13:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:13:52,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,298 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:52,298 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2019-10-14 23:13:52,299 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240725714] [2019-10-14 23:13:52,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240725714] [2019-10-14 23:13:52,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643754313] [2019-10-14 23:13:52,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,322 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2019-10-14 23:13:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:52,459 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2019-10-14 23:13:52,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:52,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-14 23:13:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:52,484 INFO L225 Difference]: With dead ends: 12172 [2019-10-14 23:13:52,485 INFO L226 Difference]: Without dead ends: 12170 [2019-10-14 23:13:52,490 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2019-10-14 23:13:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2019-10-14 23:13:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2019-10-14 23:13:52,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2019-10-14 23:13:52,835 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2019-10-14 23:13:52,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:52,836 INFO L462 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2019-10-14 23:13:52,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2019-10-14 23:13:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:52,849 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:52,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:52,849 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2019-10-14 23:13:52,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:52,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962222220] [2019-10-14 23:13:52,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:52,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:52,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962222220] [2019-10-14 23:13:52,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:52,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:52,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539292758] [2019-10-14 23:13:52,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:52,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:52,874 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2019-10-14 23:13:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:53,066 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2019-10-14 23:13:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:53,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:53,101 INFO L225 Difference]: With dead ends: 18316 [2019-10-14 23:13:53,101 INFO L226 Difference]: Without dead ends: 18314 [2019-10-14 23:13:53,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2019-10-14 23:13:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2019-10-14 23:13:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2019-10-14 23:13:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2019-10-14 23:13:53,946 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2019-10-14 23:13:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:53,946 INFO L462 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2019-10-14 23:13:53,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2019-10-14 23:13:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:13:53,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:53,966 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:53,967 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:53,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2019-10-14 23:13:53,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:53,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069286109] [2019-10-14 23:13:53,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:53,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:53,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069286109] [2019-10-14 23:13:53,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:53,987 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:53,987 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213454806] [2019-10-14 23:13:53,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:53,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:53,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:53,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:53,988 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2019-10-14 23:13:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,186 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2019-10-14 23:13:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-14 23:13:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,225 INFO L225 Difference]: With dead ends: 35468 [2019-10-14 23:13:54,225 INFO L226 Difference]: Without dead ends: 20362 [2019-10-14 23:13:54,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2019-10-14 23:13:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2019-10-14 23:13:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-10-14 23:13:54,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2019-10-14 23:13:54,701 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2019-10-14 23:13:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:54,701 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2019-10-14 23:13:54,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2019-10-14 23:13:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:54,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:54,726 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:54,726 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:54,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2019-10-14 23:13:54,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:54,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322803307] [2019-10-14 23:13:54,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:54,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:54,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322803307] [2019-10-14 23:13:54,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:54,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:54,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408656554] [2019-10-14 23:13:54,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:54,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:54,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:54,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:54,755 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2019-10-14 23:13:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:54,947 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2019-10-14 23:13:54,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:54,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:54,989 INFO L225 Difference]: With dead ends: 30732 [2019-10-14 23:13:54,989 INFO L226 Difference]: Without dead ends: 20746 [2019-10-14 23:13:55,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2019-10-14 23:13:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2019-10-14 23:13:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2019-10-14 23:13:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2019-10-14 23:13:55,587 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2019-10-14 23:13:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:55,587 INFO L462 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2019-10-14 23:13:55,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2019-10-14 23:13:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:55,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:55,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:55,617 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:55,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2019-10-14 23:13:55,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:55,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778440748] [2019-10-14 23:13:55,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:55,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:55,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-14 23:13:55,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778440748] [2019-10-14 23:13:55,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:55,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:55,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923252153] [2019-10-14 23:13:55,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:55,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:55,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:55,648 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2019-10-14 23:13:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:55,923 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2019-10-14 23:13:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:55,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:55,983 INFO L225 Difference]: With dead ends: 35852 [2019-10-14 23:13:55,984 INFO L226 Difference]: Without dead ends: 35850 [2019-10-14 23:13:55,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2019-10-14 23:13:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2019-10-14 23:13:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2019-10-14 23:13:56,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2019-10-14 23:13:56,783 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2019-10-14 23:13:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:56,783 INFO L462 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2019-10-14 23:13:56,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2019-10-14 23:13:56,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:13:56,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:56,830 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:56,831 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2019-10-14 23:13:56,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:56,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035435986] [2019-10-14 23:13:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:56,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:56,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035435986] [2019-10-14 23:13:56,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:56,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:56,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67785635] [2019-10-14 23:13:56,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:56,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:56,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:56,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:56,858 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2019-10-14 23:13:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:57,205 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2019-10-14 23:13:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:57,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-14 23:13:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:57,262 INFO L225 Difference]: With dead ends: 70668 [2019-10-14 23:13:57,262 INFO L226 Difference]: Without dead ends: 40458 [2019-10-14 23:13:57,322 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2019-10-14 23:13:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2019-10-14 23:13:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2019-10-14 23:13:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2019-10-14 23:13:58,886 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2019-10-14 23:13:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:13:58,887 INFO L462 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2019-10-14 23:13:58,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:13:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2019-10-14 23:13:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:13:58,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:13:58,902 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:13:58,902 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:13:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:13:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2019-10-14 23:13:58,903 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:13:58,903 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118999416] [2019-10-14 23:13:58,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:13:58,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:13:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:13:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:13:58,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118999416] [2019-10-14 23:13:58,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:13:58,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:13:58,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424655554] [2019-10-14 23:13:58,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:13:58,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:13:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:13:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:58,924 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2019-10-14 23:13:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:13:59,252 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2019-10-14 23:13:59,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:13:59,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:13:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:13:59,298 INFO L225 Difference]: With dead ends: 60684 [2019-10-14 23:13:59,299 INFO L226 Difference]: Without dead ends: 40970 [2019-10-14 23:13:59,318 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:13:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2019-10-14 23:14:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2019-10-14 23:14:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2019-10-14 23:14:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2019-10-14 23:14:00,057 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2019-10-14 23:14:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:00,057 INFO L462 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2019-10-14 23:14:00,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2019-10-14 23:14:00,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:14:00,076 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:00,076 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:00,077 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2019-10-14 23:14:00,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:00,078 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143385708] [2019-10-14 23:14:00,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:00,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:00,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:00,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-14 23:14:00,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143385708] [2019-10-14 23:14:00,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:00,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:00,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583685279] [2019-10-14 23:14:00,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:00,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:00,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:00,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:00,099 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2019-10-14 23:14:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:00,457 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2019-10-14 23:14:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:00,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:14:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:00,527 INFO L225 Difference]: With dead ends: 69644 [2019-10-14 23:14:00,527 INFO L226 Difference]: Without dead ends: 69642 [2019-10-14 23:14:00,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2019-10-14 23:14:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2019-10-14 23:14:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2019-10-14 23:14:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2019-10-14 23:14:01,500 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2019-10-14 23:14:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:01,501 INFO L462 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2019-10-14 23:14:01,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2019-10-14 23:14:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-14 23:14:01,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:01,536 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:01,537 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:01,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2019-10-14 23:14:01,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:01,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668150074] [2019-10-14 23:14:01,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:01,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:01,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:01,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668150074] [2019-10-14 23:14:01,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:01,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:01,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797564645] [2019-10-14 23:14:01,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:01,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:01,562 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2019-10-14 23:14:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:02,302 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2019-10-14 23:14:02,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:02,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-14 23:14:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:02,370 INFO L225 Difference]: With dead ends: 140300 [2019-10-14 23:14:02,370 INFO L226 Difference]: Without dead ends: 79882 [2019-10-14 23:14:02,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2019-10-14 23:14:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2019-10-14 23:14:05,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2019-10-14 23:14:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2019-10-14 23:14:05,118 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2019-10-14 23:14:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:05,118 INFO L462 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2019-10-14 23:14:05,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:05,118 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2019-10-14 23:14:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:05,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:05,157 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:05,157 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2019-10-14 23:14:05,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:05,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926311574] [2019-10-14 23:14:05,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:05,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:05,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926311574] [2019-10-14 23:14:05,185 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:05,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:05,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608650619] [2019-10-14 23:14:05,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:05,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:05,186 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2019-10-14 23:14:05,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:05,918 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2019-10-14 23:14:05,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:05,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:05,993 INFO L225 Difference]: With dead ends: 119820 [2019-10-14 23:14:05,993 INFO L226 Difference]: Without dead ends: 80906 [2019-10-14 23:14:06,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2019-10-14 23:14:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2019-10-14 23:14:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2019-10-14 23:14:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2019-10-14 23:14:07,098 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2019-10-14 23:14:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:07,098 INFO L462 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2019-10-14 23:14:07,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:07,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2019-10-14 23:14:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:07,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:07,130 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:07,130 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:07,131 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2019-10-14 23:14:07,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:07,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710950214] [2019-10-14 23:14:07,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:07,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:07,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710950214] [2019-10-14 23:14:07,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:07,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:07,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542323515] [2019-10-14 23:14:07,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:07,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:07,151 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2019-10-14 23:14:07,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:07,863 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2019-10-14 23:14:07,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:07,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:07,998 INFO L225 Difference]: With dead ends: 135180 [2019-10-14 23:14:07,998 INFO L226 Difference]: Without dead ends: 135178 [2019-10-14 23:14:08,031 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2019-10-14 23:14:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2019-10-14 23:14:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2019-10-14 23:14:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2019-10-14 23:14:12,474 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2019-10-14 23:14:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:12,474 INFO L462 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2019-10-14 23:14:12,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2019-10-14 23:14:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:14:12,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:12,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:14:12,568 INFO L410 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2019-10-14 23:14:12,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:12,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718035862] [2019-10-14 23:14:12,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:12,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:12,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:14:12,598 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718035862] [2019-10-14 23:14:12,599 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:12,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:12,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20626334] [2019-10-14 23:14:12,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:12,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:12,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:12,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:12,600 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2019-10-14 23:14:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:13,621 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2019-10-14 23:14:13,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:13,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-14 23:14:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:13,785 INFO L225 Difference]: With dead ends: 278540 [2019-10-14 23:14:13,786 INFO L226 Difference]: Without dead ends: 157706 [2019-10-14 23:14:13,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2019-10-14 23:14:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2019-10-14 23:14:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2019-10-14 23:14:15,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2019-10-14 23:14:15,879 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2019-10-14 23:14:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:14:15,879 INFO L462 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2019-10-14 23:14:15,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:14:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2019-10-14 23:14:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:14:15,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:14:15,953 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-14 23:14:15,954 INFO L410 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:14:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:14:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2019-10-14 23:14:15,954 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:14:15,954 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535392476] [2019-10-14 23:14:15,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:15,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:14:15,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:14:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:14:15,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-14 23:14:15,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535392476] [2019-10-14 23:14:15,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:14:15,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:14:15,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265148628] [2019-10-14 23:14:15,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:14:15,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:14:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:14:15,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:15,972 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2019-10-14 23:14:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:14:17,433 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2019-10-14 23:14:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:14:17,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-14 23:14:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:14:17,600 INFO L225 Difference]: With dead ends: 236556 [2019-10-14 23:14:17,600 INFO L226 Difference]: Without dead ends: 159754 [2019-10-14 23:14:17,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:14:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states.