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/psyco/psyco_net_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:27:15,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:27:15,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:27:15,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:27:15,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:27:15,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:27:15,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:27:15,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:27:15,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:27:15,989 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:27:15,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:27:15,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:27:15,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:27:15,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:27:15,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:27:15,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:27:16,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:27:16,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:27:16,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:27:16,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:27:16,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:27:16,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:27:16,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:27:16,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:27:16,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:27:16,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:27:16,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:27:16,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:27:16,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:27:16,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:27:16,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:27:16,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:27:16,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:27:16,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:27:16,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:27:16,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:27:16,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:27:16,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:27:16,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:27:16,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:27:16,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:27:16,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 14:27:16,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:27:16,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:27:16,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:27:16,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:27:16,063 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:27:16,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:27:16,064 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:27:16,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:27:16,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:27:16,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:27:16,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:27:16,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:27:16,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:27:16,065 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:27:16,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:27:16,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:27:16,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:27:16,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:27:16,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:27:16,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:27:16,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:27:16,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:16,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:27:16,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:27:16,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:27:16,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:27:16,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:27:16,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:27:16,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:27:16,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:27:16,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:27:16,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:27:16,137 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:27:16,137 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:27:16,138 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_net_1.c [2019-10-02 14:27:16,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b56b9a1/31aa3bcbeba244b980e02aeffea58d4d/FLAG0f0c3a324 [2019-10-02 14:27:17,409 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:27:17,410 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1.c [2019-10-02 14:27:17,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b56b9a1/31aa3bcbeba244b980e02aeffea58d4d/FLAG0f0c3a324 [2019-10-02 14:27:18,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b56b9a1/31aa3bcbeba244b980e02aeffea58d4d [2019-10-02 14:27:18,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:27:18,054 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:27:18,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:18,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:27:18,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:27:18,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:18" (1/1) ... [2019-10-02 14:27:18,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a57a4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:18, skipping insertion in model container [2019-10-02 14:27:18,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:27:18" (1/1) ... [2019-10-02 14:27:18,068 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:27:18,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:27:20,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:20,545 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:27:21,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:27:21,651 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:27:21,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21 WrapperNode [2019-10-02 14:27:21,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:27:21,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:27:21,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:27:21,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:27:21,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:21,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:21,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:21,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:22,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:22,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:22,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... [2019-10-02 14:27:22,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:27:22,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:27:22,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:27:22,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:27:22,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:27:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:27:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:27:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:27:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:27:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:27:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:27:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:27:22,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:27:42,027 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:27:42,027 INFO L283 CfgBuilder]: Removed 1130 assume(true) statements. [2019-10-02 14:27:42,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:42 BoogieIcfgContainer [2019-10-02 14:27:42,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:27:42,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:27:42,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:27:42,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:27:42,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:27:18" (1/3) ... [2019-10-02 14:27:42,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae53664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:42, skipping insertion in model container [2019-10-02 14:27:42,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:27:21" (2/3) ... [2019-10-02 14:27:42,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae53664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:27:42, skipping insertion in model container [2019-10-02 14:27:42,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:27:42" (3/3) ... [2019-10-02 14:27:42,040 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-10-02 14:27:42,050 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:27:42,062 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:27:42,080 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:27:42,156 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:27:42,157 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:27:42,157 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:27:42,157 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:27:42,157 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:27:42,158 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:27:42,158 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:27:42,158 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:27:42,158 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:27:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states. [2019-10-02 14:27:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-02 14:27:42,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:42,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:42,279 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:42,285 INFO L82 PathProgramCache]: Analyzing trace with hash 2089661630, now seen corresponding path program 1 times [2019-10-02 14:27:42,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:42,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:42,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:27:42,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:27:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:27:42,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:42,632 INFO L87 Difference]: Start difference. First operand 9216 states. Second operand 2 states. [2019-10-02 14:27:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:42,944 INFO L93 Difference]: Finished difference Result 17704 states and 35386 transitions. [2019-10-02 14:27:42,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:27:42,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-02 14:27:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:43,051 INFO L225 Difference]: With dead ends: 17704 [2019-10-02 14:27:43,051 INFO L226 Difference]: Without dead ends: 8284 [2019-10-02 14:27:43,090 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:27:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2019-10-02 14:27:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2019-10-02 14:27:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-10-02 14:27:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 13001 transitions. [2019-10-02 14:27:43,505 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 13001 transitions. Word has length 13 [2019-10-02 14:27:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:43,506 INFO L475 AbstractCegarLoop]: Abstraction has 8284 states and 13001 transitions. [2019-10-02 14:27:43,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:27:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 13001 transitions. [2019-10-02 14:27:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-02 14:27:43,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:43,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:43,508 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 886062589, now seen corresponding path program 1 times [2019-10-02 14:27:43,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:43,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:43,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:43,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:43,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:43,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:43,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:43,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:43,718 INFO L87 Difference]: Start difference. First operand 8284 states and 13001 transitions. Second operand 3 states. [2019-10-02 14:27:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:46,763 INFO L93 Difference]: Finished difference Result 16565 states and 26000 transitions. [2019-10-02 14:27:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:46,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-02 14:27:46,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:46,810 INFO L225 Difference]: With dead ends: 16565 [2019-10-02 14:27:46,810 INFO L226 Difference]: Without dead ends: 8287 [2019-10-02 14:27:46,826 INFO L640 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-10-02 14:27:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-02 14:27:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8287. [2019-10-02 14:27:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2019-10-02 14:27:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2019-10-02 14:27:47,047 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 14 [2019-10-02 14:27:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:47,048 INFO L475 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2019-10-02 14:27:47,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:47,048 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2019-10-02 14:27:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-02 14:27:47,050 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:47,050 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:47,050 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:47,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:47,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1585116607, now seen corresponding path program 1 times [2019-10-02 14:27:47,051 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:47,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:47,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:47,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:47,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:47,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:47,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:47,212 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand 3 states. [2019-10-02 14:27:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:49,260 INFO L93 Difference]: Finished difference Result 16460 states and 25849 transitions. [2019-10-02 14:27:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:49,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-02 14:27:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:49,308 INFO L225 Difference]: With dead ends: 16460 [2019-10-02 14:27:49,308 INFO L226 Difference]: Without dead ends: 8180 [2019-10-02 14:27:49,326 INFO L640 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-10-02 14:27:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2019-10-02 14:27:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2019-10-02 14:27:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2019-10-02 14:27:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12850 transitions. [2019-10-02 14:27:49,894 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12850 transitions. Word has length 19 [2019-10-02 14:27:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:49,894 INFO L475 AbstractCegarLoop]: Abstraction has 8180 states and 12850 transitions. [2019-10-02 14:27:49,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12850 transitions. [2019-10-02 14:27:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-02 14:27:49,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:49,897 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:49,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -90884306, now seen corresponding path program 1 times [2019-10-02 14:27:49,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:49,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:49,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:49,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:49,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:49,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:49,983 INFO L87 Difference]: Start difference. First operand 8180 states and 12850 transitions. Second operand 3 states. [2019-10-02 14:27:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:54,113 INFO L93 Difference]: Finished difference Result 16268 states and 25567 transitions. [2019-10-02 14:27:54,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:54,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-02 14:27:54,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:54,146 INFO L225 Difference]: With dead ends: 16268 [2019-10-02 14:27:54,146 INFO L226 Difference]: Without dead ends: 8060 [2019-10-02 14:27:54,163 INFO L640 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-10-02 14:27:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2019-10-02 14:27:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 8060. [2019-10-02 14:27:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2019-10-02 14:27:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2019-10-02 14:27:54,331 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 23 [2019-10-02 14:27:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:54,331 INFO L475 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2019-10-02 14:27:54,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2019-10-02 14:27:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 14:27:54,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:54,334 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:54,335 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2991053, now seen corresponding path program 1 times [2019-10-02 14:27:54,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:54,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:54,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:54,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:54,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:54,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:54,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:54,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:54,635 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2019-10-02 14:27:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:27:56,509 INFO L93 Difference]: Finished difference Result 16114 states and 24453 transitions. [2019-10-02 14:27:56,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:27:56,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-02 14:27:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:27:56,537 INFO L225 Difference]: With dead ends: 16114 [2019-10-02 14:27:56,537 INFO L226 Difference]: Without dead ends: 8066 [2019-10-02 14:27:56,554 INFO L640 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-10-02 14:27:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-10-02 14:27:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 8064. [2019-10-02 14:27:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-10-02 14:27:56,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 12234 transitions. [2019-10-02 14:27:56,703 INFO L78 Accepts]: Start accepts. Automaton has 8064 states and 12234 transitions. Word has length 26 [2019-10-02 14:27:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:27:56,703 INFO L475 AbstractCegarLoop]: Abstraction has 8064 states and 12234 transitions. [2019-10-02 14:27:56,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:27:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8064 states and 12234 transitions. [2019-10-02 14:27:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-02 14:27:56,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:27:56,707 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:27:56,707 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:27:56,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:27:56,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1847963214, now seen corresponding path program 1 times [2019-10-02 14:27:56,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:27:56,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:27:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:27:56,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:27:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:27:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:27:56,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:27:56,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:27:56,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:27:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:27:56,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:27:56,791 INFO L87 Difference]: Start difference. First operand 8064 states and 12234 transitions. Second operand 3 states. [2019-10-02 14:28:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:01,638 INFO L93 Difference]: Finished difference Result 24168 states and 36676 transitions. [2019-10-02 14:28:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:01,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-02 14:28:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:01,674 INFO L225 Difference]: With dead ends: 24168 [2019-10-02 14:28:01,674 INFO L226 Difference]: Without dead ends: 16068 [2019-10-02 14:28:01,690 INFO L640 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-10-02 14:28:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2019-10-02 14:28:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14810. [2019-10-02 14:28:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2019-10-02 14:28:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 23046 transitions. [2019-10-02 14:28:01,974 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 23046 transitions. Word has length 27 [2019-10-02 14:28:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:01,976 INFO L475 AbstractCegarLoop]: Abstraction has 14810 states and 23046 transitions. [2019-10-02 14:28:01,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 23046 transitions. [2019-10-02 14:28:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-02 14:28:01,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:01,979 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:01,979 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1901804161, now seen corresponding path program 1 times [2019-10-02 14:28:01,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:01,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:01,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:01,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:02,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:02,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:02,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:02,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:02,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:02,058 INFO L87 Difference]: Start difference. First operand 14810 states and 23046 transitions. Second operand 3 states. [2019-10-02 14:28:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:09,119 INFO L93 Difference]: Finished difference Result 37340 states and 57908 transitions. [2019-10-02 14:28:09,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:09,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-02 14:28:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:09,158 INFO L225 Difference]: With dead ends: 37340 [2019-10-02 14:28:09,159 INFO L226 Difference]: Without dead ends: 22270 [2019-10-02 14:28:09,190 INFO L640 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-10-02 14:28:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2019-10-02 14:28:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 21076. [2019-10-02 14:28:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-10-02 14:28:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 32688 transitions. [2019-10-02 14:28:09,572 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 32688 transitions. Word has length 29 [2019-10-02 14:28:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:09,574 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 32688 transitions. [2019-10-02 14:28:09,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 32688 transitions. [2019-10-02 14:28:09,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:28:09,580 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:09,580 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:09,580 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:09,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1134426699, now seen corresponding path program 1 times [2019-10-02 14:28:09,581 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:09,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:09,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:09,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:09,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:09,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:09,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:09,648 INFO L87 Difference]: Start difference. First operand 21076 states and 32688 transitions. Second operand 3 states. [2019-10-02 14:28:17,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:17,993 INFO L93 Difference]: Finished difference Result 63174 states and 97978 transitions. [2019-10-02 14:28:17,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:17,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-02 14:28:17,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:18,078 INFO L225 Difference]: With dead ends: 63174 [2019-10-02 14:28:18,079 INFO L226 Difference]: Without dead ends: 42110 [2019-10-02 14:28:18,103 INFO L640 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-10-02 14:28:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2019-10-02 14:28:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 40084. [2019-10-02 14:28:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2019-10-02 14:28:18,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 63062 transitions. [2019-10-02 14:28:18,735 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 63062 transitions. Word has length 34 [2019-10-02 14:28:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:18,736 INFO L475 AbstractCegarLoop]: Abstraction has 40084 states and 63062 transitions. [2019-10-02 14:28:18,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 63062 transitions. [2019-10-02 14:28:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:28:18,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:18,737 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:18,738 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash -435466128, now seen corresponding path program 1 times [2019-10-02 14:28:18,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:18,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:18,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:18,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:18,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:18,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:18,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:18,804 INFO L87 Difference]: Start difference. First operand 40084 states and 63062 transitions. Second operand 3 states. [2019-10-02 14:28:23,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:23,787 INFO L93 Difference]: Finished difference Result 107946 states and 170048 transitions. [2019-10-02 14:28:23,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:23,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 14:28:23,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:23,917 INFO L225 Difference]: With dead ends: 107946 [2019-10-02 14:28:23,918 INFO L226 Difference]: Without dead ends: 67826 [2019-10-02 14:28:23,974 INFO L640 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-10-02 14:28:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2019-10-02 14:28:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 66152. [2019-10-02 14:28:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66152 states. [2019-10-02 14:28:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66152 states to 66152 states and 104782 transitions. [2019-10-02 14:28:24,972 INFO L78 Accepts]: Start accepts. Automaton has 66152 states and 104782 transitions. Word has length 43 [2019-10-02 14:28:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:24,973 INFO L475 AbstractCegarLoop]: Abstraction has 66152 states and 104782 transitions. [2019-10-02 14:28:24,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 66152 states and 104782 transitions. [2019-10-02 14:28:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 14:28:24,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:24,974 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:24,975 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:24,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1631732678, now seen corresponding path program 1 times [2019-10-02 14:28:24,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:24,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:28:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:25,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:25,050 INFO L87 Difference]: Start difference. First operand 66152 states and 104782 transitions. Second operand 3 states. [2019-10-02 14:28:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:27,105 INFO L93 Difference]: Finished difference Result 132344 states and 209622 transitions. [2019-10-02 14:28:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:27,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 14:28:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:27,224 INFO L225 Difference]: With dead ends: 132344 [2019-10-02 14:28:27,225 INFO L226 Difference]: Without dead ends: 66204 [2019-10-02 14:28:27,305 INFO L640 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-10-02 14:28:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66204 states. [2019-10-02 14:28:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66204 to 66202. [2019-10-02 14:28:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66202 states. [2019-10-02 14:28:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66202 states to 66202 states and 104832 transitions. [2019-10-02 14:28:30,872 INFO L78 Accepts]: Start accepts. Automaton has 66202 states and 104832 transitions. Word has length 47 [2019-10-02 14:28:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:30,873 INFO L475 AbstractCegarLoop]: Abstraction has 66202 states and 104832 transitions. [2019-10-02 14:28:30,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:30,873 INFO L276 IsEmpty]: Start isEmpty. Operand 66202 states and 104832 transitions. [2019-10-02 14:28:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 14:28:30,874 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:30,874 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:30,874 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1561932951, now seen corresponding path program 1 times [2019-10-02 14:28:30,875 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:30,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:30,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:30,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:31,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:31,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:28:31,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:28:31,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:28:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:28:31,035 INFO L87 Difference]: Start difference. First operand 66202 states and 104832 transitions. Second operand 4 states. [2019-10-02 14:28:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:39,404 INFO L93 Difference]: Finished difference Result 126789 states and 200689 transitions. [2019-10-02 14:28:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:28:39,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-02 14:28:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:39,490 INFO L225 Difference]: With dead ends: 126789 [2019-10-02 14:28:39,490 INFO L226 Difference]: Without dead ends: 66496 [2019-10-02 14:28:39,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:28:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66496 states. [2019-10-02 14:28:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66496 to 63922. [2019-10-02 14:28:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63922 states. [2019-10-02 14:28:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63922 states to 63922 states and 99852 transitions. [2019-10-02 14:28:40,163 INFO L78 Accepts]: Start accepts. Automaton has 63922 states and 99852 transitions. Word has length 56 [2019-10-02 14:28:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:40,163 INFO L475 AbstractCegarLoop]: Abstraction has 63922 states and 99852 transitions. [2019-10-02 14:28:40,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:28:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63922 states and 99852 transitions. [2019-10-02 14:28:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-02 14:28:40,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:40,165 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:40,165 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:40,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1199471434, now seen corresponding path program 1 times [2019-10-02 14:28:40,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:40,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:40,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:40,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:40,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:28:40,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:40,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:40,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:40,229 INFO L87 Difference]: Start difference. First operand 63922 states and 99852 transitions. Second operand 3 states. [2019-10-02 14:28:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:44,013 INFO L93 Difference]: Finished difference Result 127894 states and 199782 transitions. [2019-10-02 14:28:44,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:44,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-10-02 14:28:44,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:44,092 INFO L225 Difference]: With dead ends: 127894 [2019-10-02 14:28:44,093 INFO L226 Difference]: Without dead ends: 63984 [2019-10-02 14:28:44,139 INFO L640 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-10-02 14:28:44,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63984 states. [2019-10-02 14:28:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63984 to 63982. [2019-10-02 14:28:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63982 states. [2019-10-02 14:28:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63982 states to 63982 states and 99912 transitions. [2019-10-02 14:28:44,726 INFO L78 Accepts]: Start accepts. Automaton has 63982 states and 99912 transitions. Word has length 57 [2019-10-02 14:28:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:44,726 INFO L475 AbstractCegarLoop]: Abstraction has 63982 states and 99912 transitions. [2019-10-02 14:28:44,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 63982 states and 99912 transitions. [2019-10-02 14:28:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-02 14:28:44,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:44,727 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:44,728 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash 384994183, now seen corresponding path program 1 times [2019-10-02 14:28:44,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:44,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:44,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:44,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:28:44,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:44,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:28:44,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:28:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:28:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:28:44,811 INFO L87 Difference]: Start difference. First operand 63982 states and 99912 transitions. Second operand 4 states. [2019-10-02 14:28:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:51,210 INFO L93 Difference]: Finished difference Result 116802 states and 181842 transitions. [2019-10-02 14:28:51,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:51,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-02 14:28:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:51,291 INFO L225 Difference]: With dead ends: 116802 [2019-10-02 14:28:51,292 INFO L226 Difference]: Without dead ends: 64992 [2019-10-02 14:28:51,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:28:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64992 states. [2019-10-02 14:28:51,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64992 to 63726. [2019-10-02 14:28:51,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63726 states. [2019-10-02 14:28:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 98888 transitions. [2019-10-02 14:28:51,967 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 98888 transitions. Word has length 62 [2019-10-02 14:28:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:51,968 INFO L475 AbstractCegarLoop]: Abstraction has 63726 states and 98888 transitions. [2019-10-02 14:28:51,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:28:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 98888 transitions. [2019-10-02 14:28:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 14:28:51,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:51,969 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:51,969 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:51,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:51,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1635374980, now seen corresponding path program 1 times [2019-10-02 14:28:51,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:51,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:51,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:51,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:52,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:52,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:52,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:52,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:52,055 INFO L87 Difference]: Start difference. First operand 63726 states and 98888 transitions. Second operand 3 states. [2019-10-02 14:28:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:28:58,479 INFO L93 Difference]: Finished difference Result 129854 states and 200368 transitions. [2019-10-02 14:28:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:28:58,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-02 14:28:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:28:58,560 INFO L225 Difference]: With dead ends: 129854 [2019-10-02 14:28:58,560 INFO L226 Difference]: Without dead ends: 66100 [2019-10-02 14:28:58,613 INFO L640 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-10-02 14:28:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66100 states. [2019-10-02 14:28:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66100 to 63406. [2019-10-02 14:28:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63406 states. [2019-10-02 14:28:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63406 states to 63406 states and 98168 transitions. [2019-10-02 14:28:59,240 INFO L78 Accepts]: Start accepts. Automaton has 63406 states and 98168 transitions. Word has length 68 [2019-10-02 14:28:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:28:59,240 INFO L475 AbstractCegarLoop]: Abstraction has 63406 states and 98168 transitions. [2019-10-02 14:28:59,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:28:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 63406 states and 98168 transitions. [2019-10-02 14:28:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-02 14:28:59,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:28:59,242 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:28:59,242 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:28:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:28:59,243 INFO L82 PathProgramCache]: Analyzing trace with hash -885532883, now seen corresponding path program 1 times [2019-10-02 14:28:59,243 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:28:59,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:28:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:59,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:28:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:28:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:28:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:28:59,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:28:59,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:28:59,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:28:59,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:28:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:28:59,345 INFO L87 Difference]: Start difference. First operand 63406 states and 98168 transitions. Second operand 3 states. [2019-10-02 14:29:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:06,336 INFO L93 Difference]: Finished difference Result 91362 states and 140322 transitions. [2019-10-02 14:29:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:06,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-10-02 14:29:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:06,415 INFO L225 Difference]: With dead ends: 91362 [2019-10-02 14:29:06,415 INFO L226 Difference]: Without dead ends: 64712 [2019-10-02 14:29:06,444 INFO L640 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-10-02 14:29:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64712 states. [2019-10-02 14:29:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64712 to 63414. [2019-10-02 14:29:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63414 states. [2019-10-02 14:29:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 98096 transitions. [2019-10-02 14:29:07,029 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 98096 transitions. Word has length 78 [2019-10-02 14:29:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:07,030 INFO L475 AbstractCegarLoop]: Abstraction has 63414 states and 98096 transitions. [2019-10-02 14:29:07,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:07,030 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 98096 transitions. [2019-10-02 14:29:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 14:29:07,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:07,032 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:07,032 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1721025228, now seen corresponding path program 1 times [2019-10-02 14:29:07,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:07,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:07,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:29:07,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:07,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:07,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:07,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:07,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:07,112 INFO L87 Difference]: Start difference. First operand 63414 states and 98096 transitions. Second operand 3 states. [2019-10-02 14:29:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:08,678 INFO L93 Difference]: Finished difference Result 121049 states and 187242 transitions. [2019-10-02 14:29:08,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:08,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-02 14:29:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:08,753 INFO L225 Difference]: With dead ends: 121049 [2019-10-02 14:29:08,753 INFO L226 Difference]: Without dead ends: 57647 [2019-10-02 14:29:08,807 INFO L640 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-10-02 14:29:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2019-10-02 14:29:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 57645. [2019-10-02 14:29:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57645 states. [2019-10-02 14:29:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57645 states to 57645 states and 89118 transitions. [2019-10-02 14:29:09,986 INFO L78 Accepts]: Start accepts. Automaton has 57645 states and 89118 transitions. Word has length 85 [2019-10-02 14:29:09,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:09,987 INFO L475 AbstractCegarLoop]: Abstraction has 57645 states and 89118 transitions. [2019-10-02 14:29:09,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 57645 states and 89118 transitions. [2019-10-02 14:29:09,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 14:29:09,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:09,988 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:09,988 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1640423976, now seen corresponding path program 1 times [2019-10-02 14:29:09,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:29:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:10,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:10,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:10,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:10,105 INFO L87 Difference]: Start difference. First operand 57645 states and 89118 transitions. Second operand 3 states. [2019-10-02 14:29:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:11,855 INFO L93 Difference]: Finished difference Result 114970 states and 177752 transitions. [2019-10-02 14:29:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:11,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-02 14:29:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:11,951 INFO L225 Difference]: With dead ends: 114970 [2019-10-02 14:29:11,951 INFO L226 Difference]: Without dead ends: 57727 [2019-10-02 14:29:12,006 INFO L640 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-10-02 14:29:12,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57727 states. [2019-10-02 14:29:12,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57727 to 57725. [2019-10-02 14:29:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57725 states. [2019-10-02 14:29:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57725 states to 57725 states and 89198 transitions. [2019-10-02 14:29:12,552 INFO L78 Accepts]: Start accepts. Automaton has 57725 states and 89198 transitions. Word has length 88 [2019-10-02 14:29:12,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:12,552 INFO L475 AbstractCegarLoop]: Abstraction has 57725 states and 89198 transitions. [2019-10-02 14:29:12,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 57725 states and 89198 transitions. [2019-10-02 14:29:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 14:29:12,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:12,554 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:12,554 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1152445607, now seen corresponding path program 1 times [2019-10-02 14:29:12,555 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:12,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:12,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:12,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:12,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:29:12,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:12,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:29:12,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:29:12,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:29:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:12,729 INFO L87 Difference]: Start difference. First operand 57725 states and 89198 transitions. Second operand 4 states. [2019-10-02 14:29:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:19,584 INFO L93 Difference]: Finished difference Result 82683 states and 126801 transitions. [2019-10-02 14:29:19,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:29:19,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 14:29:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:19,626 INFO L225 Difference]: With dead ends: 82683 [2019-10-02 14:29:19,626 INFO L226 Difference]: Without dead ends: 36324 [2019-10-02 14:29:19,658 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36324 states. [2019-10-02 14:29:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36324 to 35103. [2019-10-02 14:29:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35103 states. [2019-10-02 14:29:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35103 states to 35103 states and 53663 transitions. [2019-10-02 14:29:19,973 INFO L78 Accepts]: Start accepts. Automaton has 35103 states and 53663 transitions. Word has length 92 [2019-10-02 14:29:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:19,974 INFO L475 AbstractCegarLoop]: Abstraction has 35103 states and 53663 transitions. [2019-10-02 14:29:19,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:29:19,974 INFO L276 IsEmpty]: Start isEmpty. Operand 35103 states and 53663 transitions. [2019-10-02 14:29:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 14:29:19,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:19,976 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:19,976 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:19,977 INFO L82 PathProgramCache]: Analyzing trace with hash 956074825, now seen corresponding path program 1 times [2019-10-02 14:29:19,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:19,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:20,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:29:20,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:29:20,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:29:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:29:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:20,156 INFO L87 Difference]: Start difference. First operand 35103 states and 53663 transitions. Second operand 4 states. [2019-10-02 14:29:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:26,964 INFO L93 Difference]: Finished difference Result 48761 states and 73546 transitions. [2019-10-02 14:29:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:29:26,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-02 14:29:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:26,995 INFO L225 Difference]: With dead ends: 48761 [2019-10-02 14:29:26,995 INFO L226 Difference]: Without dead ends: 25024 [2019-10-02 14:29:27,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-10-02 14:29:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 23803. [2019-10-02 14:29:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23803 states. [2019-10-02 14:29:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 36003 transitions. [2019-10-02 14:29:27,583 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 36003 transitions. Word has length 94 [2019-10-02 14:29:27,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:27,584 INFO L475 AbstractCegarLoop]: Abstraction has 23803 states and 36003 transitions. [2019-10-02 14:29:27,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:29:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 36003 transitions. [2019-10-02 14:29:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 14:29:27,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:27,585 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:27,585 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1811539215, now seen corresponding path program 1 times [2019-10-02 14:29:27,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:27,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:27,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:27,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:29:27,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:27,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:27,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:27,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:27,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:27,667 INFO L87 Difference]: Start difference. First operand 23803 states and 36003 transitions. Second operand 3 states. [2019-10-02 14:29:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:29,142 INFO L93 Difference]: Finished difference Result 24582 states and 37124 transitions. [2019-10-02 14:29:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:29,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-02 14:29:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:29,172 INFO L225 Difference]: With dead ends: 24582 [2019-10-02 14:29:29,172 INFO L226 Difference]: Without dead ends: 24580 [2019-10-02 14:29:29,179 INFO L640 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-10-02 14:29:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24580 states. [2019-10-02 14:29:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24580 to 24574. [2019-10-02 14:29:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24574 states. [2019-10-02 14:29:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24574 states to 24574 states and 37110 transitions. [2019-10-02 14:29:29,464 INFO L78 Accepts]: Start accepts. Automaton has 24574 states and 37110 transitions. Word has length 102 [2019-10-02 14:29:29,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:29,465 INFO L475 AbstractCegarLoop]: Abstraction has 24574 states and 37110 transitions. [2019-10-02 14:29:29,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 24574 states and 37110 transitions. [2019-10-02 14:29:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 14:29:29,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:29,469 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:29,469 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:29,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:29,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1861245991, now seen corresponding path program 1 times [2019-10-02 14:29:29,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:29,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:29,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:29:29,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:29,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:29:29,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:29:29,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:29:29,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:29,698 INFO L87 Difference]: Start difference. First operand 24574 states and 37110 transitions. Second operand 4 states. [2019-10-02 14:29:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:36,288 INFO L93 Difference]: Finished difference Result 55842 states and 84130 transitions. [2019-10-02 14:29:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:29:36,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 14:29:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:36,326 INFO L225 Difference]: With dead ends: 55842 [2019-10-02 14:29:36,326 INFO L226 Difference]: Without dead ends: 31210 [2019-10-02 14:29:36,351 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31210 states. [2019-10-02 14:29:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31210 to 30071. [2019-10-02 14:29:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30071 states. [2019-10-02 14:29:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30071 states to 30071 states and 45357 transitions. [2019-10-02 14:29:36,970 INFO L78 Accepts]: Start accepts. Automaton has 30071 states and 45357 transitions. Word has length 116 [2019-10-02 14:29:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:36,971 INFO L475 AbstractCegarLoop]: Abstraction has 30071 states and 45357 transitions. [2019-10-02 14:29:36,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:29:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 30071 states and 45357 transitions. [2019-10-02 14:29:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-02 14:29:36,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:36,975 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:36,975 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash 316824858, now seen corresponding path program 1 times [2019-10-02 14:29:36,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:36,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:36,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:36,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:36,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 14:29:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:37,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:37,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:37,056 INFO L87 Difference]: Start difference. First operand 30071 states and 45357 transitions. Second operand 3 states. [2019-10-02 14:29:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:38,263 INFO L93 Difference]: Finished difference Result 53870 states and 81136 transitions. [2019-10-02 14:29:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:38,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-10-02 14:29:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:38,293 INFO L225 Difference]: With dead ends: 53870 [2019-10-02 14:29:38,294 INFO L226 Difference]: Without dead ends: 25145 [2019-10-02 14:29:38,318 INFO L640 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-10-02 14:29:38,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25145 states. [2019-10-02 14:29:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25145 to 25143. [2019-10-02 14:29:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25143 states. [2019-10-02 14:29:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25143 states to 25143 states and 37691 transitions. [2019-10-02 14:29:38,572 INFO L78 Accepts]: Start accepts. Automaton has 25143 states and 37691 transitions. Word has length 118 [2019-10-02 14:29:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:38,572 INFO L475 AbstractCegarLoop]: Abstraction has 25143 states and 37691 transitions. [2019-10-02 14:29:38,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 25143 states and 37691 transitions. [2019-10-02 14:29:38,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 14:29:38,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:38,576 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:38,576 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:38,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1013835941, now seen corresponding path program 1 times [2019-10-02 14:29:38,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:38,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:38,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:38,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:38,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:38,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:38,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:38,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:38,674 INFO L87 Difference]: Start difference. First operand 25143 states and 37691 transitions. Second operand 3 states. [2019-10-02 14:29:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:39,766 INFO L93 Difference]: Finished difference Result 46648 states and 70049 transitions. [2019-10-02 14:29:39,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:39,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-02 14:29:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:39,792 INFO L225 Difference]: With dead ends: 46648 [2019-10-02 14:29:39,792 INFO L226 Difference]: Without dead ends: 23039 [2019-10-02 14:29:39,814 INFO L640 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-10-02 14:29:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23039 states. [2019-10-02 14:29:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23039 to 23037. [2019-10-02 14:29:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23037 states. [2019-10-02 14:29:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23037 states to 23037 states and 34538 transitions. [2019-10-02 14:29:40,023 INFO L78 Accepts]: Start accepts. Automaton has 23037 states and 34538 transitions. Word has length 140 [2019-10-02 14:29:40,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:40,023 INFO L475 AbstractCegarLoop]: Abstraction has 23037 states and 34538 transitions. [2019-10-02 14:29:40,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:40,024 INFO L276 IsEmpty]: Start isEmpty. Operand 23037 states and 34538 transitions. [2019-10-02 14:29:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 14:29:40,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:40,026 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:40,027 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:40,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 979116920, now seen corresponding path program 1 times [2019-10-02 14:29:40,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:40,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:40,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:40,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:40,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:40,113 INFO L87 Difference]: Start difference. First operand 23037 states and 34538 transitions. Second operand 3 states. [2019-10-02 14:29:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:41,195 INFO L93 Difference]: Finished difference Result 39219 states and 58830 transitions. [2019-10-02 14:29:41,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:41,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-02 14:29:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:41,215 INFO L225 Difference]: With dead ends: 39219 [2019-10-02 14:29:41,216 INFO L226 Difference]: Without dead ends: 18292 [2019-10-02 14:29:41,234 INFO L640 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-10-02 14:29:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2019-10-02 14:29:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 18290. [2019-10-02 14:29:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2019-10-02 14:29:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 27306 transitions. [2019-10-02 14:29:41,398 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 27306 transitions. Word has length 142 [2019-10-02 14:29:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:41,399 INFO L475 AbstractCegarLoop]: Abstraction has 18290 states and 27306 transitions. [2019-10-02 14:29:41,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 27306 transitions. [2019-10-02 14:29:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 14:29:41,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:41,401 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:41,401 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash 81750322, now seen corresponding path program 1 times [2019-10-02 14:29:41,401 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:41,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:41,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:41,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:41,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 14:29:41,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:41,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 14:29:41,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:29:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:29:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:41,577 INFO L87 Difference]: Start difference. First operand 18290 states and 27306 transitions. Second operand 4 states. [2019-10-02 14:29:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:44,766 INFO L93 Difference]: Finished difference Result 18300 states and 27314 transitions. [2019-10-02 14:29:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:29:44,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-10-02 14:29:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:44,786 INFO L225 Difference]: With dead ends: 18300 [2019-10-02 14:29:44,786 INFO L226 Difference]: Without dead ends: 18230 [2019-10-02 14:29:44,789 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:29:44,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18230 states. [2019-10-02 14:29:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18230 to 12908. [2019-10-02 14:29:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2019-10-02 14:29:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 18998 transitions. [2019-10-02 14:29:44,928 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 18998 transitions. Word has length 146 [2019-10-02 14:29:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:44,928 INFO L475 AbstractCegarLoop]: Abstraction has 12908 states and 18998 transitions. [2019-10-02 14:29:44,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:29:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 18998 transitions. [2019-10-02 14:29:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 14:29:44,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:44,930 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:44,931 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 613887253, now seen corresponding path program 1 times [2019-10-02 14:29:44,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:44,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:45,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:45,023 INFO L87 Difference]: Start difference. First operand 12908 states and 18998 transitions. Second operand 3 states. [2019-10-02 14:29:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:46,176 INFO L93 Difference]: Finished difference Result 23254 states and 34305 transitions. [2019-10-02 14:29:46,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:46,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-02 14:29:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:46,190 INFO L225 Difference]: With dead ends: 23254 [2019-10-02 14:29:46,190 INFO L226 Difference]: Without dead ends: 12275 [2019-10-02 14:29:46,201 INFO L640 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-10-02 14:29:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-10-02 14:29:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 12273. [2019-10-02 14:29:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12273 states. [2019-10-02 14:29:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12273 states to 12273 states and 18048 transitions. [2019-10-02 14:29:46,321 INFO L78 Accepts]: Start accepts. Automaton has 12273 states and 18048 transitions. Word has length 148 [2019-10-02 14:29:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:46,321 INFO L475 AbstractCegarLoop]: Abstraction has 12273 states and 18048 transitions. [2019-10-02 14:29:46,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 12273 states and 18048 transitions. [2019-10-02 14:29:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:29:46,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:46,324 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:46,325 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -398003814, now seen corresponding path program 1 times [2019-10-02 14:29:46,325 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:46,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:46,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:46,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:46,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:46,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:46,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:46,412 INFO L87 Difference]: Start difference. First operand 12273 states and 18048 transitions. Second operand 3 states. [2019-10-02 14:29:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:47,502 INFO L93 Difference]: Finished difference Result 22649 states and 33379 transitions. [2019-10-02 14:29:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:47,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 14:29:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:47,518 INFO L225 Difference]: With dead ends: 22649 [2019-10-02 14:29:47,518 INFO L226 Difference]: Without dead ends: 12305 [2019-10-02 14:29:47,529 INFO L640 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-10-02 14:29:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12305 states. [2019-10-02 14:29:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12305 to 12303. [2019-10-02 14:29:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-10-02 14:29:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 18078 transitions. [2019-10-02 14:29:47,642 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 18078 transitions. Word has length 152 [2019-10-02 14:29:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:47,642 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 18078 transitions. [2019-10-02 14:29:47,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 18078 transitions. [2019-10-02 14:29:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 14:29:47,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:47,645 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:47,645 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:47,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:47,645 INFO L82 PathProgramCache]: Analyzing trace with hash 937599923, now seen corresponding path program 1 times [2019-10-02 14:29:47,645 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:47,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:47,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:47,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:47,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:47,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:47,743 INFO L87 Difference]: Start difference. First operand 12303 states and 18078 transitions. Second operand 3 states. [2019-10-02 14:29:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:48,582 INFO L93 Difference]: Finished difference Result 20377 states and 30019 transitions. [2019-10-02 14:29:48,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:48,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-10-02 14:29:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:48,593 INFO L225 Difference]: With dead ends: 20377 [2019-10-02 14:29:48,593 INFO L226 Difference]: Without dead ends: 10003 [2019-10-02 14:29:48,602 INFO L640 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-10-02 14:29:48,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10003 states. [2019-10-02 14:29:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10003 to 10001. [2019-10-02 14:29:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10001 states. [2019-10-02 14:29:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10001 states to 10001 states and 14680 transitions. [2019-10-02 14:29:48,691 INFO L78 Accepts]: Start accepts. Automaton has 10001 states and 14680 transitions. Word has length 182 [2019-10-02 14:29:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:48,692 INFO L475 AbstractCegarLoop]: Abstraction has 10001 states and 14680 transitions. [2019-10-02 14:29:48,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 10001 states and 14680 transitions. [2019-10-02 14:29:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 14:29:48,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:48,694 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:48,695 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:48,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash -624398577, now seen corresponding path program 1 times [2019-10-02 14:29:48,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:29:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:29:48,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:29:48,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:29:48,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:29:48,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:29:48,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:29:48,788 INFO L87 Difference]: Start difference. First operand 10001 states and 14680 transitions. Second operand 3 states. [2019-10-02 14:29:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:29:49,113 INFO L93 Difference]: Finished difference Result 10403 states and 15241 transitions. [2019-10-02 14:29:49,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:29:49,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-02 14:29:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:29:49,117 INFO L225 Difference]: With dead ends: 10403 [2019-10-02 14:29:49,117 INFO L226 Difference]: Without dead ends: 2337 [2019-10-02 14:29:49,126 INFO L640 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-10-02 14:29:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-10-02 14:29:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2019-10-02 14:29:49,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-10-02 14:29:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3315 transitions. [2019-10-02 14:29:49,155 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3315 transitions. Word has length 187 [2019-10-02 14:29:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:29:49,155 INFO L475 AbstractCegarLoop]: Abstraction has 2335 states and 3315 transitions. [2019-10-02 14:29:49,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:29:49,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3315 transitions. [2019-10-02 14:29:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 14:29:49,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:29:49,160 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:29:49,160 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:29:49,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:29:49,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1061043629, now seen corresponding path program 1 times [2019-10-02 14:29:49,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:29:49,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:29:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:49,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:29:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:29:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 14:29:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-02 14:29:49,582 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-02 14:29:49,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 02:29:49 BoogieIcfgContainer [2019-10-02 14:29:49,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 14:29:49,788 INFO L168 Benchmark]: Toolchain (without parser) took 151733.17 ms. Allocated memory was 172.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.8 MB in the beginning and 739.8 MB in the end (delta: -638.0 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,789 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3597.45 ms. Allocated memory was 172.5 MB in the beginning and 467.1 MB in the end (delta: 294.6 MB). Free memory was 101.8 MB in the beginning and 198.9 MB in the end (delta: -97.1 MB). Peak memory consumption was 302.4 MB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,790 INFO L168 Benchmark]: Boogie Preprocessor took 1092.81 ms. Allocated memory is still 467.1 MB. Free memory was 198.9 MB in the beginning and 62.8 MB in the end (delta: 136.0 MB). Peak memory consumption was 136.0 MB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,791 INFO L168 Benchmark]: RCFGBuilder took 19286.03 ms. Allocated memory was 467.1 MB in the beginning and 1.1 GB in the end (delta: 605.6 MB). Free memory was 62.8 MB in the beginning and 427.0 MB in the end (delta: -364.1 MB). Peak memory consumption was 428.5 MB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,792 INFO L168 Benchmark]: TraceAbstraction took 127751.94 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 427.0 MB in the beginning and 739.8 MB in the end (delta: -312.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 14:29:49,796 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.50 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3597.45 ms. Allocated memory was 172.5 MB in the beginning and 467.1 MB in the end (delta: 294.6 MB). Free memory was 101.8 MB in the beginning and 198.9 MB in the end (delta: -97.1 MB). Peak memory consumption was 302.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1092.81 ms. Allocated memory is still 467.1 MB. Free memory was 198.9 MB in the beginning and 62.8 MB in the end (delta: 136.0 MB). Peak memory consumption was 136.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 19286.03 ms. Allocated memory was 467.1 MB in the beginning and 1.1 GB in the end (delta: 605.6 MB). Free memory was 62.8 MB in the beginning and 427.0 MB in the end (delta: -364.1 MB). Peak memory consumption was 428.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127751.94 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 427.0 MB in the beginning and 739.8 MB in the end (delta: -312.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 49138]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L5] int m_getInetAddress = 1; [L6] int m_getOOBInline = 2; [L7] int m_getLocalPort = 3; [L8] int m_isInputShutdown = 4; [L9] int m_setTcpNoDelay = 5; [L10] int m_isConnected = 6; [L11] int m_getKeepAlive = 7; [L12] int m_getLocalAddress = 8; [L13] int m_bind = 9; [L14] int m_getChannel = 10; [L15] int m_getSoLinger = 11; [L16] int m_getImpl = 12; [L17] int m_getTcpNoDelay = 13; [L18] int m_getSoTimeout = 14; [L19] int m_isOutputShutdown = 15; [L20] int m_postAccept = 16; [L21] int m_close = 17; [L22] int m_setOOBInline = 18; [L23] int m_getLocalSocketAddress = 19; [L24] int m_getReceiveBufferSize = 20; [L25] int m_setReuseAddress = 21; [L26] int m_getTrafficClass = 22; [L27] int m_getReuseAddress = 23; [L28] int m_createImpl = 24; [L29] int m_setCreated = 25; [L30] int m_setKeepAlive = 26; [L31] int m_getInputStream = 27; [L32] int m_shutdownOutput = 28; [L33] int m_shutdownInput = 29; [L34] int m_setPerformancePreferences = 30; [L35] int m_getPort = 31; [L36] int m_sendUrgentData = 32; [L37] int m_isClosed = 33; [L38] int m_isBound = 34; [L39] int m_setBound = 35; [L40] int m_getSendBufferSize = 36; [L41] int m_getOutputStream = 37; [L42] int m_setConnected = 38; [L43] int m_Socket = 39; [L44] int m_getRemoteSocketAddress = 40; [L45] int m_setReceiveBufferSize_1 = 41; [L46] int m_setReceiveBufferSize_2 = 42; [L47] int m_connect2_1 = 43; [L48] int m_connect2_2 = 44; [L49] int m_setSoLinger_1 = 45; [L50] int m_setSoLinger_2 = 46; [L51] int m_connect1_1 = 47; [L52] int m_connect1_2 = 48; [L53] int m_setTrafficClass_1 = 49; [L54] int m_setTrafficClass_2 = 50; [L55] int m_setSoTimeout_1 = 51; [L56] int m_setSoTimeout_2 = 52; [L57] int m_setSendBufferSize_1 = 53; [L58] int m_setSendBufferSize_2 = 54; [L59] int m_setSocketImplFactory_1 = 55; [L60] int m_setSocketImplFactory_2 = 56; VAL [\old(m_bind)=26, \old(m_close)=52, \old(m_connect1_1)=28, \old(m_connect1_2)=45, \old(m_connect2_1)=17, \old(m_connect2_2)=22, \old(m_createImpl)=13, \old(m_getChannel)=46, \old(m_getImpl)=36, \old(m_getInetAddress)=7, \old(m_getInputStream)=6, \old(m_getKeepAlive)=33, \old(m_getLocalAddress)=38, \old(m_getLocalPort)=15, \old(m_getLocalSocketAddress)=48, \old(m_getOOBInline)=4, \old(m_getOutputStream)=42, \old(m_getPort)=25, \old(m_getReceiveBufferSize)=9, \old(m_getRemoteSocketAddress)=10, \old(m_getReuseAddress)=56, \old(m_getSendBufferSize)=21, \old(m_getSoLinger)=53, \old(m_getSoTimeout)=47, \old(m_getTcpNoDelay)=34, \old(m_getTrafficClass)=39, \old(m_isBound)=11, \old(m_isClosed)=5, \old(m_isConnected)=8, \old(m_isInputShutdown)=20, \old(m_isOutputShutdown)=31, \old(m_postAccept)=37, \old(m_sendUrgentData)=29, \old(m_setBound)=14, \old(m_setConnected)=27, \old(m_setCreated)=49, \old(m_setKeepAlive)=40, \old(m_setOOBInline)=23, \old(m_setPerformancePreferences)=43, \old(m_setReceiveBufferSize_1)=35, \old(m_setReceiveBufferSize_2)=44, \old(m_setReuseAddress)=55, \old(m_setSendBufferSize_1)=19, \old(m_setSendBufferSize_2)=12, \old(m_setSocketImplFactory_1)=2, \old(m_setSocketImplFactory_2)=54, \old(m_setSoLinger_1)=57, \old(m_setSoLinger_2)=30, \old(m_setSoTimeout_1)=32, \old(m_setSoTimeout_2)=41, \old(m_setTcpNoDelay)=51, \old(m_setTrafficClass_1)=18, \old(m_setTrafficClass_2)=24, \old(m_shutdownInput)=16, \old(m_shutdownOutput)=50, \old(m_Socket)=3, m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39] [L65] int q = 0; [L66] int method_id; [L69] int this_oldImpl = 0; [L70] int this_factory = 0; [L71] int this_shutOut = 0; [L72] int this_created = 0; [L73] int this_shutIn = 0; [L74] int this_closed = 0; [L75] int this_bound = 0; [L76] int this_impl = 1; [L77] int this_connected = 0; VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, q=0, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND TRUE q == 0 [L117] COND TRUE __VERIFIER_nondet_int() [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=1, P5=1, P6=1, P7=0, P8=0, P9=0, q=0, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=1, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=0, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=0, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=0, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=0, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=0, P30=0, P4=0, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=0, P30=0, P4=0, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND TRUE __VERIFIER_nondet_int() [L2063] COND TRUE (P1 != 0) [L2065] method_id = 55 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=0, P30=0, P4=0, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L2067] COND TRUE ((this_factory != 0) && (P29 != 0)) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=0, P30=0, P4=0, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L49138] __VERIFIER_error() VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=55, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=0, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=1, P3=0, P30=0, P4=0, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 9216 locations, 1 error locations. UNSAFE Result, 127.6s OverallTime, 30 OverallIterations, 4 TraceHistogramMax, 108.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 336612 SDtfs, 238014 SDslu, 203174 SDs, 0 SdLazy, 60551 SolverSat, 23693 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 75.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66202occurred in iteration=10, 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: 15.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 22917 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2580 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2359 ConstructedInterpolants, 0 QuantifiedInterpolants, 1003712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 230/230 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...