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-112bae1 [2019-09-07 23:35:26,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 23:35:26,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 23:35:26,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 23:35:26,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 23:35:26,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 23:35:26,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 23:35:26,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 23:35:26,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 23:35:26,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 23:35:26,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 23:35:26,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 23:35:26,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 23:35:26,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 23:35:26,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 23:35:26,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 23:35:26,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 23:35:26,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 23:35:26,649 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 23:35:26,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 23:35:26,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 23:35:26,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 23:35:26,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 23:35:26,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 23:35:26,658 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 23:35:26,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 23:35:26,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 23:35:26,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 23:35:26,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 23:35:26,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 23:35:26,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 23:35:26,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 23:35:26,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 23:35:26,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 23:35:26,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 23:35:26,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 23:35:26,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 23:35:26,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 23:35:26,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 23:35:26,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 23:35:26,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 23:35:26,676 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 23:35:26,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 23:35:26,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 23:35:26,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 23:35:26,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 23:35:26,709 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 23:35:26,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 23:35:26,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 23:35:26,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 23:35:26,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 23:35:26,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 23:35:26,711 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 23:35:26,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 23:35:26,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 23:35:26,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 23:35:26,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 23:35:26,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 23:35:26,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 23:35:26,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 23:35:26,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 23:35:26,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 23:35:26,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 23:35:26,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:35:26,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 23:35:26,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 23:35:26,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 23:35:26,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 23:35:26,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 23:35:26,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 23:35:26,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 23:35:26,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 23:35:26,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 23:35:26,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 23:35:26,781 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 23:35:26,782 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 23:35:26,783 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-09-07 23:35:26,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381322694/d3bc1c7989654cb39e64628f9df8aae7/FLAG8a93680f6 [2019-09-07 23:35:28,278 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 23:35:28,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1.c [2019-09-07 23:35:28,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381322694/d3bc1c7989654cb39e64628f9df8aae7/FLAG8a93680f6 [2019-09-07 23:35:28,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/381322694/d3bc1c7989654cb39e64628f9df8aae7 [2019-09-07 23:35:28,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 23:35:28,690 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 23:35:28,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 23:35:28,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 23:35:28,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 23:35:28,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:35:28" (1/1) ... [2019-09-07 23:35:28,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50645d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:28, skipping insertion in model container [2019-09-07 23:35:28,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:35:28" (1/1) ... [2019-09-07 23:35:28,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 23:35:29,287 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 23:35:31,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:35:31,187 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 23:35:32,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 23:35:32,271 INFO L192 MainTranslator]: Completed translation [2019-09-07 23:35:32,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32 WrapperNode [2019-09-07 23:35:32,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 23:35:32,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 23:35:32,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 23:35:32,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 23:35:32,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:32,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:32,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:32,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:32,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:34,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:34,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... [2019-09-07 23:35:34,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 23:35:34,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 23:35:34,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 23:35:34,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 23:35:34,522 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 23:35:34,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 23:35:34,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 23:35:34,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 23:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 23:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 23:35:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 23:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 23:35:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 23:35:56,642 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 23:35:56,643 INFO L283 CfgBuilder]: Removed 1130 assume(true) statements. [2019-09-07 23:35:56,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:35:56 BoogieIcfgContainer [2019-09-07 23:35:56,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 23:35:56,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 23:35:56,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 23:35:56,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 23:35:56,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:35:28" (1/3) ... [2019-09-07 23:35:56,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7856eda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:35:56, skipping insertion in model container [2019-09-07 23:35:56,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:35:32" (2/3) ... [2019-09-07 23:35:56,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7856eda5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:35:56, skipping insertion in model container [2019-09-07 23:35:56,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:35:56" (3/3) ... [2019-09-07 23:35:56,657 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-09-07 23:35:56,666 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 23:35:56,676 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 23:35:56,690 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 23:35:56,759 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 23:35:56,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 23:35:56,760 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 23:35:56,760 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 23:35:56,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 23:35:56,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 23:35:56,760 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 23:35:56,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 23:35:56,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 23:35:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states. [2019-09-07 23:35:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 23:35:56,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:35:56,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:35:56,893 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:35:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:35:56,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2089661630, now seen corresponding path program 1 times [2019-09-07 23:35:56,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:35:56,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:35:56,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:56,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:35:56,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:35:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:35:57,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:35:57,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 23:35:57,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 23:35:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 23:35:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 23:35:57,232 INFO L87 Difference]: Start difference. First operand 9216 states. Second operand 2 states. [2019-09-07 23:35:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:35:57,498 INFO L93 Difference]: Finished difference Result 17704 states and 35386 transitions. [2019-09-07 23:35:57,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 23:35:57,502 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-09-07 23:35:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:35:57,569 INFO L225 Difference]: With dead ends: 17704 [2019-09-07 23:35:57,569 INFO L226 Difference]: Without dead ends: 8284 [2019-09-07 23:35:57,595 INFO L628 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-09-07 23:35:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2019-09-07 23:35:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2019-09-07 23:35:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-09-07 23:35:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 13001 transitions. [2019-09-07 23:35:57,926 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 13001 transitions. Word has length 13 [2019-09-07 23:35:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:35:57,927 INFO L475 AbstractCegarLoop]: Abstraction has 8284 states and 13001 transitions. [2019-09-07 23:35:57,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 23:35:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 13001 transitions. [2019-09-07 23:35:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-07 23:35:57,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:35:57,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:35:57,930 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:35:57,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:35:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash 886062589, now seen corresponding path program 1 times [2019-09-07 23:35:57,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:35:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:35:57,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:57,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:35:57,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:35:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:35:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:35:58,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:35:58,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:35:58,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:35:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:35:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:35:58,090 INFO L87 Difference]: Start difference. First operand 8284 states and 13001 transitions. Second operand 3 states. [2019-09-07 23:36:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:00,457 INFO L93 Difference]: Finished difference Result 16565 states and 26000 transitions. [2019-09-07 23:36:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:00,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-09-07 23:36:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:00,502 INFO L225 Difference]: With dead ends: 16565 [2019-09-07 23:36:00,502 INFO L226 Difference]: Without dead ends: 8287 [2019-09-07 23:36:00,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:00,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-09-07 23:36:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8287. [2019-09-07 23:36:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2019-09-07 23:36:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2019-09-07 23:36:00,973 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 14 [2019-09-07 23:36:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:00,973 INFO L475 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2019-09-07 23:36:00,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:00,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2019-09-07 23:36:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 23:36:00,975 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:00,975 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 23:36:00,975 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:00,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1585116607, now seen corresponding path program 1 times [2019-09-07 23:36:00,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:00,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:00,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:00,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:01,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:01,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:01,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:01,046 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand 3 states. [2019-09-07 23:36:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:03,134 INFO L93 Difference]: Finished difference Result 16460 states and 25849 transitions. [2019-09-07 23:36:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:03,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 23:36:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:03,176 INFO L225 Difference]: With dead ends: 16460 [2019-09-07 23:36:03,176 INFO L226 Difference]: Without dead ends: 8180 [2019-09-07 23:36:03,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2019-09-07 23:36:03,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2019-09-07 23:36:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2019-09-07 23:36:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12850 transitions. [2019-09-07 23:36:03,364 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12850 transitions. Word has length 19 [2019-09-07 23:36:03,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:03,365 INFO L475 AbstractCegarLoop]: Abstraction has 8180 states and 12850 transitions. [2019-09-07 23:36:03,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12850 transitions. [2019-09-07 23:36:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 23:36:03,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:03,367 INFO L399 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-09-07 23:36:03,367 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash -90884306, now seen corresponding path program 1 times [2019-09-07 23:36:03,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:03,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:03,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:03,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:03,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:03,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:03,421 INFO L87 Difference]: Start difference. First operand 8180 states and 12850 transitions. Second operand 3 states. [2019-09-07 23:36:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:08,388 INFO L93 Difference]: Finished difference Result 16268 states and 25567 transitions. [2019-09-07 23:36:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:08,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-09-07 23:36:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:08,414 INFO L225 Difference]: With dead ends: 16268 [2019-09-07 23:36:08,415 INFO L226 Difference]: Without dead ends: 8060 [2019-09-07 23:36:08,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2019-09-07 23:36:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 8060. [2019-09-07 23:36:08,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2019-09-07 23:36:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2019-09-07 23:36:08,587 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 23 [2019-09-07 23:36:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:08,587 INFO L475 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2019-09-07 23:36:08,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2019-09-07 23:36:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-07 23:36:08,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:08,597 INFO L399 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-09-07 23:36:08,597 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2991053, now seen corresponding path program 1 times [2019-09-07 23:36:08,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:08,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:08,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:08,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:08,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:08,663 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2019-09-07 23:36:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:10,857 INFO L93 Difference]: Finished difference Result 16114 states and 24453 transitions. [2019-09-07 23:36:10,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:10,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-09-07 23:36:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:10,877 INFO L225 Difference]: With dead ends: 16114 [2019-09-07 23:36:10,877 INFO L226 Difference]: Without dead ends: 8066 [2019-09-07 23:36:10,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-09-07 23:36:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 8064. [2019-09-07 23:36:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-09-07 23:36:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 12234 transitions. [2019-09-07 23:36:11,036 INFO L78 Accepts]: Start accepts. Automaton has 8064 states and 12234 transitions. Word has length 26 [2019-09-07 23:36:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:11,037 INFO L475 AbstractCegarLoop]: Abstraction has 8064 states and 12234 transitions. [2019-09-07 23:36:11,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8064 states and 12234 transitions. [2019-09-07 23:36:11,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 23:36:11,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:11,038 INFO L399 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-09-07 23:36:11,039 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1847963214, now seen corresponding path program 1 times [2019-09-07 23:36:11,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:11,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:11,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:11,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:11,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:11,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:11,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:11,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:11,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:11,101 INFO L87 Difference]: Start difference. First operand 8064 states and 12234 transitions. Second operand 3 states. [2019-09-07 23:36:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:16,404 INFO L93 Difference]: Finished difference Result 24168 states and 36676 transitions. [2019-09-07 23:36:16,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:16,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-07 23:36:16,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:16,439 INFO L225 Difference]: With dead ends: 24168 [2019-09-07 23:36:16,440 INFO L226 Difference]: Without dead ends: 16068 [2019-09-07 23:36:16,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:16,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2019-09-07 23:36:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14810. [2019-09-07 23:36:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2019-09-07 23:36:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 23046 transitions. [2019-09-07 23:36:16,702 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 23046 transitions. Word has length 27 [2019-09-07 23:36:16,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:16,703 INFO L475 AbstractCegarLoop]: Abstraction has 14810 states and 23046 transitions. [2019-09-07 23:36:16,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 23046 transitions. [2019-09-07 23:36:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-07 23:36:16,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:16,706 INFO L399 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-09-07 23:36:16,706 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:16,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:16,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1901804161, now seen corresponding path program 1 times [2019-09-07 23:36:16,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:16,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:16,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:16,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:16,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:16,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:16,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:16,786 INFO L87 Difference]: Start difference. First operand 14810 states and 23046 transitions. Second operand 3 states. [2019-09-07 23:36:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:24,843 INFO L93 Difference]: Finished difference Result 37340 states and 57908 transitions. [2019-09-07 23:36:24,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:24,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-07 23:36:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:24,883 INFO L225 Difference]: With dead ends: 37340 [2019-09-07 23:36:24,884 INFO L226 Difference]: Without dead ends: 22270 [2019-09-07 23:36:24,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:24,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2019-09-07 23:36:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 21076. [2019-09-07 23:36:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-09-07 23:36:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 32688 transitions. [2019-09-07 23:36:25,257 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 32688 transitions. Word has length 29 [2019-09-07 23:36:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:25,259 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 32688 transitions. [2019-09-07 23:36:25,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 32688 transitions. [2019-09-07 23:36:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-07 23:36:25,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:25,262 INFO L399 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-09-07 23:36:25,263 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1134426699, now seen corresponding path program 1 times [2019-09-07 23:36:25,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:25,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:25,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:25,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:25,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:25,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:25,335 INFO L87 Difference]: Start difference. First operand 21076 states and 32688 transitions. Second operand 3 states. [2019-09-07 23:36:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:33,993 INFO L93 Difference]: Finished difference Result 63174 states and 97978 transitions. [2019-09-07 23:36:33,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:33,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-07 23:36:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:34,083 INFO L225 Difference]: With dead ends: 63174 [2019-09-07 23:36:34,083 INFO L226 Difference]: Without dead ends: 42110 [2019-09-07 23:36:34,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2019-09-07 23:36:34,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 40084. [2019-09-07 23:36:34,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2019-09-07 23:36:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 63062 transitions. [2019-09-07 23:36:35,060 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 63062 transitions. Word has length 34 [2019-09-07 23:36:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:35,060 INFO L475 AbstractCegarLoop]: Abstraction has 40084 states and 63062 transitions. [2019-09-07 23:36:35,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 63062 transitions. [2019-09-07 23:36:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-07 23:36:35,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:35,062 INFO L399 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-09-07 23:36:35,062 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash -435466128, now seen corresponding path program 1 times [2019-09-07 23:36:35,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:35,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:35,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:35,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:35,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:35,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:35,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:35,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:35,130 INFO L87 Difference]: Start difference. First operand 40084 states and 63062 transitions. Second operand 3 states. [2019-09-07 23:36:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:40,491 INFO L93 Difference]: Finished difference Result 107946 states and 170048 transitions. [2019-09-07 23:36:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:40,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-07 23:36:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:40,691 INFO L225 Difference]: With dead ends: 107946 [2019-09-07 23:36:40,692 INFO L226 Difference]: Without dead ends: 67826 [2019-09-07 23:36:40,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2019-09-07 23:36:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 66152. [2019-09-07 23:36:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66152 states. [2019-09-07 23:36:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66152 states to 66152 states and 104782 transitions. [2019-09-07 23:36:41,740 INFO L78 Accepts]: Start accepts. Automaton has 66152 states and 104782 transitions. Word has length 43 [2019-09-07 23:36:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:41,740 INFO L475 AbstractCegarLoop]: Abstraction has 66152 states and 104782 transitions. [2019-09-07 23:36:41,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 66152 states and 104782 transitions. [2019-09-07 23:36:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 23:36:41,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:41,742 INFO L399 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-09-07 23:36:41,742 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1631732678, now seen corresponding path program 1 times [2019-09-07 23:36:41,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:36:41,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:41,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:41,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:41,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:41,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:41,824 INFO L87 Difference]: Start difference. First operand 66152 states and 104782 transitions. Second operand 3 states. [2019-09-07 23:36:44,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:44,057 INFO L93 Difference]: Finished difference Result 132344 states and 209622 transitions. [2019-09-07 23:36:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:36:44,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-07 23:36:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:44,257 INFO L225 Difference]: With dead ends: 132344 [2019-09-07 23:36:44,257 INFO L226 Difference]: Without dead ends: 66204 [2019-09-07 23:36:44,351 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66204 states. [2019-09-07 23:36:47,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66204 to 66202. [2019-09-07 23:36:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66202 states. [2019-09-07 23:36:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66202 states to 66202 states and 104832 transitions. [2019-09-07 23:36:47,988 INFO L78 Accepts]: Start accepts. Automaton has 66202 states and 104832 transitions. Word has length 47 [2019-09-07 23:36:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:47,988 INFO L475 AbstractCegarLoop]: Abstraction has 66202 states and 104832 transitions. [2019-09-07 23:36:47,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:36:47,988 INFO L276 IsEmpty]: Start isEmpty. Operand 66202 states and 104832 transitions. [2019-09-07 23:36:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-07 23:36:47,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:47,989 INFO L399 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-09-07 23:36:47,989 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:47,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:47,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1561932951, now seen corresponding path program 1 times [2019-09-07 23:36:47,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:47,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:47,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:47,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:36:48,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:48,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:36:48,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:36:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:36:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:36:48,122 INFO L87 Difference]: Start difference. First operand 66202 states and 104832 transitions. Second operand 4 states. [2019-09-07 23:36:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:36:56,916 INFO L93 Difference]: Finished difference Result 126789 states and 200689 transitions. [2019-09-07 23:36:56,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:36:56,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-09-07 23:36:56,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:36:57,034 INFO L225 Difference]: With dead ends: 126789 [2019-09-07 23:36:57,035 INFO L226 Difference]: Without dead ends: 66496 [2019-09-07 23:36:57,101 INFO L628 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-09-07 23:36:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66496 states. [2019-09-07 23:36:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66496 to 63922. [2019-09-07 23:36:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63922 states. [2019-09-07 23:36:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63922 states to 63922 states and 99852 transitions. [2019-09-07 23:36:57,876 INFO L78 Accepts]: Start accepts. Automaton has 63922 states and 99852 transitions. Word has length 56 [2019-09-07 23:36:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:36:57,877 INFO L475 AbstractCegarLoop]: Abstraction has 63922 states and 99852 transitions. [2019-09-07 23:36:57,877 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:36:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 63922 states and 99852 transitions. [2019-09-07 23:36:57,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-09-07 23:36:57,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:36:57,878 INFO L399 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-09-07 23:36:57,879 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:36:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:36:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1199471434, now seen corresponding path program 1 times [2019-09-07 23:36:57,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:36:57,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:36:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:57,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:36:57,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:36:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:36:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:36:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:36:57,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:36:57,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:36:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:36:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:36:57,947 INFO L87 Difference]: Start difference. First operand 63922 states and 99852 transitions. Second operand 3 states. [2019-09-07 23:37:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:00,571 INFO L93 Difference]: Finished difference Result 127894 states and 199782 transitions. [2019-09-07 23:37:00,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:00,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-09-07 23:37:00,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:00,653 INFO L225 Difference]: With dead ends: 127894 [2019-09-07 23:37:00,654 INFO L226 Difference]: Without dead ends: 63984 [2019-09-07 23:37:00,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:00,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63984 states. [2019-09-07 23:37:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63984 to 63982. [2019-09-07 23:37:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63982 states. [2019-09-07 23:37:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63982 states to 63982 states and 99912 transitions. [2019-09-07 23:37:01,347 INFO L78 Accepts]: Start accepts. Automaton has 63982 states and 99912 transitions. Word has length 57 [2019-09-07 23:37:01,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:01,347 INFO L475 AbstractCegarLoop]: Abstraction has 63982 states and 99912 transitions. [2019-09-07 23:37:01,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 63982 states and 99912 transitions. [2019-09-07 23:37:01,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 23:37:01,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:01,349 INFO L399 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-09-07 23:37:01,349 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 384994183, now seen corresponding path program 1 times [2019-09-07 23:37:01,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:01,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:01,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:01,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:01,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:01,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:37:01,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:01,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:37:01,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:37:01,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:37:01,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:37:01,421 INFO L87 Difference]: Start difference. First operand 63982 states and 99912 transitions. Second operand 4 states. [2019-09-07 23:37:09,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:10,000 INFO L93 Difference]: Finished difference Result 116802 states and 181842 transitions. [2019-09-07 23:37:10,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:10,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-07 23:37:10,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:10,083 INFO L225 Difference]: With dead ends: 116802 [2019-09-07 23:37:10,083 INFO L226 Difference]: Without dead ends: 64992 [2019-09-07 23:37:10,128 INFO L628 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-09-07 23:37:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64992 states. [2019-09-07 23:37:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64992 to 63726. [2019-09-07 23:37:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63726 states. [2019-09-07 23:37:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 98888 transitions. [2019-09-07 23:37:10,870 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 98888 transitions. Word has length 62 [2019-09-07 23:37:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:10,870 INFO L475 AbstractCegarLoop]: Abstraction has 63726 states and 98888 transitions. [2019-09-07 23:37:10,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:37:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 98888 transitions. [2019-09-07 23:37:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-07 23:37:10,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:10,872 INFO L399 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-09-07 23:37:10,872 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1635374980, now seen corresponding path program 1 times [2019-09-07 23:37:10,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:10,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:10,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:10,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:10,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:37:10,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:37:10,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:37:10,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:10,944 INFO L87 Difference]: Start difference. First operand 63726 states and 98888 transitions. Second operand 3 states. [2019-09-07 23:37:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:18,210 INFO L93 Difference]: Finished difference Result 129854 states and 200368 transitions. [2019-09-07 23:37:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:18,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-07 23:37:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:18,292 INFO L225 Difference]: With dead ends: 129854 [2019-09-07 23:37:18,293 INFO L226 Difference]: Without dead ends: 66100 [2019-09-07 23:37:18,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:18,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66100 states. [2019-09-07 23:37:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66100 to 63406. [2019-09-07 23:37:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63406 states. [2019-09-07 23:37:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63406 states to 63406 states and 98168 transitions. [2019-09-07 23:37:19,058 INFO L78 Accepts]: Start accepts. Automaton has 63406 states and 98168 transitions. Word has length 68 [2019-09-07 23:37:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:19,058 INFO L475 AbstractCegarLoop]: Abstraction has 63406 states and 98168 transitions. [2019-09-07 23:37:19,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 63406 states and 98168 transitions. [2019-09-07 23:37:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 23:37:19,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:19,060 INFO L399 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-09-07 23:37:19,061 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -885532883, now seen corresponding path program 1 times [2019-09-07 23:37:19,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:19,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:19,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:19,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:37:19,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:37:19,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:37:19,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:19,592 INFO L87 Difference]: Start difference. First operand 63406 states and 98168 transitions. Second operand 3 states. [2019-09-07 23:37:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:27,064 INFO L93 Difference]: Finished difference Result 91362 states and 140322 transitions. [2019-09-07 23:37:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:27,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-07 23:37:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:27,146 INFO L225 Difference]: With dead ends: 91362 [2019-09-07 23:37:27,147 INFO L226 Difference]: Without dead ends: 64712 [2019-09-07 23:37:27,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64712 states. [2019-09-07 23:37:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64712 to 63414. [2019-09-07 23:37:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63414 states. [2019-09-07 23:37:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 98096 transitions. [2019-09-07 23:37:28,250 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 98096 transitions. Word has length 78 [2019-09-07 23:37:28,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:28,250 INFO L475 AbstractCegarLoop]: Abstraction has 63414 states and 98096 transitions. [2019-09-07 23:37:28,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:28,251 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 98096 transitions. [2019-09-07 23:37:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 23:37:28,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:28,252 INFO L399 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-09-07 23:37:28,253 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:28,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1721025228, now seen corresponding path program 1 times [2019-09-07 23:37:28,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:28,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:28,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:28,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:28,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:37:28,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:28,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:37:28,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:37:28,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:37:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:28,331 INFO L87 Difference]: Start difference. First operand 63414 states and 98096 transitions. Second operand 3 states. [2019-09-07 23:37:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:30,067 INFO L93 Difference]: Finished difference Result 121049 states and 187242 transitions. [2019-09-07 23:37:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:30,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-07 23:37:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:30,148 INFO L225 Difference]: With dead ends: 121049 [2019-09-07 23:37:30,148 INFO L226 Difference]: Without dead ends: 57647 [2019-09-07 23:37:30,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2019-09-07 23:37:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 57645. [2019-09-07 23:37:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57645 states. [2019-09-07 23:37:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57645 states to 57645 states and 89118 transitions. [2019-09-07 23:37:30,815 INFO L78 Accepts]: Start accepts. Automaton has 57645 states and 89118 transitions. Word has length 85 [2019-09-07 23:37:30,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:30,815 INFO L475 AbstractCegarLoop]: Abstraction has 57645 states and 89118 transitions. [2019-09-07 23:37:30,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:30,815 INFO L276 IsEmpty]: Start isEmpty. Operand 57645 states and 89118 transitions. [2019-09-07 23:37:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 23:37:30,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:30,817 INFO L399 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-09-07 23:37:30,817 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:30,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1640423976, now seen corresponding path program 1 times [2019-09-07 23:37:30,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:30,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:37:30,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:37:30,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:37:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:37:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:30,920 INFO L87 Difference]: Start difference. First operand 57645 states and 89118 transitions. Second operand 3 states. [2019-09-07 23:37:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:32,701 INFO L93 Difference]: Finished difference Result 114970 states and 177752 transitions. [2019-09-07 23:37:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:32,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-09-07 23:37:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:32,807 INFO L225 Difference]: With dead ends: 114970 [2019-09-07 23:37:32,807 INFO L226 Difference]: Without dead ends: 57727 [2019-09-07 23:37:32,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57727 states. [2019-09-07 23:37:33,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57727 to 57725. [2019-09-07 23:37:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57725 states. [2019-09-07 23:37:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57725 states to 57725 states and 89198 transitions. [2019-09-07 23:37:34,021 INFO L78 Accepts]: Start accepts. Automaton has 57725 states and 89198 transitions. Word has length 88 [2019-09-07 23:37:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:34,021 INFO L475 AbstractCegarLoop]: Abstraction has 57725 states and 89198 transitions. [2019-09-07 23:37:34,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 57725 states and 89198 transitions. [2019-09-07 23:37:34,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-07 23:37:34,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:34,023 INFO L399 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-09-07 23:37:34,023 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1152445607, now seen corresponding path program 1 times [2019-09-07 23:37:34,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:34,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:34,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:34,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:34,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:34,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:37:34,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:37:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:37:34,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:37:34,208 INFO L87 Difference]: Start difference. First operand 57725 states and 89198 transitions. Second operand 4 states. [2019-09-07 23:37:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:41,376 INFO L93 Difference]: Finished difference Result 82683 states and 126801 transitions. [2019-09-07 23:37:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:37:41,376 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-07 23:37:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:41,425 INFO L225 Difference]: With dead ends: 82683 [2019-09-07 23:37:41,425 INFO L226 Difference]: Without dead ends: 36324 [2019-09-07 23:37:41,465 INFO L628 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-09-07 23:37:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36324 states. [2019-09-07 23:37:41,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36324 to 35103. [2019-09-07 23:37:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35103 states. [2019-09-07 23:37:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35103 states to 35103 states and 53663 transitions. [2019-09-07 23:37:41,816 INFO L78 Accepts]: Start accepts. Automaton has 35103 states and 53663 transitions. Word has length 92 [2019-09-07 23:37:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:41,817 INFO L475 AbstractCegarLoop]: Abstraction has 35103 states and 53663 transitions. [2019-09-07 23:37:41,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:37:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35103 states and 53663 transitions. [2019-09-07 23:37:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-07 23:37:41,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:41,818 INFO L399 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-09-07 23:37:41,819 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:41,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash 956074825, now seen corresponding path program 1 times [2019-09-07 23:37:41,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:41,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:41,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:41,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:42,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:42,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:37:42,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:37:42,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:37:42,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:37:42,013 INFO L87 Difference]: Start difference. First operand 35103 states and 53663 transitions. Second operand 4 states. [2019-09-07 23:37:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:49,998 INFO L93 Difference]: Finished difference Result 48761 states and 73546 transitions. [2019-09-07 23:37:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:37:49,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-09-07 23:37:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:50,031 INFO L225 Difference]: With dead ends: 48761 [2019-09-07 23:37:50,031 INFO L226 Difference]: Without dead ends: 25024 [2019-09-07 23:37:50,057 INFO L628 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-09-07 23:37:50,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25024 states. [2019-09-07 23:37:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25024 to 23803. [2019-09-07 23:37:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23803 states. [2019-09-07 23:37:50,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 36003 transitions. [2019-09-07 23:37:50,299 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 36003 transitions. Word has length 94 [2019-09-07 23:37:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:50,300 INFO L475 AbstractCegarLoop]: Abstraction has 23803 states and 36003 transitions. [2019-09-07 23:37:50,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:37:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 36003 transitions. [2019-09-07 23:37:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 23:37:50,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:50,302 INFO L399 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-09-07 23:37:50,302 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1811539215, now seen corresponding path program 1 times [2019-09-07 23:37:50,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:50,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:50,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:50,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:50,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:50,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:50,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:37:50,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:37:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:37:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:50,372 INFO L87 Difference]: Start difference. First operand 23803 states and 36003 transitions. Second operand 3 states. [2019-09-07 23:37:52,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:52,143 INFO L93 Difference]: Finished difference Result 24582 states and 37124 transitions. [2019-09-07 23:37:52,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:37:52,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-07 23:37:52,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:52,182 INFO L225 Difference]: With dead ends: 24582 [2019-09-07 23:37:52,183 INFO L226 Difference]: Without dead ends: 24580 [2019-09-07 23:37:52,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:37:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24580 states. [2019-09-07 23:37:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24580 to 24574. [2019-09-07 23:37:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24574 states. [2019-09-07 23:37:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24574 states to 24574 states and 37110 transitions. [2019-09-07 23:37:52,456 INFO L78 Accepts]: Start accepts. Automaton has 24574 states and 37110 transitions. Word has length 102 [2019-09-07 23:37:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:52,456 INFO L475 AbstractCegarLoop]: Abstraction has 24574 states and 37110 transitions. [2019-09-07 23:37:52,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:37:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 24574 states and 37110 transitions. [2019-09-07 23:37:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 23:37:52,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:52,459 INFO L399 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-09-07 23:37:52,459 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1861245991, now seen corresponding path program 1 times [2019-09-07 23:37:52,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:52,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:52,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:52,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:52,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:37:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 23:37:52,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:37:52,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 23:37:52,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 23:37:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 23:37:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 23:37:52,879 INFO L87 Difference]: Start difference. First operand 24574 states and 37110 transitions. Second operand 4 states. [2019-09-07 23:37:59,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:37:59,662 INFO L93 Difference]: Finished difference Result 50053 states and 75123 transitions. [2019-09-07 23:37:59,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 23:37:59,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-07 23:37:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:37:59,693 INFO L225 Difference]: With dead ends: 50053 [2019-09-07 23:37:59,693 INFO L226 Difference]: Without dead ends: 25421 [2019-09-07 23:37:59,717 INFO L628 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-09-07 23:37:59,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25421 states. [2019-09-07 23:37:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25421 to 24270. [2019-09-07 23:37:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24270 states. [2019-09-07 23:37:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24270 states to 24270 states and 36360 transitions. [2019-09-07 23:37:59,953 INFO L78 Accepts]: Start accepts. Automaton has 24270 states and 36360 transitions. Word has length 116 [2019-09-07 23:37:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:37:59,954 INFO L475 AbstractCegarLoop]: Abstraction has 24270 states and 36360 transitions. [2019-09-07 23:37:59,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 23:37:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 24270 states and 36360 transitions. [2019-09-07 23:37:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 23:37:59,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:37:59,956 INFO L399 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-09-07 23:37:59,956 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:37:59,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:37:59,957 INFO L82 PathProgramCache]: Analyzing trace with hash 316824858, now seen corresponding path program 1 times [2019-09-07 23:37:59,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:37:59,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:37:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:59,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:37:59,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:37:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-07 23:38:00,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:00,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:00,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:00,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:00,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:00,030 INFO L87 Difference]: Start difference. First operand 24270 states and 36360 transitions. Second operand 3 states. [2019-09-07 23:38:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:01,234 INFO L93 Difference]: Finished difference Result 42444 states and 63400 transitions. [2019-09-07 23:38:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:01,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-07 23:38:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:01,260 INFO L225 Difference]: With dead ends: 42444 [2019-09-07 23:38:01,261 INFO L226 Difference]: Without dead ends: 19335 [2019-09-07 23:38:01,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:01,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19335 states. [2019-09-07 23:38:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19335 to 19333. [2019-09-07 23:38:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19333 states. [2019-09-07 23:38:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19333 states to 19333 states and 28685 transitions. [2019-09-07 23:38:01,462 INFO L78 Accepts]: Start accepts. Automaton has 19333 states and 28685 transitions. Word has length 118 [2019-09-07 23:38:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:01,463 INFO L475 AbstractCegarLoop]: Abstraction has 19333 states and 28685 transitions. [2019-09-07 23:38:01,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19333 states and 28685 transitions. [2019-09-07 23:38:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 23:38:01,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:01,466 INFO L399 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-09-07 23:38:01,467 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1013835941, now seen corresponding path program 1 times [2019-09-07 23:38:01,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:01,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:01,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:01,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:01,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:01,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:01,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:01,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:01,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:01,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:01,559 INFO L87 Difference]: Start difference. First operand 19333 states and 28685 transitions. Second operand 3 states. [2019-09-07 23:38:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:02,920 INFO L93 Difference]: Finished difference Result 35716 states and 53076 transitions. [2019-09-07 23:38:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-07 23:38:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:02,941 INFO L225 Difference]: With dead ends: 35716 [2019-09-07 23:38:02,941 INFO L226 Difference]: Without dead ends: 17732 [2019-09-07 23:38:02,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17732 states. [2019-09-07 23:38:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17732 to 17730. [2019-09-07 23:38:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17730 states. [2019-09-07 23:38:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17730 states to 17730 states and 26305 transitions. [2019-09-07 23:38:03,122 INFO L78 Accepts]: Start accepts. Automaton has 17730 states and 26305 transitions. Word has length 140 [2019-09-07 23:38:03,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:03,123 INFO L475 AbstractCegarLoop]: Abstraction has 17730 states and 26305 transitions. [2019-09-07 23:38:03,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17730 states and 26305 transitions. [2019-09-07 23:38:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 23:38:03,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:03,127 INFO L399 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-09-07 23:38:03,127 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash 979116920, now seen corresponding path program 1 times [2019-09-07 23:38:03,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:03,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:03,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:03,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:03,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:03,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:03,208 INFO L87 Difference]: Start difference. First operand 17730 states and 26305 transitions. Second operand 3 states. [2019-09-07 23:38:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:04,357 INFO L93 Difference]: Finished difference Result 28904 states and 42832 transitions. [2019-09-07 23:38:04,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:04,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-07 23:38:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:04,371 INFO L225 Difference]: With dead ends: 28904 [2019-09-07 23:38:04,371 INFO L226 Difference]: Without dead ends: 12910 [2019-09-07 23:38:04,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12910 states. [2019-09-07 23:38:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12910 to 12908. [2019-09-07 23:38:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12908 states. [2019-09-07 23:38:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12908 states to 12908 states and 18998 transitions. [2019-09-07 23:38:04,496 INFO L78 Accepts]: Start accepts. Automaton has 12908 states and 18998 transitions. Word has length 142 [2019-09-07 23:38:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:04,496 INFO L475 AbstractCegarLoop]: Abstraction has 12908 states and 18998 transitions. [2019-09-07 23:38:04,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 12908 states and 18998 transitions. [2019-09-07 23:38:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 23:38:04,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:04,499 INFO L399 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-09-07 23:38:04,500 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash 613887253, now seen corresponding path program 1 times [2019-09-07 23:38:04,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:04,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:04,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:04,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:04,580 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:04,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:04,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:04,581 INFO L87 Difference]: Start difference. First operand 12908 states and 18998 transitions. Second operand 3 states. [2019-09-07 23:38:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:05,825 INFO L93 Difference]: Finished difference Result 23254 states and 34305 transitions. [2019-09-07 23:38:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:05,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-07 23:38:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:05,839 INFO L225 Difference]: With dead ends: 23254 [2019-09-07 23:38:05,840 INFO L226 Difference]: Without dead ends: 12275 [2019-09-07 23:38:05,851 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-09-07 23:38:05,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 12273. [2019-09-07 23:38:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12273 states. [2019-09-07 23:38:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12273 states to 12273 states and 18048 transitions. [2019-09-07 23:38:05,974 INFO L78 Accepts]: Start accepts. Automaton has 12273 states and 18048 transitions. Word has length 148 [2019-09-07 23:38:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:05,974 INFO L475 AbstractCegarLoop]: Abstraction has 12273 states and 18048 transitions. [2019-09-07 23:38:05,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 12273 states and 18048 transitions. [2019-09-07 23:38:05,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 23:38:05,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:05,978 INFO L399 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-09-07 23:38:05,978 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:05,978 INFO L82 PathProgramCache]: Analyzing trace with hash -398003814, now seen corresponding path program 1 times [2019-09-07 23:38:05,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:05,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:05,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:05,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:06,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:06,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:06,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:06,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:06,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:06,071 INFO L87 Difference]: Start difference. First operand 12273 states and 18048 transitions. Second operand 3 states. [2019-09-07 23:38:07,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:07,347 INFO L93 Difference]: Finished difference Result 22649 states and 33379 transitions. [2019-09-07 23:38:07,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:07,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-07 23:38:07,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:07,367 INFO L225 Difference]: With dead ends: 22649 [2019-09-07 23:38:07,367 INFO L226 Difference]: Without dead ends: 12305 [2019-09-07 23:38:07,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12305 states. [2019-09-07 23:38:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12305 to 12303. [2019-09-07 23:38:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12303 states. [2019-09-07 23:38:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12303 states to 12303 states and 18078 transitions. [2019-09-07 23:38:07,549 INFO L78 Accepts]: Start accepts. Automaton has 12303 states and 18078 transitions. Word has length 152 [2019-09-07 23:38:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:07,549 INFO L475 AbstractCegarLoop]: Abstraction has 12303 states and 18078 transitions. [2019-09-07 23:38:07,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 12303 states and 18078 transitions. [2019-09-07 23:38:07,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 23:38:07,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:07,555 INFO L399 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-09-07 23:38:07,555 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:07,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:07,556 INFO L82 PathProgramCache]: Analyzing trace with hash 937599923, now seen corresponding path program 1 times [2019-09-07 23:38:07,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:07,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:07,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:07,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:07,656 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:07,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:07,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:07,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:07,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:07,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:07,658 INFO L87 Difference]: Start difference. First operand 12303 states and 18078 transitions. Second operand 3 states. [2019-09-07 23:38:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:08,631 INFO L93 Difference]: Finished difference Result 20377 states and 30019 transitions. [2019-09-07 23:38:08,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:08,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-07 23:38:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:08,642 INFO L225 Difference]: With dead ends: 20377 [2019-09-07 23:38:08,643 INFO L226 Difference]: Without dead ends: 10003 [2019-09-07 23:38:08,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10003 states. [2019-09-07 23:38:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10003 to 10001. [2019-09-07 23:38:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10001 states. [2019-09-07 23:38:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10001 states to 10001 states and 14680 transitions. [2019-09-07 23:38:08,744 INFO L78 Accepts]: Start accepts. Automaton has 10001 states and 14680 transitions. Word has length 182 [2019-09-07 23:38:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:08,744 INFO L475 AbstractCegarLoop]: Abstraction has 10001 states and 14680 transitions. [2019-09-07 23:38:08,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10001 states and 14680 transitions. [2019-09-07 23:38:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 23:38:08,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:08,749 INFO L399 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-09-07 23:38:08,749 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash -624398577, now seen corresponding path program 1 times [2019-09-07 23:38:08,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:08,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 23:38:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 23:38:09,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 23:38:09,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 23:38:09,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 23:38:09,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 23:38:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:09,043 INFO L87 Difference]: Start difference. First operand 10001 states and 14680 transitions. Second operand 3 states. [2019-09-07 23:38:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 23:38:09,440 INFO L93 Difference]: Finished difference Result 10403 states and 15241 transitions. [2019-09-07 23:38:09,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 23:38:09,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-09-07 23:38:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 23:38:09,444 INFO L225 Difference]: With dead ends: 10403 [2019-09-07 23:38:09,444 INFO L226 Difference]: Without dead ends: 2337 [2019-09-07 23:38:09,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 23:38:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-09-07 23:38:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2019-09-07 23:38:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-09-07 23:38:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3315 transitions. [2019-09-07 23:38:09,475 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3315 transitions. Word has length 187 [2019-09-07 23:38:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 23:38:09,475 INFO L475 AbstractCegarLoop]: Abstraction has 2335 states and 3315 transitions. [2019-09-07 23:38:09,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 23:38:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3315 transitions. [2019-09-07 23:38:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-07 23:38:09,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 23:38:09,478 INFO L399 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-09-07 23:38:09,478 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 23:38:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 23:38:09,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1061043629, now seen corresponding path program 1 times [2019-09-07 23:38:09,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 23:38:09,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 23:38:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:09,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 23:38:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 23:38:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 23:38:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 23:38:09,892 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-07 23:38:10,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 11:38:10 BoogieIcfgContainer [2019-09-07 23:38:10,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 23:38:10,135 INFO L168 Benchmark]: Toolchain (without parser) took 161442.60 ms. Allocated memory was 170.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 663.2 MB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,136 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3581.57 ms. Allocated memory was 170.9 MB in the beginning and 445.6 MB in the end (delta: 274.7 MB). Free memory was 100.6 MB in the beginning and 138.0 MB in the end (delta: -37.4 MB). Peak memory consumption was 278.2 MB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,141 INFO L168 Benchmark]: Boogie Preprocessor took 2246.49 ms. Allocated memory was 445.6 MB in the beginning and 584.6 MB in the end (delta: 138.9 MB). Free memory was 138.0 MB in the beginning and 393.8 MB in the end (delta: -255.8 MB). Peak memory consumption was 154.8 MB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,144 INFO L168 Benchmark]: RCFGBuilder took 22128.48 ms. Allocated memory was 584.6 MB in the beginning and 1.0 GB in the end (delta: 465.0 MB). Free memory was 393.8 MB in the beginning and 712.3 MB in the end (delta: -318.5 MB). Peak memory consumption was 708.4 MB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,145 INFO L168 Benchmark]: TraceAbstraction took 133481.76 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 712.3 MB in the beginning and 2.0 GB in the end (delta: -1.3 GB). Peak memory consumption was 395.5 MB. Max. memory is 7.1 GB. [2019-09-07 23:38:10,156 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3581.57 ms. Allocated memory was 170.9 MB in the beginning and 445.6 MB in the end (delta: 274.7 MB). Free memory was 100.6 MB in the beginning and 138.0 MB in the end (delta: -37.4 MB). Peak memory consumption was 278.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 2246.49 ms. Allocated memory was 445.6 MB in the beginning and 584.6 MB in the end (delta: 138.9 MB). Free memory was 138.0 MB in the beginning and 393.8 MB in the end (delta: -255.8 MB). Peak memory consumption was 154.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 22128.48 ms. Allocated memory was 584.6 MB in the beginning and 1.0 GB in the end (delta: 465.0 MB). Free memory was 393.8 MB in the beginning and 712.3 MB in the end (delta: -318.5 MB). Peak memory consumption was 708.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 133481.76 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 712.3 MB in the beginning and 2.0 GB in the end (delta: -1.3 GB). Peak memory consumption was 395.5 MB. 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, 133.3s OverallTime, 29 OverallIterations, 4 TraceHistogramMax, 113.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 327384 SDtfs, 219516 SDslu, 201887 SDs, 0 SdLazy, 58515 SolverSat, 22242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 79.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 32 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, 28 MinimizatonAttempts, 17607 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2434 NumberOfCodeBlocks, 2434 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 752092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 222/222 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...