java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:18:30,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:18:30,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:18:30,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:18:30,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:18:30,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:18:30,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:18:30,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:18:30,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:18:30,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:18:30,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:18:30,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:18:30,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:18:30,736 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:18:30,737 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:18:30,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:18:30,739 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:18:30,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:18:30,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:18:30,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:18:30,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:18:30,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:18:30,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:18:30,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:18:30,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:18:30,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:18:30,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:18:30,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:18:30,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:18:30,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:18:30,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:18:30,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:18:30,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:18:30,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:18:30,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:18:30,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:18:30,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:18:30,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:18:30,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:18:30,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:18:30,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:18:30,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:18:30,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:18:30,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:18:30,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:18:30,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:18:30,801 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:18:30,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:18:30,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:18:30,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:18:30,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:18:30,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:18:30,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:18:30,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:18:30,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:18:30,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:18:30,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:18:30,804 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:18:30,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:18:30,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:18:30,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:18:30,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:18:30,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:18:30,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:30,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:18:30,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:18:30,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:18:30,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:18:30,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:18:30,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:18:30,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:18:30,840 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:18:30,854 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:18:30,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:18:30,858 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:18:30,859 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:18:30,859 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-09-16 16:18:30,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada641e14/d74f6dc31c0b4cc3a316ace2269d9071/FLAGef8ac0a4d [2019-09-16 16:18:31,327 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:18:31,328 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-09-16 16:18:31,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada641e14/d74f6dc31c0b4cc3a316ace2269d9071/FLAGef8ac0a4d [2019-09-16 16:18:31,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ada641e14/d74f6dc31c0b4cc3a316ace2269d9071 [2019-09-16 16:18:31,665 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:18:31,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:18:31,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:31,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:18:31,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:18:31,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:31" (1/1) ... [2019-09-16 16:18:31,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d40e83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:31, skipping insertion in model container [2019-09-16 16:18:31,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:18:31" (1/1) ... [2019-09-16 16:18:31,685 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:18:31,730 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:18:32,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:32,027 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:18:32,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:18:32,180 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:18:32,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32 WrapperNode [2019-09-16 16:18:32,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:18:32,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:18:32,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:18:32,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:18:32,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... [2019-09-16 16:18:32,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:18:32,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:18:32,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:18:32,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:18:32,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:18:32,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:18:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:18:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:18:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:18:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:18:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:18:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:18:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:18:32,626 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:18:32,627 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 16:18:32,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:32 BoogieIcfgContainer [2019-09-16 16:18:32,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:18:32,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:18:32,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:18:32,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:18:32,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:18:31" (1/3) ... [2019-09-16 16:18:32,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb210da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:32, skipping insertion in model container [2019-09-16 16:18:32,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:18:32" (2/3) ... [2019-09-16 16:18:32,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb210da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:18:32, skipping insertion in model container [2019-09-16 16:18:32,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:18:32" (3/3) ... [2019-09-16 16:18:32,636 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-09-16 16:18:32,645 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:18:32,653 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:18:32,675 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:18:32,711 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:18:32,712 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:18:32,712 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:18:32,712 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:18:32,713 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:18:32,715 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:18:32,715 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:18:32,715 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:18:32,715 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:18:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-09-16 16:18:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:32,742 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:32,743 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:32,745 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:32,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:32,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2062980600, now seen corresponding path program 1 times [2019-09-16 16:18:32,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:32,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:32,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:32,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:32,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:32,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:32,985 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2019-09-16 16:18:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,057 INFO L93 Difference]: Finished difference Result 105 states and 186 transitions. [2019-09-16 16:18:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,072 INFO L225 Difference]: With dead ends: 105 [2019-09-16 16:18:33,073 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 16:18:33,076 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 16:18:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 62. [2019-09-16 16:18:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-16 16:18:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2019-09-16 16:18:33,125 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 23 [2019-09-16 16:18:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,126 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2019-09-16 16:18:33,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2019-09-16 16:18:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-16 16:18:33,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,128 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,129 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1041912246, now seen corresponding path program 1 times [2019-09-16 16:18:33,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,222 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 3 states. [2019-09-16 16:18:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,267 INFO L93 Difference]: Finished difference Result 147 states and 272 transitions. [2019-09-16 16:18:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-16 16:18:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,269 INFO L225 Difference]: With dead ends: 147 [2019-09-16 16:18:33,270 INFO L226 Difference]: Without dead ends: 90 [2019-09-16 16:18:33,271 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-16 16:18:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-09-16 16:18:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-16 16:18:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 161 transitions. [2019-09-16 16:18:33,287 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 161 transitions. Word has length 23 [2019-09-16 16:18:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,288 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 161 transitions. [2019-09-16 16:18:33,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,288 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 161 transitions. [2019-09-16 16:18:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:33,290 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,290 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -471898432, now seen corresponding path program 1 times [2019-09-16 16:18:33,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,344 INFO L87 Difference]: Start difference. First operand 88 states and 161 transitions. Second operand 3 states. [2019-09-16 16:18:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,372 INFO L93 Difference]: Finished difference Result 135 states and 243 transitions. [2019-09-16 16:18:33,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,375 INFO L225 Difference]: With dead ends: 135 [2019-09-16 16:18:33,375 INFO L226 Difference]: Without dead ends: 93 [2019-09-16 16:18:33,376 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-16 16:18:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2019-09-16 16:18:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-16 16:18:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 163 transitions. [2019-09-16 16:18:33,398 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 163 transitions. Word has length 24 [2019-09-16 16:18:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,399 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 163 transitions. [2019-09-16 16:18:33,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 163 transitions. [2019-09-16 16:18:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:33,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,403 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,403 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2060246334, now seen corresponding path program 1 times [2019-09-16 16:18:33,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,445 INFO L87 Difference]: Start difference. First operand 91 states and 163 transitions. Second operand 3 states. [2019-09-16 16:18:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,475 INFO L93 Difference]: Finished difference Result 172 states and 312 transitions. [2019-09-16 16:18:33,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:33,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,478 INFO L225 Difference]: With dead ends: 172 [2019-09-16 16:18:33,478 INFO L226 Difference]: Without dead ends: 170 [2019-09-16 16:18:33,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-16 16:18:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 120. [2019-09-16 16:18:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-16 16:18:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 216 transitions. [2019-09-16 16:18:33,500 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 216 transitions. Word has length 24 [2019-09-16 16:18:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,500 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 216 transitions. [2019-09-16 16:18:33,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 216 transitions. [2019-09-16 16:18:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-16 16:18:33,504 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,504 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,505 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1213652608, now seen corresponding path program 1 times [2019-09-16 16:18:33,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,596 INFO L87 Difference]: Start difference. First operand 120 states and 216 transitions. Second operand 3 states. [2019-09-16 16:18:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,628 INFO L93 Difference]: Finished difference Result 284 states and 518 transitions. [2019-09-16 16:18:33,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-09-16 16:18:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,631 INFO L225 Difference]: With dead ends: 284 [2019-09-16 16:18:33,632 INFO L226 Difference]: Without dead ends: 172 [2019-09-16 16:18:33,633 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-16 16:18:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-09-16 16:18:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-16 16:18:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 306 transitions. [2019-09-16 16:18:33,661 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 306 transitions. Word has length 24 [2019-09-16 16:18:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,662 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 306 transitions. [2019-09-16 16:18:33,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 306 transitions. [2019-09-16 16:18:33,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:33,667 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,668 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,668 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash 557085835, now seen corresponding path program 1 times [2019-09-16 16:18:33,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,725 INFO L87 Difference]: Start difference. First operand 170 states and 306 transitions. Second operand 3 states. [2019-09-16 16:18:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,752 INFO L93 Difference]: Finished difference Result 255 states and 457 transitions. [2019-09-16 16:18:33,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:33,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,754 INFO L225 Difference]: With dead ends: 255 [2019-09-16 16:18:33,754 INFO L226 Difference]: Without dead ends: 174 [2019-09-16 16:18:33,755 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-16 16:18:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2019-09-16 16:18:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-16 16:18:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 306 transitions. [2019-09-16 16:18:33,768 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 306 transitions. Word has length 25 [2019-09-16 16:18:33,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,768 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 306 transitions. [2019-09-16 16:18:33,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 306 transitions. [2019-09-16 16:18:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:33,770 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,770 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,770 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1031262067, now seen corresponding path program 1 times [2019-09-16 16:18:33,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,832 INFO L87 Difference]: Start difference. First operand 172 states and 306 transitions. Second operand 3 states. [2019-09-16 16:18:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,864 INFO L93 Difference]: Finished difference Result 324 states and 584 transitions. [2019-09-16 16:18:33,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,869 INFO L225 Difference]: With dead ends: 324 [2019-09-16 16:18:33,869 INFO L226 Difference]: Without dead ends: 322 [2019-09-16 16:18:33,870 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-16 16:18:33,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 232. [2019-09-16 16:18:33,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-09-16 16:18:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-09-16 16:18:33,900 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 25 [2019-09-16 16:18:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,901 INFO L475 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-09-16 16:18:33,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-09-16 16:18:33,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-16 16:18:33,903 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:33,903 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:33,903 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:33,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:33,904 INFO L82 PathProgramCache]: Analyzing trace with hash -2052330421, now seen corresponding path program 1 times [2019-09-16 16:18:33,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:33,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:33,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:33,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:33,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:33,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:33,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:33,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:33,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,936 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 3 states. [2019-09-16 16:18:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:33,970 INFO L93 Difference]: Finished difference Result 552 states and 984 transitions. [2019-09-16 16:18:33,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:33,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-09-16 16:18:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:33,973 INFO L225 Difference]: With dead ends: 552 [2019-09-16 16:18:33,974 INFO L226 Difference]: Without dead ends: 330 [2019-09-16 16:18:33,975 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-16 16:18:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2019-09-16 16:18:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-16 16:18:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 578 transitions. [2019-09-16 16:18:33,995 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 578 transitions. Word has length 25 [2019-09-16 16:18:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:33,996 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 578 transitions. [2019-09-16 16:18:33,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 578 transitions. [2019-09-16 16:18:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:34,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,005 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1904139915, now seen corresponding path program 1 times [2019-09-16 16:18:34,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,055 INFO L87 Difference]: Start difference. First operand 328 states and 578 transitions. Second operand 3 states. [2019-09-16 16:18:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,085 INFO L93 Difference]: Finished difference Result 492 states and 864 transitions. [2019-09-16 16:18:34,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:34,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,089 INFO L225 Difference]: With dead ends: 492 [2019-09-16 16:18:34,090 INFO L226 Difference]: Without dead ends: 334 [2019-09-16 16:18:34,090 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-16 16:18:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2019-09-16 16:18:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-16 16:18:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 578 transitions. [2019-09-16 16:18:34,110 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 578 transitions. Word has length 26 [2019-09-16 16:18:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,111 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 578 transitions. [2019-09-16 16:18:34,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 578 transitions. [2019-09-16 16:18:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:34,112 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,112 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,112 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash 802479479, now seen corresponding path program 1 times [2019-09-16 16:18:34,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,149 INFO L87 Difference]: Start difference. First operand 332 states and 578 transitions. Second operand 3 states. [2019-09-16 16:18:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,173 INFO L93 Difference]: Finished difference Result 620 states and 1096 transitions. [2019-09-16 16:18:34,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:34,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,178 INFO L225 Difference]: With dead ends: 620 [2019-09-16 16:18:34,179 INFO L226 Difference]: Without dead ends: 618 [2019-09-16 16:18:34,179 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-16 16:18:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 456. [2019-09-16 16:18:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-09-16 16:18:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 782 transitions. [2019-09-16 16:18:34,196 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 782 transitions. Word has length 26 [2019-09-16 16:18:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,196 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 782 transitions. [2019-09-16 16:18:34,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,197 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 782 transitions. [2019-09-16 16:18:34,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-16 16:18:34,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,203 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,204 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash -218588875, now seen corresponding path program 1 times [2019-09-16 16:18:34,206 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,253 INFO L87 Difference]: Start difference. First operand 456 states and 782 transitions. Second operand 3 states. [2019-09-16 16:18:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,285 INFO L93 Difference]: Finished difference Result 1084 states and 1872 transitions. [2019-09-16 16:18:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-16 16:18:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,290 INFO L225 Difference]: With dead ends: 1084 [2019-09-16 16:18:34,290 INFO L226 Difference]: Without dead ends: 642 [2019-09-16 16:18:34,291 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-16 16:18:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2019-09-16 16:18:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-09-16 16:18:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1094 transitions. [2019-09-16 16:18:34,309 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1094 transitions. Word has length 26 [2019-09-16 16:18:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,310 INFO L475 AbstractCegarLoop]: Abstraction has 640 states and 1094 transitions. [2019-09-16 16:18:34,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1094 transitions. [2019-09-16 16:18:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:34,311 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,311 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,311 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash -892726496, now seen corresponding path program 1 times [2019-09-16 16:18:34,312 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,335 INFO L87 Difference]: Start difference. First operand 640 states and 1094 transitions. Second operand 3 states. [2019-09-16 16:18:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,356 INFO L93 Difference]: Finished difference Result 960 states and 1636 transitions. [2019-09-16 16:18:34,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,361 INFO L225 Difference]: With dead ends: 960 [2019-09-16 16:18:34,361 INFO L226 Difference]: Without dead ends: 650 [2019-09-16 16:18:34,362 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-09-16 16:18:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2019-09-16 16:18:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-09-16 16:18:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1094 transitions. [2019-09-16 16:18:34,380 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1094 transitions. Word has length 27 [2019-09-16 16:18:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,381 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1094 transitions. [2019-09-16 16:18:34,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1094 transitions. [2019-09-16 16:18:34,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:34,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,382 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,383 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1813892898, now seen corresponding path program 1 times [2019-09-16 16:18:34,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,404 INFO L87 Difference]: Start difference. First operand 648 states and 1094 transitions. Second operand 3 states. [2019-09-16 16:18:34,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,427 INFO L93 Difference]: Finished difference Result 1196 states and 2056 transitions. [2019-09-16 16:18:34,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:34,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,434 INFO L225 Difference]: With dead ends: 1196 [2019-09-16 16:18:34,434 INFO L226 Difference]: Without dead ends: 1194 [2019-09-16 16:18:34,435 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-09-16 16:18:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 904. [2019-09-16 16:18:34,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-09-16 16:18:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1494 transitions. [2019-09-16 16:18:34,459 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1494 transitions. Word has length 27 [2019-09-16 16:18:34,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,459 INFO L475 AbstractCegarLoop]: Abstraction has 904 states and 1494 transitions. [2019-09-16 16:18:34,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1494 transitions. [2019-09-16 16:18:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:18:34,461 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,462 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,462 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,462 INFO L82 PathProgramCache]: Analyzing trace with hash 792824544, now seen corresponding path program 1 times [2019-09-16 16:18:34,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,490 INFO L87 Difference]: Start difference. First operand 904 states and 1494 transitions. Second operand 3 states. [2019-09-16 16:18:34,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,524 INFO L93 Difference]: Finished difference Result 2140 states and 3560 transitions. [2019-09-16 16:18:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 16:18:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,535 INFO L225 Difference]: With dead ends: 2140 [2019-09-16 16:18:34,535 INFO L226 Difference]: Without dead ends: 1258 [2019-09-16 16:18:34,538 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-16 16:18:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1256. [2019-09-16 16:18:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-09-16 16:18:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2070 transitions. [2019-09-16 16:18:34,579 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2070 transitions. Word has length 27 [2019-09-16 16:18:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,580 INFO L475 AbstractCegarLoop]: Abstraction has 1256 states and 2070 transitions. [2019-09-16 16:18:34,580 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2070 transitions. [2019-09-16 16:18:34,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:34,582 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,582 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,583 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,583 INFO L82 PathProgramCache]: Analyzing trace with hash 396318762, now seen corresponding path program 1 times [2019-09-16 16:18:34,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,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-09-16 16:18:34,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,623 INFO L87 Difference]: Start difference. First operand 1256 states and 2070 transitions. Second operand 3 states. [2019-09-16 16:18:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,663 INFO L93 Difference]: Finished difference Result 1884 states and 3096 transitions. [2019-09-16 16:18:34,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:34,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,681 INFO L225 Difference]: With dead ends: 1884 [2019-09-16 16:18:34,681 INFO L226 Difference]: Without dead ends: 1274 [2019-09-16 16:18:34,684 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2019-09-16 16:18:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1272. [2019-09-16 16:18:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2019-09-16 16:18:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 2070 transitions. [2019-09-16 16:18:34,727 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 2070 transitions. Word has length 28 [2019-09-16 16:18:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,727 INFO L475 AbstractCegarLoop]: Abstraction has 1272 states and 2070 transitions. [2019-09-16 16:18:34,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 2070 transitions. [2019-09-16 16:18:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:34,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,731 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,731 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1192029140, now seen corresponding path program 1 times [2019-09-16 16:18:34,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,763 INFO L87 Difference]: Start difference. First operand 1272 states and 2070 transitions. Second operand 3 states. [2019-09-16 16:18:34,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,806 INFO L93 Difference]: Finished difference Result 2316 states and 3848 transitions. [2019-09-16 16:18:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,820 INFO L225 Difference]: With dead ends: 2316 [2019-09-16 16:18:34,820 INFO L226 Difference]: Without dead ends: 2314 [2019-09-16 16:18:34,821 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-09-16 16:18:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1800. [2019-09-16 16:18:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1800 states. [2019-09-16 16:18:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2854 transitions. [2019-09-16 16:18:34,880 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2854 transitions. Word has length 28 [2019-09-16 16:18:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:34,881 INFO L475 AbstractCegarLoop]: Abstraction has 1800 states and 2854 transitions. [2019-09-16 16:18:34,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2854 transitions. [2019-09-16 16:18:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 16:18:34,884 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:34,884 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:34,884 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:34,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2081869802, now seen corresponding path program 1 times [2019-09-16 16:18:34,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:34,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:34,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:34,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:34,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:34,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,904 INFO L87 Difference]: Start difference. First operand 1800 states and 2854 transitions. Second operand 3 states. [2019-09-16 16:18:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:34,955 INFO L93 Difference]: Finished difference Result 4236 states and 6760 transitions. [2019-09-16 16:18:34,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:34,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 16:18:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:34,969 INFO L225 Difference]: With dead ends: 4236 [2019-09-16 16:18:34,969 INFO L226 Difference]: Without dead ends: 2474 [2019-09-16 16:18:34,973 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:34,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2019-09-16 16:18:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2472. [2019-09-16 16:18:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-09-16 16:18:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3910 transitions. [2019-09-16 16:18:35,041 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3910 transitions. Word has length 28 [2019-09-16 16:18:35,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,042 INFO L475 AbstractCegarLoop]: Abstraction has 2472 states and 3910 transitions. [2019-09-16 16:18:35,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3910 transitions. [2019-09-16 16:18:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:35,045 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,045 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,046 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1702016437, now seen corresponding path program 1 times [2019-09-16 16:18:35,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,066 INFO L87 Difference]: Start difference. First operand 2472 states and 3910 transitions. Second operand 3 states. [2019-09-16 16:18:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,118 INFO L93 Difference]: Finished difference Result 3708 states and 5848 transitions. [2019-09-16 16:18:35,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,129 INFO L225 Difference]: With dead ends: 3708 [2019-09-16 16:18:35,130 INFO L226 Difference]: Without dead ends: 2506 [2019-09-16 16:18:35,133 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-16 16:18:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-09-16 16:18:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-09-16 16:18:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3910 transitions. [2019-09-16 16:18:35,198 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3910 transitions. Word has length 29 [2019-09-16 16:18:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,198 INFO L475 AbstractCegarLoop]: Abstraction has 2504 states and 3910 transitions. [2019-09-16 16:18:35,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3910 transitions. [2019-09-16 16:18:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:35,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,202 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,202 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash 113668535, now seen corresponding path program 1 times [2019-09-16 16:18:35,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,224 INFO L87 Difference]: Start difference. First operand 2504 states and 3910 transitions. Second operand 3 states. [2019-09-16 16:18:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,287 INFO L93 Difference]: Finished difference Result 4492 states and 7176 transitions. [2019-09-16 16:18:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,310 INFO L225 Difference]: With dead ends: 4492 [2019-09-16 16:18:35,311 INFO L226 Difference]: Without dead ends: 4490 [2019-09-16 16:18:35,313 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2019-09-16 16:18:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 3592. [2019-09-16 16:18:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2019-09-16 16:18:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 5446 transitions. [2019-09-16 16:18:35,466 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 5446 transitions. Word has length 29 [2019-09-16 16:18:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,467 INFO L475 AbstractCegarLoop]: Abstraction has 3592 states and 5446 transitions. [2019-09-16 16:18:35,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 5446 transitions. [2019-09-16 16:18:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 16:18:35,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,476 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,476 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,477 INFO L82 PathProgramCache]: Analyzing trace with hash -907399819, now seen corresponding path program 1 times [2019-09-16 16:18:35,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,504 INFO L87 Difference]: Start difference. First operand 3592 states and 5446 transitions. Second operand 3 states. [2019-09-16 16:18:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,602 INFO L93 Difference]: Finished difference Result 8396 states and 12808 transitions. [2019-09-16 16:18:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 16:18:35,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,655 INFO L225 Difference]: With dead ends: 8396 [2019-09-16 16:18:35,655 INFO L226 Difference]: Without dead ends: 4874 [2019-09-16 16:18:35,673 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2019-09-16 16:18:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4872. [2019-09-16 16:18:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4872 states. [2019-09-16 16:18:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7366 transitions. [2019-09-16 16:18:35,864 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7366 transitions. Word has length 29 [2019-09-16 16:18:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:35,864 INFO L475 AbstractCegarLoop]: Abstraction has 4872 states and 7366 transitions. [2019-09-16 16:18:35,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7366 transitions. [2019-09-16 16:18:35,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:35,870 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:35,870 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:35,871 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:35,871 INFO L82 PathProgramCache]: Analyzing trace with hash -771028257, now seen corresponding path program 1 times [2019-09-16 16:18:35,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:35,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:35,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:35,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:35,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:35,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,894 INFO L87 Difference]: Start difference. First operand 4872 states and 7366 transitions. Second operand 3 states. [2019-09-16 16:18:35,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:35,965 INFO L93 Difference]: Finished difference Result 7308 states and 11016 transitions. [2019-09-16 16:18:35,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:35,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:35,976 INFO L225 Difference]: With dead ends: 7308 [2019-09-16 16:18:35,976 INFO L226 Difference]: Without dead ends: 4938 [2019-09-16 16:18:35,981 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:35,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4938 states. [2019-09-16 16:18:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4938 to 4936. [2019-09-16 16:18:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4936 states. [2019-09-16 16:18:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4936 states to 4936 states and 7366 transitions. [2019-09-16 16:18:36,161 INFO L78 Accepts]: Start accepts. Automaton has 4936 states and 7366 transitions. Word has length 30 [2019-09-16 16:18:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,162 INFO L475 AbstractCegarLoop]: Abstraction has 4936 states and 7366 transitions. [2019-09-16 16:18:36,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4936 states and 7366 transitions. [2019-09-16 16:18:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:36,167 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,168 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,168 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1935591137, now seen corresponding path program 1 times [2019-09-16 16:18:36,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:36,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,190 INFO L87 Difference]: Start difference. First operand 4936 states and 7366 transitions. Second operand 3 states. [2019-09-16 16:18:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,328 INFO L93 Difference]: Finished difference Result 14412 states and 21320 transitions. [2019-09-16 16:18:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,349 INFO L225 Difference]: With dead ends: 14412 [2019-09-16 16:18:36,349 INFO L226 Difference]: Without dead ends: 9610 [2019-09-16 16:18:36,361 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2019-09-16 16:18:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 9608. [2019-09-16 16:18:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-16 16:18:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13958 transitions. [2019-09-16 16:18:36,600 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13958 transitions. Word has length 30 [2019-09-16 16:18:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:36,600 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13958 transitions. [2019-09-16 16:18:36,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:36,601 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13958 transitions. [2019-09-16 16:18:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 16:18:36,615 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:36,616 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:36,616 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:36,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:36,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1338307805, now seen corresponding path program 1 times [2019-09-16 16:18:36,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:36,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:36,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:36,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-09-16 16:18:36,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:36,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:36,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:36,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:36,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,647 INFO L87 Difference]: Start difference. First operand 9608 states and 13958 transitions. Second operand 3 states. [2019-09-16 16:18:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:36,799 INFO L93 Difference]: Finished difference Result 11148 states and 16776 transitions. [2019-09-16 16:18:36,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:36,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 16:18:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:36,896 INFO L225 Difference]: With dead ends: 11148 [2019-09-16 16:18:36,896 INFO L226 Difference]: Without dead ends: 11146 [2019-09-16 16:18:36,899 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2019-09-16 16:18:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 9608. [2019-09-16 16:18:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9608 states. [2019-09-16 16:18:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9608 states to 9608 states and 13830 transitions. [2019-09-16 16:18:37,119 INFO L78 Accepts]: Start accepts. Automaton has 9608 states and 13830 transitions. Word has length 30 [2019-09-16 16:18:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:37,119 INFO L475 AbstractCegarLoop]: Abstraction has 9608 states and 13830 transitions. [2019-09-16 16:18:37,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9608 states and 13830 transitions. [2019-09-16 16:18:37,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:37,130 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:37,130 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:37,131 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -126002102, now seen corresponding path program 1 times [2019-09-16 16:18:37,131 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:37,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:37,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:37,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:37,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-09-16 16:18:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:37,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:37,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,150 INFO L87 Difference]: Start difference. First operand 9608 states and 13830 transitions. Second operand 3 states. [2019-09-16 16:18:37,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:37,322 INFO L93 Difference]: Finished difference Result 16780 states and 24712 transitions. [2019-09-16 16:18:37,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:37,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:37,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:37,356 INFO L225 Difference]: With dead ends: 16780 [2019-09-16 16:18:37,356 INFO L226 Difference]: Without dead ends: 16778 [2019-09-16 16:18:37,367 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16778 states. [2019-09-16 16:18:37,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16778 to 14216. [2019-09-16 16:18:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2019-09-16 16:18:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 19846 transitions. [2019-09-16 16:18:37,753 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 19846 transitions. Word has length 31 [2019-09-16 16:18:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:37,754 INFO L475 AbstractCegarLoop]: Abstraction has 14216 states and 19846 transitions. [2019-09-16 16:18:37,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:37,754 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 19846 transitions. [2019-09-16 16:18:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-16 16:18:37,775 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:37,775 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:37,775 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:37,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1147070456, now seen corresponding path program 1 times [2019-09-16 16:18:37,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:37,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:37,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:37,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:37,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:37,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:37,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:37,798 INFO L87 Difference]: Start difference. First operand 14216 states and 19846 transitions. Second operand 3 states. [2019-09-16 16:18:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:38,017 INFO L93 Difference]: Finished difference Result 32908 states and 46216 transitions. [2019-09-16 16:18:38,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:38,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-16 16:18:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:38,055 INFO L225 Difference]: With dead ends: 32908 [2019-09-16 16:18:38,055 INFO L226 Difference]: Without dead ends: 18826 [2019-09-16 16:18:38,088 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18826 states. [2019-09-16 16:18:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18826 to 18824. [2019-09-16 16:18:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18824 states. [2019-09-16 16:18:39,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18824 states to 18824 states and 26118 transitions. [2019-09-16 16:18:39,160 INFO L78 Accepts]: Start accepts. Automaton has 18824 states and 26118 transitions. Word has length 31 [2019-09-16 16:18:39,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:39,161 INFO L475 AbstractCegarLoop]: Abstraction has 18824 states and 26118 transitions. [2019-09-16 16:18:39,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 18824 states and 26118 transitions. [2019-09-16 16:18:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:18:39,182 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:39,182 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:39,183 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:39,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 389117270, now seen corresponding path program 1 times [2019-09-16 16:18:39,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:39,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:39,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:39,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:39,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:39,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:39,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:39,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:39,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:39,201 INFO L87 Difference]: Start difference. First operand 18824 states and 26118 transitions. Second operand 3 states. [2019-09-16 16:18:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:39,389 INFO L93 Difference]: Finished difference Result 28428 states and 39432 transitions. [2019-09-16 16:18:39,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:39,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 16:18:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:39,424 INFO L225 Difference]: With dead ends: 28428 [2019-09-16 16:18:39,424 INFO L226 Difference]: Without dead ends: 19210 [2019-09-16 16:18:39,444 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19210 states. [2019-09-16 16:18:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19210 to 19208. [2019-09-16 16:18:39,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19208 states. [2019-09-16 16:18:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 26374 transitions. [2019-09-16 16:18:39,904 INFO L78 Accepts]: Start accepts. Automaton has 19208 states and 26374 transitions. Word has length 32 [2019-09-16 16:18:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:39,904 INFO L475 AbstractCegarLoop]: Abstraction has 19208 states and 26374 transitions. [2019-09-16 16:18:39,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19208 states and 26374 transitions. [2019-09-16 16:18:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:18:39,928 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:39,929 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:39,929 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:39,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1199230632, now seen corresponding path program 1 times [2019-09-16 16:18:39,929 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:39,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:39,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:39,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:39,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:39,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:39,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:39,950 INFO L87 Difference]: Start difference. First operand 19208 states and 26374 transitions. Second operand 3 states. [2019-09-16 16:18:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:40,223 INFO L93 Difference]: Finished difference Result 32780 states and 45832 transitions. [2019-09-16 16:18:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:40,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 16:18:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:40,281 INFO L225 Difference]: With dead ends: 32780 [2019-09-16 16:18:40,281 INFO L226 Difference]: Without dead ends: 32778 [2019-09-16 16:18:40,293 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32778 states. [2019-09-16 16:18:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32778 to 28680. [2019-09-16 16:18:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28680 states. [2019-09-16 16:18:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28680 states to 28680 states and 38150 transitions. [2019-09-16 16:18:41,034 INFO L78 Accepts]: Start accepts. Automaton has 28680 states and 38150 transitions. Word has length 32 [2019-09-16 16:18:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:41,034 INFO L475 AbstractCegarLoop]: Abstraction has 28680 states and 38150 transitions. [2019-09-16 16:18:41,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 28680 states and 38150 transitions. [2019-09-16 16:18:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:18:41,074 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:41,074 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:41,074 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:41,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:41,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2074668310, now seen corresponding path program 1 times [2019-09-16 16:18:41,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:41,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:41,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:41,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:41,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:41,096 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:41,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:41,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:41,097 INFO L87 Difference]: Start difference. First operand 28680 states and 38150 transitions. Second operand 3 states. [2019-09-16 16:18:41,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:41,522 INFO L93 Difference]: Finished difference Result 65548 states and 87304 transitions. [2019-09-16 16:18:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:41,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-16 16:18:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:41,589 INFO L225 Difference]: With dead ends: 65548 [2019-09-16 16:18:41,589 INFO L226 Difference]: Without dead ends: 37386 [2019-09-16 16:18:41,650 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37386 states. [2019-09-16 16:18:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37386 to 37384. [2019-09-16 16:18:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37384 states. [2019-09-16 16:18:42,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37384 states to 37384 states and 49158 transitions. [2019-09-16 16:18:42,978 INFO L78 Accepts]: Start accepts. Automaton has 37384 states and 49158 transitions. Word has length 32 [2019-09-16 16:18:42,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:42,979 INFO L475 AbstractCegarLoop]: Abstraction has 37384 states and 49158 transitions. [2019-09-16 16:18:42,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:42,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37384 states and 49158 transitions. [2019-09-16 16:18:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:43,007 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:43,008 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:43,008 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1478771549, now seen corresponding path program 1 times [2019-09-16 16:18:43,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:43,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:43,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:43,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:43,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:43,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:43,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:43,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:43,030 INFO L87 Difference]: Start difference. First operand 37384 states and 49158 transitions. Second operand 3 states. [2019-09-16 16:18:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:43,347 INFO L93 Difference]: Finished difference Result 56076 states and 73480 transitions. [2019-09-16 16:18:43,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:43,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:43,418 INFO L225 Difference]: With dead ends: 56076 [2019-09-16 16:18:43,418 INFO L226 Difference]: Without dead ends: 37898 [2019-09-16 16:18:43,449 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:43,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37898 states. [2019-09-16 16:18:44,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37898 to 37896. [2019-09-16 16:18:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37896 states. [2019-09-16 16:18:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37896 states to 37896 states and 49158 transitions. [2019-09-16 16:18:44,203 INFO L78 Accepts]: Start accepts. Automaton has 37896 states and 49158 transitions. Word has length 33 [2019-09-16 16:18:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:44,203 INFO L475 AbstractCegarLoop]: Abstraction has 37896 states and 49158 transitions. [2019-09-16 16:18:44,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 37896 states and 49158 transitions. [2019-09-16 16:18:44,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:44,222 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:44,222 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:44,222 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:44,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:44,223 INFO L82 PathProgramCache]: Analyzing trace with hash -109576353, now seen corresponding path program 1 times [2019-09-16 16:18:44,224 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:44,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:44,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:44,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:44,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:44,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:44,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:44,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:44,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:44,245 INFO L87 Difference]: Start difference. First operand 37896 states and 49158 transitions. Second operand 3 states. [2019-09-16 16:18:44,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:44,677 INFO L93 Difference]: Finished difference Result 63500 states and 83464 transitions. [2019-09-16 16:18:44,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:44,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:44,805 INFO L225 Difference]: With dead ends: 63500 [2019-09-16 16:18:44,805 INFO L226 Difference]: Without dead ends: 63498 [2019-09-16 16:18:44,825 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63498 states. [2019-09-16 16:18:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63498 to 57352. [2019-09-16 16:18:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57352 states. [2019-09-16 16:18:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57352 states to 57352 states and 72198 transitions. [2019-09-16 16:18:46,478 INFO L78 Accepts]: Start accepts. Automaton has 57352 states and 72198 transitions. Word has length 33 [2019-09-16 16:18:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:46,478 INFO L475 AbstractCegarLoop]: Abstraction has 57352 states and 72198 transitions. [2019-09-16 16:18:46,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 57352 states and 72198 transitions. [2019-09-16 16:18:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-16 16:18:46,513 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:46,513 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:46,513 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1130644707, now seen corresponding path program 1 times [2019-09-16 16:18:46,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:46,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:46,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:46,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:46,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:46,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:46,532 INFO L87 Difference]: Start difference. First operand 57352 states and 72198 transitions. Second operand 3 states. [2019-09-16 16:18:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:47,271 INFO L93 Difference]: Finished difference Result 130060 states and 163336 transitions. [2019-09-16 16:18:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:47,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-09-16 16:18:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:47,343 INFO L225 Difference]: With dead ends: 130060 [2019-09-16 16:18:47,343 INFO L226 Difference]: Without dead ends: 73738 [2019-09-16 16:18:47,389 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73738 states. [2019-09-16 16:18:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73738 to 73736. [2019-09-16 16:18:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73736 states. [2019-09-16 16:18:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73736 states to 73736 states and 91142 transitions. [2019-09-16 16:18:49,935 INFO L78 Accepts]: Start accepts. Automaton has 73736 states and 91142 transitions. Word has length 33 [2019-09-16 16:18:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:49,935 INFO L475 AbstractCegarLoop]: Abstraction has 73736 states and 91142 transitions. [2019-09-16 16:18:49,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 73736 states and 91142 transitions. [2019-09-16 16:18:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:49,970 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:49,970 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:49,970 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:49,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:49,971 INFO L82 PathProgramCache]: Analyzing trace with hash 898316171, now seen corresponding path program 1 times [2019-09-16 16:18:49,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:49,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:49,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:49,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:49,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:49,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:49,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:49,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:49,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:49,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:49,988 INFO L87 Difference]: Start difference. First operand 73736 states and 91142 transitions. Second operand 3 states. [2019-09-16 16:18:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:50,460 INFO L93 Difference]: Finished difference Result 110604 states and 136200 transitions. [2019-09-16 16:18:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:50,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:50,537 INFO L225 Difference]: With dead ends: 110604 [2019-09-16 16:18:50,538 INFO L226 Difference]: Without dead ends: 74762 [2019-09-16 16:18:50,585 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74762 states. [2019-09-16 16:18:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74762 to 74760. [2019-09-16 16:18:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74760 states. [2019-09-16 16:18:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74760 states to 74760 states and 91142 transitions. [2019-09-16 16:18:51,583 INFO L78 Accepts]: Start accepts. Automaton has 74760 states and 91142 transitions. Word has length 34 [2019-09-16 16:18:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:51,583 INFO L475 AbstractCegarLoop]: Abstraction has 74760 states and 91142 transitions. [2019-09-16 16:18:51,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 74760 states and 91142 transitions. [2019-09-16 16:18:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:51,608 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:51,609 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:51,609 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:51,609 INFO L82 PathProgramCache]: Analyzing trace with hash -690031731, now seen corresponding path program 1 times [2019-09-16 16:18:51,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:51,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:51,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:51,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:51,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:51,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:51,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:51,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:51,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:51,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:51,630 INFO L87 Difference]: Start difference. First operand 74760 states and 91142 transitions. Second operand 3 states. [2019-09-16 16:18:52,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:52,550 INFO L93 Difference]: Finished difference Result 122892 states and 150536 transitions. [2019-09-16 16:18:52,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:52,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:52,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:52,648 INFO L225 Difference]: With dead ends: 122892 [2019-09-16 16:18:52,648 INFO L226 Difference]: Without dead ends: 122890 [2019-09-16 16:18:52,674 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:53,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122890 states. [2019-09-16 16:18:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122890 to 114696. [2019-09-16 16:18:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114696 states. [2019-09-16 16:18:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114696 states to 114696 states and 136198 transitions. [2019-09-16 16:18:53,977 INFO L78 Accepts]: Start accepts. Automaton has 114696 states and 136198 transitions. Word has length 34 [2019-09-16 16:18:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:53,978 INFO L475 AbstractCegarLoop]: Abstraction has 114696 states and 136198 transitions. [2019-09-16 16:18:53,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 114696 states and 136198 transitions. [2019-09-16 16:18:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-16 16:18:54,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:54,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:54,024 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:54,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:54,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1711100085, now seen corresponding path program 1 times [2019-09-16 16:18:54,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:54,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:54,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:54,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:54,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:54,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:54,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:54,051 INFO L87 Difference]: Start difference. First operand 114696 states and 136198 transitions. Second operand 3 states. [2019-09-16 16:18:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:18:56,342 INFO L93 Difference]: Finished difference Result 258060 states and 304136 transitions. [2019-09-16 16:18:56,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:18:56,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-16 16:18:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:18:56,457 INFO L225 Difference]: With dead ends: 258060 [2019-09-16 16:18:56,458 INFO L226 Difference]: Without dead ends: 145418 [2019-09-16 16:18:56,523 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:56,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145418 states. [2019-09-16 16:18:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145418 to 145416. [2019-09-16 16:18:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145416 states. [2019-09-16 16:18:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145416 states to 145416 states and 167942 transitions. [2019-09-16 16:18:58,297 INFO L78 Accepts]: Start accepts. Automaton has 145416 states and 167942 transitions. Word has length 34 [2019-09-16 16:18:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:18:58,298 INFO L475 AbstractCegarLoop]: Abstraction has 145416 states and 167942 transitions. [2019-09-16 16:18:58,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:18:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 145416 states and 167942 transitions. [2019-09-16 16:18:58,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:18:58,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:18:58,348 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:18:58,348 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:18:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:18:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash 84068978, now seen corresponding path program 1 times [2019-09-16 16:18:58,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:18:58,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:18:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:18:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:18:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:18:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:18:58,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:18:58,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:18:58,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:18:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:18:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:18:58,368 INFO L87 Difference]: Start difference. First operand 145416 states and 167942 transitions. Second operand 3 states. [2019-09-16 16:19:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:01,071 INFO L93 Difference]: Finished difference Result 218124 states and 250888 transitions. [2019-09-16 16:19:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:01,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:19:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:01,188 INFO L225 Difference]: With dead ends: 218124 [2019-09-16 16:19:01,188 INFO L226 Difference]: Without dead ends: 147466 [2019-09-16 16:19:01,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2019-09-16 16:19:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 147464. [2019-09-16 16:19:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147464 states. [2019-09-16 16:19:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147464 states to 147464 states and 167942 transitions. [2019-09-16 16:19:02,937 INFO L78 Accepts]: Start accepts. Automaton has 147464 states and 167942 transitions. Word has length 35 [2019-09-16 16:19:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:02,938 INFO L475 AbstractCegarLoop]: Abstraction has 147464 states and 167942 transitions. [2019-09-16 16:19:02,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 147464 states and 167942 transitions. [2019-09-16 16:19:02,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:19:02,988 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:02,988 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:02,988 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1504278924, now seen corresponding path program 1 times [2019-09-16 16:19:02,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:02,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:02,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:03,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:03,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:03,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:03,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:03,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:03,008 INFO L87 Difference]: Start difference. First operand 147464 states and 167942 transitions. Second operand 3 states. [2019-09-16 16:19:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:04,903 INFO L93 Difference]: Finished difference Result 237578 states and 268295 transitions. [2019-09-16 16:19:04,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:04,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:19:04,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:05,082 INFO L225 Difference]: With dead ends: 237578 [2019-09-16 16:19:05,082 INFO L226 Difference]: Without dead ends: 237576 [2019-09-16 16:19:05,104 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237576 states. [2019-09-16 16:19:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237576 to 229384. [2019-09-16 16:19:09,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229384 states. [2019-09-16 16:19:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229384 states to 229384 states and 256006 transitions. [2019-09-16 16:19:10,025 INFO L78 Accepts]: Start accepts. Automaton has 229384 states and 256006 transitions. Word has length 35 [2019-09-16 16:19:10,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:10,025 INFO L475 AbstractCegarLoop]: Abstraction has 229384 states and 256006 transitions. [2019-09-16 16:19:10,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 229384 states and 256006 transitions. [2019-09-16 16:19:10,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-16 16:19:10,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:19:10,128 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:19:10,129 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:19:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:19:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1769620018, now seen corresponding path program 1 times [2019-09-16 16:19:10,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:19:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:19:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:19:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:19:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:19:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:19:10,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:19:10,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:19:10,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:19:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:19:10,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:10,147 INFO L87 Difference]: Start difference. First operand 229384 states and 256006 transitions. Second operand 3 states. [2019-09-16 16:19:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:19:12,652 INFO L93 Difference]: Finished difference Result 512008 states and 563206 transitions. [2019-09-16 16:19:12,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:19:12,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-09-16 16:19:12,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:19:12,653 INFO L225 Difference]: With dead ends: 512008 [2019-09-16 16:19:12,653 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:19:12,945 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:19:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:19:12,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:19:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:19:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:19:12,946 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-09-16 16:19:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:19:12,946 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:19:12,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:19:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:19:12,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:19:12,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:19:13,001 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-16 16:19:13,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:13,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:19:13,001 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-16 16:19:13,001 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:19:13,001 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:19:13,001 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2019-09-16 16:19:13,002 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-09-16 16:19:13,003 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,004 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,005 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-09-16 16:19:13,005 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,005 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,006 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-09-16 16:19:13,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:19:13 BoogieIcfgContainer [2019-09-16 16:19:13,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:19:13,016 INFO L168 Benchmark]: Toolchain (without parser) took 41348.83 ms. Allocated memory was 139.5 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 87.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,017 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.91 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 87.1 MB in the beginning and 177.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,018 INFO L168 Benchmark]: Boogie Preprocessor took 61.98 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 175.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,019 INFO L168 Benchmark]: RCFGBuilder took 385.02 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 153.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,020 INFO L168 Benchmark]: TraceAbstraction took 40384.77 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 152.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-09-16 16:19:13,023 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.91 ms. Allocated memory was 139.5 MB in the beginning and 199.2 MB in the end (delta: 59.8 MB). Free memory was 87.1 MB in the beginning and 177.1 MB in the end (delta: -89.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.98 ms. Allocated memory is still 199.2 MB. Free memory was 177.1 MB in the beginning and 175.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.02 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 153.5 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40384.77 ms. Allocated memory was 199.2 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 152.9 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 53 locations, 1 error locations. SAFE Result, 40.3s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 16.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4001 SDtfs, 1984 SDslu, 2752 SDs, 0 SdLazy, 197 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229384occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 21.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 32808 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8202 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1077 NumberOfCodeBlocks, 1077 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1040 ConstructedInterpolants, 0 QuantifiedInterpolants, 61562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...