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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/psyco/psyco_net_1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:59:25,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:59:25,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:59:25,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:59:25,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:59:25,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:59:25,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:59:25,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:59:25,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:59:25,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:59:25,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:59:25,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:59:25,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:59:25,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:59:25,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:59:25,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:59:25,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:59:25,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:59:25,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:59:25,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:59:25,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:59:25,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:59:25,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:59:25,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:59:25,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:59:25,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:59:25,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:59:25,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:59:25,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:59:25,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:59:25,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:59:25,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:59:25,516 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:59:25,517 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:59:25,518 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:59:25,518 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:59:25,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:59:25,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:59:25,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:59:25,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:59:25,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:59:25,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:59:25,537 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:59:25,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:59:25,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:59:25,538 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:59:25,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:59:25,539 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:59:25,539 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:59:25,539 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:59:25,540 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:59:25,540 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:59:25,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:59:25,541 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:59:25,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:59:25,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:59:25,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:59:25,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:59:25,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:59:25,542 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:59:25,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:59:25,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:59:25,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:59:25,543 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:59:25,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:59:25,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:25,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:59:25,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:59:25,544 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:59:25,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:59:25,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:59:25,544 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:59:25,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:59:25,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:59:25,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:59:25,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:59:25,595 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:59:25,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/psyco/psyco_net_1.c [2019-10-03 02:59:25,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eff2fc4e/7035b776e9a94a53877169fd745a38bd/FLAGae48d880a [2019-10-03 02:59:26,943 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:59:26,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1.c [2019-10-03 02:59:27,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eff2fc4e/7035b776e9a94a53877169fd745a38bd/FLAGae48d880a [2019-10-03 02:59:27,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7eff2fc4e/7035b776e9a94a53877169fd745a38bd [2019-10-03 02:59:27,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:59:27,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:59:27,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:27,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:59:27,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:59:27,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:27" (1/1) ... [2019-10-03 02:59:27,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1af36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:27, skipping insertion in model container [2019-10-03 02:59:27,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:59:27" (1/1) ... [2019-10-03 02:59:27,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:59:28,158 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:59:30,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:30,097 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:59:31,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:59:31,277 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:59:31,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31 WrapperNode [2019-10-03 02:59:31,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:59:31,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:59:31,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:59:31,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:59:31,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:31,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:31,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:31,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:31,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:31,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:32,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... [2019-10-03 02:59:32,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:59:32,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:59:32,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:59:32,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:59:32,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:59:32,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:59:32,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:59:32,270 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:59:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:59:32,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:59:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:59:32,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:59:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:59:54,390 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:59:54,391 INFO L283 CfgBuilder]: Removed 1130 assume(true) statements. [2019-10-03 02:59:54,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:54 BoogieIcfgContainer [2019-10-03 02:59:54,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:59:54,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:59:54,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:59:54,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:59:54,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:59:27" (1/3) ... [2019-10-03 02:59:54,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd4b3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:54, skipping insertion in model container [2019-10-03 02:59:54,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:59:31" (2/3) ... [2019-10-03 02:59:54,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd4b3e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:59:54, skipping insertion in model container [2019-10-03 02:59:54,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:59:54" (3/3) ... [2019-10-03 02:59:54,404 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2019-10-03 02:59:54,414 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:59:54,427 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:59:54,444 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:59:54,470 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:59:54,470 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:59:54,470 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:59:54,470 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:59:54,470 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:59:54,471 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:59:54,471 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:59:54,471 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:59:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states. [2019-10-03 02:59:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-03 02:59:54,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:54,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:54,612 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1995238601, now seen corresponding path program 1 times [2019-10-03 02:59:54,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:54,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:54,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:54,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:54,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:54,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:59:54,936 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:54,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:59:54,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:59:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:54,968 INFO L87 Difference]: Start difference. First operand 9216 states. Second operand 2 states. [2019-10-03 02:59:55,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:55,188 INFO L93 Difference]: Finished difference Result 8494 states and 14152 transitions. [2019-10-03 02:59:55,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:59:55,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-03 02:59:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:55,261 INFO L225 Difference]: With dead ends: 8494 [2019-10-03 02:59:55,261 INFO L226 Difference]: Without dead ends: 8284 [2019-10-03 02:59:55,265 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:59:55,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2019-10-03 02:59:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2019-10-03 02:59:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-10-03 02:59:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 13001 transitions. [2019-10-03 02:59:55,546 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 13001 transitions. Word has length 12 [2019-10-03 02:59:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:55,546 INFO L475 AbstractCegarLoop]: Abstraction has 8284 states and 13001 transitions. [2019-10-03 02:59:55,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:59:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 13001 transitions. [2019-10-03 02:59:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-03 02:59:55,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:55,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:55,548 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:55,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:55,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2041051310, now seen corresponding path program 1 times [2019-10-03 02:59:55,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:55,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:55,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:55,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:55,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:55,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:55,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:55,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:55,720 INFO L87 Difference]: Start difference. First operand 8284 states and 13001 transitions. Second operand 3 states. [2019-10-03 02:59:58,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:59:58,378 INFO L93 Difference]: Finished difference Result 8287 states and 13004 transitions. [2019-10-03 02:59:58,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:59:58,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-03 02:59:58,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:59:58,423 INFO L225 Difference]: With dead ends: 8287 [2019-10-03 02:59:58,423 INFO L226 Difference]: Without dead ends: 8287 [2019-10-03 02:59:58,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2019-10-03 02:59:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8287. [2019-10-03 02:59:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2019-10-03 02:59:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2019-10-03 02:59:58,613 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 13 [2019-10-03 02:59:58,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:59:58,613 INFO L475 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2019-10-03 02:59:58,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:59:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2019-10-03 02:59:58,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:59:58,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:59:58,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:59:58,615 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:59:58,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:59:58,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1470278663, now seen corresponding path program 1 times [2019-10-03 02:59:58,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:59:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:58,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:59:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:59:58,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:59:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:59:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:59:58,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:59:58,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:59:58,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:59:58,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:59:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:59:58,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:59:58,727 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand 3 states. [2019-10-03 03:00:00,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:00,768 INFO L93 Difference]: Finished difference Result 8180 states and 12850 transitions. [2019-10-03 03:00:00,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:00,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 03:00:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:00,812 INFO L225 Difference]: With dead ends: 8180 [2019-10-03 03:00:00,812 INFO L226 Difference]: Without dead ends: 8180 [2019-10-03 03:00:00,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2019-10-03 03:00:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2019-10-03 03:00:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2019-10-03 03:00:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12850 transitions. [2019-10-03 03:00:01,294 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12850 transitions. Word has length 18 [2019-10-03 03:00:01,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:01,294 INFO L475 AbstractCegarLoop]: Abstraction has 8180 states and 12850 transitions. [2019-10-03 03:00:01,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12850 transitions. [2019-10-03 03:00:01,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 03:00:01,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:01,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:01,305 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash -465443610, now seen corresponding path program 1 times [2019-10-03 03:00:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:01,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:01,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:01,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:01,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:01,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:01,447 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:01,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:01,448 INFO L87 Difference]: Start difference. First operand 8180 states and 12850 transitions. Second operand 3 states. [2019-10-03 03:00:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:06,408 INFO L93 Difference]: Finished difference Result 8100 states and 12270 transitions. [2019-10-03 03:00:06,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:06,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-10-03 03:00:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:06,455 INFO L225 Difference]: With dead ends: 8100 [2019-10-03 03:00:06,463 INFO L226 Difference]: Without dead ends: 8060 [2019-10-03 03:00:06,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:06,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2019-10-03 03:00:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 8060. [2019-10-03 03:00:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2019-10-03 03:00:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2019-10-03 03:00:06,847 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 22 [2019-10-03 03:00:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:06,847 INFO L475 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2019-10-03 03:00:06,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2019-10-03 03:00:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-03 03:00:06,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:06,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:06,850 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash -174181509, now seen corresponding path program 1 times [2019-10-03 03:00:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:06,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:06,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:06,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:06,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:06,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:06,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:06,914 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2019-10-03 03:00:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:08,963 INFO L93 Difference]: Finished difference Result 8066 states and 12235 transitions. [2019-10-03 03:00:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:08,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-03 03:00:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:08,986 INFO L225 Difference]: With dead ends: 8066 [2019-10-03 03:00:08,986 INFO L226 Difference]: Without dead ends: 8066 [2019-10-03 03:00:08,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2019-10-03 03:00:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 8064. [2019-10-03 03:00:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2019-10-03 03:00:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 12234 transitions. [2019-10-03 03:00:09,129 INFO L78 Accepts]: Start accepts. Automaton has 8064 states and 12234 transitions. Word has length 25 [2019-10-03 03:00:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:09,130 INFO L475 AbstractCegarLoop]: Abstraction has 8064 states and 12234 transitions. [2019-10-03 03:00:09,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 8064 states and 12234 transitions. [2019-10-03 03:00:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 03:00:09,133 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:09,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:09,134 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:09,134 INFO L82 PathProgramCache]: Analyzing trace with hash 836026374, now seen corresponding path program 1 times [2019-10-03 03:00:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:09,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:09,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:09,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:09,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:09,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:09,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:09,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:09,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:09,233 INFO L87 Difference]: Start difference. First operand 8064 states and 12234 transitions. Second operand 3 states. [2019-10-03 03:00:14,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:14,142 INFO L93 Difference]: Finished difference Result 16116 states and 24415 transitions. [2019-10-03 03:00:14,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-03 03:00:14,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:14,175 INFO L225 Difference]: With dead ends: 16116 [2019-10-03 03:00:14,176 INFO L226 Difference]: Without dead ends: 16068 [2019-10-03 03:00:14,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:14,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2019-10-03 03:00:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14810. [2019-10-03 03:00:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2019-10-03 03:00:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 23046 transitions. [2019-10-03 03:00:14,416 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 23046 transitions. Word has length 26 [2019-10-03 03:00:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:14,417 INFO L475 AbstractCegarLoop]: Abstraction has 14810 states and 23046 transitions. [2019-10-03 03:00:14,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 23046 transitions. [2019-10-03 03:00:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-03 03:00:14,419 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:14,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:14,419 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash 584468791, now seen corresponding path program 1 times [2019-10-03 03:00:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:14,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:14,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:14,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:14,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:14,510 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:14,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:14,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:14,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:14,514 INFO L87 Difference]: Start difference. First operand 14810 states and 23046 transitions. Second operand 3 states. [2019-10-03 03:00:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:21,777 INFO L93 Difference]: Finished difference Result 22542 states and 34201 transitions. [2019-10-03 03:00:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:21,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-03 03:00:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:21,815 INFO L225 Difference]: With dead ends: 22542 [2019-10-03 03:00:21,815 INFO L226 Difference]: Without dead ends: 22270 [2019-10-03 03:00:21,816 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2019-10-03 03:00:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 21076. [2019-10-03 03:00:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2019-10-03 03:00:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 32688 transitions. [2019-10-03 03:00:22,478 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 32688 transitions. Word has length 28 [2019-10-03 03:00:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:22,480 INFO L475 AbstractCegarLoop]: Abstraction has 21076 states and 32688 transitions. [2019-10-03 03:00:22,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:22,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 32688 transitions. [2019-10-03 03:00:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-03 03:00:22,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:22,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:22,487 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1793198483, now seen corresponding path program 1 times [2019-10-03 03:00:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:22,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:22,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:22,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:22,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:22,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:22,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:22,572 INFO L87 Difference]: Start difference. First operand 21076 states and 32688 transitions. Second operand 3 states. [2019-10-03 03:00:30,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:30,586 INFO L93 Difference]: Finished difference Result 42110 states and 65183 transitions. [2019-10-03 03:00:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:30,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-10-03 03:00:30,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:30,681 INFO L225 Difference]: With dead ends: 42110 [2019-10-03 03:00:30,681 INFO L226 Difference]: Without dead ends: 42110 [2019-10-03 03:00:30,681 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2019-10-03 03:00:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 40084. [2019-10-03 03:00:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2019-10-03 03:00:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 63062 transitions. [2019-10-03 03:00:31,284 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 63062 transitions. Word has length 33 [2019-10-03 03:00:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:31,285 INFO L475 AbstractCegarLoop]: Abstraction has 40084 states and 63062 transitions. [2019-10-03 03:00:31,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 63062 transitions. [2019-10-03 03:00:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-03 03:00:31,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:31,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:00:31,286 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:31,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:31,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1383075288, now seen corresponding path program 1 times [2019-10-03 03:00:31,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:31,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:31,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:31,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:31,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:31,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:31,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:31,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:31,385 INFO L87 Difference]: Start difference. First operand 40084 states and 63062 transitions. Second operand 3 states. [2019-10-03 03:00:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:36,319 INFO L93 Difference]: Finished difference Result 67874 states and 106879 transitions. [2019-10-03 03:00:36,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:36,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-03 03:00:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:36,451 INFO L225 Difference]: With dead ends: 67874 [2019-10-03 03:00:36,451 INFO L226 Difference]: Without dead ends: 67826 [2019-10-03 03:00:36,452 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2019-10-03 03:00:37,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 66152. [2019-10-03 03:00:37,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66152 states. [2019-10-03 03:00:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66152 states to 66152 states and 104782 transitions. [2019-10-03 03:00:37,397 INFO L78 Accepts]: Start accepts. Automaton has 66152 states and 104782 transitions. Word has length 42 [2019-10-03 03:00:37,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:37,397 INFO L475 AbstractCegarLoop]: Abstraction has 66152 states and 104782 transitions. [2019-10-03 03:00:37,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:37,397 INFO L276 IsEmpty]: Start isEmpty. Operand 66152 states and 104782 transitions. [2019-10-03 03:00:37,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 03:00:37,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:37,399 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:00:37,399 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:37,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:37,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1389866737, now seen corresponding path program 1 times [2019-10-03 03:00:37,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:37,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:37,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:37,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:00:37,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:37,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:37,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:37,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:37,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:37,461 INFO L87 Difference]: Start difference. First operand 66152 states and 104782 transitions. Second operand 3 states. [2019-10-03 03:00:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:39,741 INFO L93 Difference]: Finished difference Result 66204 states and 104833 transitions. [2019-10-03 03:00:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:39,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-03 03:00:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:39,878 INFO L225 Difference]: With dead ends: 66204 [2019-10-03 03:00:39,878 INFO L226 Difference]: Without dead ends: 66204 [2019-10-03 03:00:39,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66204 states. [2019-10-03 03:00:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66204 to 66202. [2019-10-03 03:00:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66202 states. [2019-10-03 03:00:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66202 states to 66202 states and 104832 transitions. [2019-10-03 03:00:40,671 INFO L78 Accepts]: Start accepts. Automaton has 66202 states and 104832 transitions. Word has length 46 [2019-10-03 03:00:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:40,672 INFO L475 AbstractCegarLoop]: Abstraction has 66202 states and 104832 transitions. [2019-10-03 03:00:40,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 66202 states and 104832 transitions. [2019-10-03 03:00:40,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-03 03:00:40,673 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:40,673 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:00:40,673 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:40,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:40,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1670365342, now seen corresponding path program 1 times [2019-10-03 03:00:40,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:40,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:40,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:00:40,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:40,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:00:40,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:40,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:00:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:00:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:00:40,787 INFO L87 Difference]: Start difference. First operand 66202 states and 104832 transitions. Second operand 4 states. [2019-10-03 03:00:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:49,342 INFO L93 Difference]: Finished difference Result 66556 states and 102797 transitions. [2019-10-03 03:00:49,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:00:49,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-03 03:00:49,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:49,454 INFO L225 Difference]: With dead ends: 66556 [2019-10-03 03:00:49,454 INFO L226 Difference]: Without dead ends: 66496 [2019-10-03 03:00:49,455 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:00:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66496 states. [2019-10-03 03:00:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66496 to 63922. [2019-10-03 03:00:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63922 states. [2019-10-03 03:00:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63922 states to 63922 states and 99852 transitions. [2019-10-03 03:00:54,278 INFO L78 Accepts]: Start accepts. Automaton has 63922 states and 99852 transitions. Word has length 55 [2019-10-03 03:00:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:54,278 INFO L475 AbstractCegarLoop]: Abstraction has 63922 states and 99852 transitions. [2019-10-03 03:00:54,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:00:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 63922 states and 99852 transitions. [2019-10-03 03:00:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-03 03:00:54,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:54,280 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:00:54,280 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:54,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1102391777, now seen corresponding path program 1 times [2019-10-03 03:00:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:54,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:00:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:00:54,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:54,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:00:54,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:00:54,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:54,374 INFO L87 Difference]: Start difference. First operand 63922 states and 99852 transitions. Second operand 3 states. [2019-10-03 03:00:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:00:55,950 INFO L93 Difference]: Finished difference Result 63984 states and 99913 transitions. [2019-10-03 03:00:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:00:55,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-03 03:00:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:00:56,036 INFO L225 Difference]: With dead ends: 63984 [2019-10-03 03:00:56,037 INFO L226 Difference]: Without dead ends: 63984 [2019-10-03 03:00:56,037 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:00:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63984 states. [2019-10-03 03:00:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63984 to 63982. [2019-10-03 03:00:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63982 states. [2019-10-03 03:00:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63982 states to 63982 states and 99912 transitions. [2019-10-03 03:00:56,674 INFO L78 Accepts]: Start accepts. Automaton has 63982 states and 99912 transitions. Word has length 56 [2019-10-03 03:00:56,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:00:56,674 INFO L475 AbstractCegarLoop]: Abstraction has 63982 states and 99912 transitions. [2019-10-03 03:00:56,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:00:56,674 INFO L276 IsEmpty]: Start isEmpty. Operand 63982 states and 99912 transitions. [2019-10-03 03:00:56,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-03 03:00:56,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:00:56,675 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:00:56,676 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:00:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:00:56,676 INFO L82 PathProgramCache]: Analyzing trace with hash 782133564, now seen corresponding path program 1 times [2019-10-03 03:00:56,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:00:56,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:00:56,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:00:56,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:00:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:00:56,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:00:56,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:00:56,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:00:56,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:00:56,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:00:56,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:00:56,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:00:56,796 INFO L87 Difference]: Start difference. First operand 63982 states and 99912 transitions. Second operand 4 states. [2019-10-03 03:01:03,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:03,503 INFO L93 Difference]: Finished difference Result 64992 states and 100201 transitions. [2019-10-03 03:01:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:03,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-10-03 03:01:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:03,593 INFO L225 Difference]: With dead ends: 64992 [2019-10-03 03:01:03,594 INFO L226 Difference]: Without dead ends: 64992 [2019-10-03 03:01:03,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:01:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64992 states. [2019-10-03 03:01:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64992 to 63726. [2019-10-03 03:01:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63726 states. [2019-10-03 03:01:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 98888 transitions. [2019-10-03 03:01:04,243 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 98888 transitions. Word has length 61 [2019-10-03 03:01:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:04,244 INFO L475 AbstractCegarLoop]: Abstraction has 63726 states and 98888 transitions. [2019-10-03 03:01:04,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:01:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 98888 transitions. [2019-10-03 03:01:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-03 03:01:04,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:04,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:04,245 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:04,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:04,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1795398204, now seen corresponding path program 1 times [2019-10-03 03:01:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:04,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:04,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:04,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:04,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:04,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:04,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:04,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:04,329 INFO L87 Difference]: Start difference. First operand 63726 states and 98888 transitions. Second operand 3 states. [2019-10-03 03:01:11,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:11,045 INFO L93 Difference]: Finished difference Result 66140 states and 101173 transitions. [2019-10-03 03:01:11,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:11,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-03 03:01:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:11,136 INFO L225 Difference]: With dead ends: 66140 [2019-10-03 03:01:11,136 INFO L226 Difference]: Without dead ends: 66100 [2019-10-03 03:01:11,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66100 states. [2019-10-03 03:01:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66100 to 63406. [2019-10-03 03:01:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63406 states. [2019-10-03 03:01:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63406 states to 63406 states and 98168 transitions. [2019-10-03 03:01:11,778 INFO L78 Accepts]: Start accepts. Automaton has 63406 states and 98168 transitions. Word has length 67 [2019-10-03 03:01:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:11,779 INFO L475 AbstractCegarLoop]: Abstraction has 63406 states and 98168 transitions. [2019-10-03 03:01:11,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:11,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63406 states and 98168 transitions. [2019-10-03 03:01:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-03 03:01:11,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:11,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:11,781 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:11,781 INFO L82 PathProgramCache]: Analyzing trace with hash 85465717, now seen corresponding path program 1 times [2019-10-03 03:01:11,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:11,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:11,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:11,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:11,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:11,886 INFO L87 Difference]: Start difference. First operand 63406 states and 98168 transitions. Second operand 3 states. [2019-10-03 03:01:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:19,374 INFO L93 Difference]: Finished difference Result 64712 states and 99393 transitions. [2019-10-03 03:01:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:19,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-10-03 03:01:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:19,453 INFO L225 Difference]: With dead ends: 64712 [2019-10-03 03:01:19,453 INFO L226 Difference]: Without dead ends: 64712 [2019-10-03 03:01:19,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64712 states. [2019-10-03 03:01:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64712 to 63414. [2019-10-03 03:01:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63414 states. [2019-10-03 03:01:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 98096 transitions. [2019-10-03 03:01:20,018 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 98096 transitions. Word has length 77 [2019-10-03 03:01:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:20,018 INFO L475 AbstractCegarLoop]: Abstraction has 63414 states and 98096 transitions. [2019-10-03 03:01:20,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 98096 transitions. [2019-10-03 03:01:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-03 03:01:20,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:20,020 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:01:20,021 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1321639519, now seen corresponding path program 1 times [2019-10-03 03:01:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:20,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:20,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:01:20,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:20,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:20,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:20,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:20,090 INFO L87 Difference]: Start difference. First operand 63414 states and 98096 transitions. Second operand 3 states. [2019-10-03 03:01:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:22,013 INFO L93 Difference]: Finished difference Result 57647 states and 89119 transitions. [2019-10-03 03:01:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:22,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-03 03:01:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:22,078 INFO L225 Difference]: With dead ends: 57647 [2019-10-03 03:01:22,078 INFO L226 Difference]: Without dead ends: 57647 [2019-10-03 03:01:22,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2019-10-03 03:01:22,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 57645. [2019-10-03 03:01:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57645 states. [2019-10-03 03:01:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57645 states to 57645 states and 89118 transitions. [2019-10-03 03:01:22,570 INFO L78 Accepts]: Start accepts. Automaton has 57645 states and 89118 transitions. Word has length 84 [2019-10-03 03:01:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:22,570 INFO L475 AbstractCegarLoop]: Abstraction has 57645 states and 89118 transitions. [2019-10-03 03:01:22,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 57645 states and 89118 transitions. [2019-10-03 03:01:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-03 03:01:22,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:22,572 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:01:22,572 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:22,573 INFO L82 PathProgramCache]: Analyzing trace with hash 381119773, now seen corresponding path program 1 times [2019-10-03 03:01:22,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:22,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:01:22,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:22,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:22,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:22,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:22,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:22,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:22,644 INFO L87 Difference]: Start difference. First operand 57645 states and 89118 transitions. Second operand 3 states. [2019-10-03 03:01:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:24,166 INFO L93 Difference]: Finished difference Result 57727 states and 89199 transitions. [2019-10-03 03:01:24,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:24,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-03 03:01:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:24,244 INFO L225 Difference]: With dead ends: 57727 [2019-10-03 03:01:24,244 INFO L226 Difference]: Without dead ends: 57727 [2019-10-03 03:01:24,245 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:24,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57727 states. [2019-10-03 03:01:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57727 to 57725. [2019-10-03 03:01:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57725 states. [2019-10-03 03:01:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57725 states to 57725 states and 89198 transitions. [2019-10-03 03:01:24,778 INFO L78 Accepts]: Start accepts. Automaton has 57725 states and 89198 transitions. Word has length 87 [2019-10-03 03:01:24,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:24,779 INFO L475 AbstractCegarLoop]: Abstraction has 57725 states and 89198 transitions. [2019-10-03 03:01:24,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:24,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57725 states and 89198 transitions. [2019-10-03 03:01:24,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-03 03:01:24,780 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:24,780 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:01:24,780 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:24,781 INFO L82 PathProgramCache]: Analyzing trace with hash 321898062, now seen corresponding path program 1 times [2019-10-03 03:01:24,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:24,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:24,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:24,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:24,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:01:25,006 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:25,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:01:25,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:01:25,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:01:25,008 INFO L87 Difference]: Start difference. First operand 57725 states and 89198 transitions. Second operand 4 states. [2019-10-03 03:01:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:34,624 INFO L93 Difference]: Finished difference Result 36324 states and 54813 transitions. [2019-10-03 03:01:34,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:01:34,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-03 03:01:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:34,665 INFO L225 Difference]: With dead ends: 36324 [2019-10-03 03:01:34,665 INFO L226 Difference]: Without dead ends: 36254 [2019-10-03 03:01:34,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:01:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36254 states. [2019-10-03 03:01:34,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36254 to 35103. [2019-10-03 03:01:34,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35103 states. [2019-10-03 03:01:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35103 states to 35103 states and 53387 transitions. [2019-10-03 03:01:34,962 INFO L78 Accepts]: Start accepts. Automaton has 35103 states and 53387 transitions. Word has length 91 [2019-10-03 03:01:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:34,962 INFO L475 AbstractCegarLoop]: Abstraction has 35103 states and 53387 transitions. [2019-10-03 03:01:34,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:01:34,962 INFO L276 IsEmpty]: Start isEmpty. Operand 35103 states and 53387 transitions. [2019-10-03 03:01:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-03 03:01:34,964 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:34,964 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:01:34,964 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:34,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:34,964 INFO L82 PathProgramCache]: Analyzing trace with hash 461133054, now seen corresponding path program 1 times [2019-10-03 03:01:34,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:34,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:34,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:34,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:35,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:35,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:01:35,131 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:35,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:01:35,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:01:35,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:01:35,132 INFO L87 Difference]: Start difference. First operand 35103 states and 53387 transitions. Second operand 4 states. [2019-10-03 03:01:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:43,194 INFO L93 Difference]: Finished difference Result 24954 states and 37015 transitions. [2019-10-03 03:01:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:01:43,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-03 03:01:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:43,222 INFO L225 Difference]: With dead ends: 24954 [2019-10-03 03:01:43,222 INFO L226 Difference]: Without dead ends: 24954 [2019-10-03 03:01:43,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:01:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24954 states. [2019-10-03 03:01:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24954 to 23803. [2019-10-03 03:01:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23803 states. [2019-10-03 03:01:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 35865 transitions. [2019-10-03 03:01:43,438 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 35865 transitions. Word has length 93 [2019-10-03 03:01:43,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:43,438 INFO L475 AbstractCegarLoop]: Abstraction has 23803 states and 35865 transitions. [2019-10-03 03:01:43,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:01:43,438 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 35865 transitions. [2019-10-03 03:01:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-03 03:01:43,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:43,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:43,440 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash -677982121, now seen corresponding path program 1 times [2019-10-03 03:01:43,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:43,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:43,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:01:43,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:43,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:43,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:43,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:43,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:43,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:43,523 INFO L87 Difference]: Start difference. First operand 23803 states and 35865 transitions. Second operand 3 states. [2019-10-03 03:01:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:45,079 INFO L93 Difference]: Finished difference Result 24576 states and 36969 transitions. [2019-10-03 03:01:45,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:45,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-03 03:01:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:45,108 INFO L225 Difference]: With dead ends: 24576 [2019-10-03 03:01:45,108 INFO L226 Difference]: Without dead ends: 24576 [2019-10-03 03:01:45,109 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:45,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2019-10-03 03:01:45,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24574. [2019-10-03 03:01:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24574 states. [2019-10-03 03:01:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24574 states to 24574 states and 36968 transitions. [2019-10-03 03:01:45,340 INFO L78 Accepts]: Start accepts. Automaton has 24574 states and 36968 transitions. Word has length 101 [2019-10-03 03:01:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:45,341 INFO L475 AbstractCegarLoop]: Abstraction has 24574 states and 36968 transitions. [2019-10-03 03:01:45,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 24574 states and 36968 transitions. [2019-10-03 03:01:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-03 03:01:45,343 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:45,343 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:01:45,343 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:45,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:45,344 INFO L82 PathProgramCache]: Analyzing trace with hash -49972721, now seen corresponding path program 1 times [2019-10-03 03:01:45,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:45,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:01:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:45,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:45,419 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:45,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:45,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:45,420 INFO L87 Difference]: Start difference. First operand 24574 states and 36968 transitions. Second operand 3 states. [2019-10-03 03:01:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:46,987 INFO L93 Difference]: Finished difference Result 19569 states and 29154 transitions. [2019-10-03 03:01:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:46,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-03 03:01:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:47,004 INFO L225 Difference]: With dead ends: 19569 [2019-10-03 03:01:47,004 INFO L226 Difference]: Without dead ends: 19569 [2019-10-03 03:01:47,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2019-10-03 03:01:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19567. [2019-10-03 03:01:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19567 states. [2019-10-03 03:01:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29153 transitions. [2019-10-03 03:01:47,150 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29153 transitions. Word has length 117 [2019-10-03 03:01:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:47,151 INFO L475 AbstractCegarLoop]: Abstraction has 19567 states and 29153 transitions. [2019-10-03 03:01:47,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29153 transitions. [2019-10-03 03:01:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 03:01:47,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:47,154 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:47,154 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1357838781, now seen corresponding path program 1 times [2019-10-03 03:01:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:47,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:47,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:47,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:47,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:47,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:47,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:47,247 INFO L87 Difference]: Start difference. First operand 19567 states and 29153 transitions. Second operand 3 states. [2019-10-03 03:01:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:48,457 INFO L93 Difference]: Finished difference Result 17948 states and 26738 transitions. [2019-10-03 03:01:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:48,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-03 03:01:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:48,478 INFO L225 Difference]: With dead ends: 17948 [2019-10-03 03:01:48,478 INFO L226 Difference]: Without dead ends: 17948 [2019-10-03 03:01:48,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17948 states. [2019-10-03 03:01:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17948 to 17946. [2019-10-03 03:01:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17946 states. [2019-10-03 03:01:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17946 states to 17946 states and 26737 transitions. [2019-10-03 03:01:48,622 INFO L78 Accepts]: Start accepts. Automaton has 17946 states and 26737 transitions. Word has length 139 [2019-10-03 03:01:48,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:48,622 INFO L475 AbstractCegarLoop]: Abstraction has 17946 states and 26737 transitions. [2019-10-03 03:01:48,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 17946 states and 26737 transitions. [2019-10-03 03:01:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 03:01:48,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:48,625 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:48,626 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash -469109414, now seen corresponding path program 1 times [2019-10-03 03:01:48,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:48,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:48,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:48,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:48,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:48,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:48,712 INFO L87 Difference]: Start difference. First operand 17946 states and 26737 transitions. Second operand 3 states. [2019-10-03 03:01:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:49,921 INFO L93 Difference]: Finished difference Result 13062 states and 19303 transitions. [2019-10-03 03:01:49,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:49,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-03 03:01:49,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:49,934 INFO L225 Difference]: With dead ends: 13062 [2019-10-03 03:01:49,934 INFO L226 Difference]: Without dead ends: 13062 [2019-10-03 03:01:49,935 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2019-10-03 03:01:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 13060. [2019-10-03 03:01:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13060 states. [2019-10-03 03:01:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 19302 transitions. [2019-10-03 03:01:50,039 INFO L78 Accepts]: Start accepts. Automaton has 13060 states and 19302 transitions. Word has length 141 [2019-10-03 03:01:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:50,040 INFO L475 AbstractCegarLoop]: Abstraction has 13060 states and 19302 transitions. [2019-10-03 03:01:50,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13060 states and 19302 transitions. [2019-10-03 03:01:50,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 03:01:50,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:50,044 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:50,044 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:50,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:50,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1292728457, now seen corresponding path program 1 times [2019-10-03 03:01:50,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:50,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:50,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:50,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:50,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:50,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:50,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:50,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:50,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:50,134 INFO L87 Difference]: Start difference. First operand 13060 states and 19302 transitions. Second operand 3 states. [2019-10-03 03:01:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:51,366 INFO L93 Difference]: Finished difference Result 12419 states and 18337 transitions. [2019-10-03 03:01:51,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-10-03 03:01:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:51,381 INFO L225 Difference]: With dead ends: 12419 [2019-10-03 03:01:51,381 INFO L226 Difference]: Without dead ends: 12419 [2019-10-03 03:01:51,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12419 states. [2019-10-03 03:01:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12419 to 12417. [2019-10-03 03:01:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12417 states. [2019-10-03 03:01:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12417 states to 12417 states and 18336 transitions. [2019-10-03 03:01:51,488 INFO L78 Accepts]: Start accepts. Automaton has 12417 states and 18336 transitions. Word has length 147 [2019-10-03 03:01:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:51,488 INFO L475 AbstractCegarLoop]: Abstraction has 12417 states and 18336 transitions. [2019-10-03 03:01:51,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12417 states and 18336 transitions. [2019-10-03 03:01:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-03 03:01:51,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:51,491 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:51,492 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:51,492 INFO L82 PathProgramCache]: Analyzing trace with hash -892712196, now seen corresponding path program 1 times [2019-10-03 03:01:51,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:51,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:51,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:51,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:51,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:51,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:51,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:51,587 INFO L87 Difference]: Start difference. First operand 12417 states and 18336 transitions. Second operand 3 states. [2019-10-03 03:01:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:52,785 INFO L93 Difference]: Finished difference Result 12449 states and 18367 transitions. [2019-10-03 03:01:52,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:52,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-03 03:01:52,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:52,800 INFO L225 Difference]: With dead ends: 12449 [2019-10-03 03:01:52,800 INFO L226 Difference]: Without dead ends: 12449 [2019-10-03 03:01:52,801 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2019-10-03 03:01:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12447. [2019-10-03 03:01:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12447 states. [2019-10-03 03:01:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 18366 transitions. [2019-10-03 03:01:52,913 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 18366 transitions. Word has length 151 [2019-10-03 03:01:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:52,914 INFO L475 AbstractCegarLoop]: Abstraction has 12447 states and 18366 transitions. [2019-10-03 03:01:52,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 18366 transitions. [2019-10-03 03:01:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-03 03:01:52,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:52,919 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:52,919 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash -249022507, now seen corresponding path program 1 times [2019-10-03 03:01:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:52,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:53,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:53,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:53,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:53,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:53,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:53,365 INFO L87 Difference]: Start difference. First operand 12447 states and 18366 transitions. Second operand 3 states. [2019-10-03 03:01:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:54,350 INFO L93 Difference]: Finished difference Result 10121 states and 14917 transitions. [2019-10-03 03:01:54,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:54,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-03 03:01:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:54,361 INFO L225 Difference]: With dead ends: 10121 [2019-10-03 03:01:54,362 INFO L226 Difference]: Without dead ends: 10121 [2019-10-03 03:01:54,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10121 states. [2019-10-03 03:01:54,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10121 to 10119. [2019-10-03 03:01:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10119 states. [2019-10-03 03:01:54,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 14916 transitions. [2019-10-03 03:01:54,460 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 14916 transitions. Word has length 181 [2019-10-03 03:01:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:54,460 INFO L475 AbstractCegarLoop]: Abstraction has 10119 states and 14916 transitions. [2019-10-03 03:01:54,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 14916 transitions. [2019-10-03 03:01:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 03:01:54,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:54,465 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:54,466 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:54,466 INFO L82 PathProgramCache]: Analyzing trace with hash -337371091, now seen corresponding path program 1 times [2019-10-03 03:01:54,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:54,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:01:54,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 03:01:54,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:01:54,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:01:54,566 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:01:54,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:01:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:01:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:54,568 INFO L87 Difference]: Start difference. First operand 10119 states and 14916 transitions. Second operand 3 states. [2019-10-03 03:01:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:01:54,891 INFO L93 Difference]: Finished difference Result 2361 states and 3364 transitions. [2019-10-03 03:01:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:01:54,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-03 03:01:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:01:54,895 INFO L225 Difference]: With dead ends: 2361 [2019-10-03 03:01:54,896 INFO L226 Difference]: Without dead ends: 2361 [2019-10-03 03:01:54,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:01:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-10-03 03:01:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2019-10-03 03:01:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2019-10-03 03:01:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3363 transitions. [2019-10-03 03:01:54,921 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3363 transitions. Word has length 186 [2019-10-03 03:01:54,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:01:54,921 INFO L475 AbstractCegarLoop]: Abstraction has 2359 states and 3363 transitions. [2019-10-03 03:01:54,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:01:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3363 transitions. [2019-10-03 03:01:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 03:01:54,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:01:54,926 INFO L411 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:01:54,926 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:01:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:01:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1186012302, now seen corresponding path program 1 times [2019-10-03 03:01:54,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:01:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:01:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:01:54,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:01:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:01:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 03:01:55,381 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 03:01:55,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 03:01:55 BoogieIcfgContainer [2019-10-03 03:01:55,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 03:01:55,572 INFO L168 Benchmark]: Toolchain (without parser) took 148015.01 ms. Allocated memory was 173.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 102.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,572 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3721.69 ms. Allocated memory was 173.0 MB in the beginning and 471.3 MB in the end (delta: 298.3 MB). Free memory was 102.3 MB in the beginning and 214.3 MB in the end (delta: -112.1 MB). Peak memory consumption was 310.1 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,578 INFO L168 Benchmark]: Boogie Preprocessor took 908.44 ms. Allocated memory is still 471.3 MB. Free memory was 214.3 MB in the beginning and 75.1 MB in the end (delta: 139.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,581 INFO L168 Benchmark]: RCFGBuilder took 22208.75 ms. Allocated memory was 471.3 MB in the beginning and 1.0 GB in the end (delta: 564.7 MB). Free memory was 75.1 MB in the beginning and 371.6 MB in the end (delta: -296.5 MB). Peak memory consumption was 414.3 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,583 INFO L168 Benchmark]: TraceAbstraction took 121171.91 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 371.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 415.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:01:55,587 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 132.1 MB. Free memory was 106.3 MB in the beginning and 106.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3721.69 ms. Allocated memory was 173.0 MB in the beginning and 471.3 MB in the end (delta: 298.3 MB). Free memory was 102.3 MB in the beginning and 214.3 MB in the end (delta: -112.1 MB). Peak memory consumption was 310.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 908.44 ms. Allocated memory is still 471.3 MB. Free memory was 214.3 MB in the beginning and 75.1 MB in the end (delta: 139.2 MB). Peak memory consumption was 139.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 22208.75 ms. Allocated memory was 471.3 MB in the beginning and 1.0 GB in the end (delta: 564.7 MB). Free memory was 75.1 MB in the beginning and 371.6 MB in the end (delta: -296.5 MB). Peak memory consumption was 414.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 121171.91 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.6 GB). Free memory was 371.6 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 415.8 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=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, 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=1, P30=0, P4=1, P5=0, 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=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, 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=1, P30=0, P4=1, P5=0, 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=1, 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=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] [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=1, 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=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] [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=1, 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=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] [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=1, 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=1, 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=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=1, 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=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=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=1, 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=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=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=1, 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=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=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=1, 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=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=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=1, 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=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, 121.1s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 102.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 311046 SDtfs, 210874 SDslu, 193214 SDs, 0 SdLazy, 54890 SolverSat, 22069 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 77.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 30 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: 14.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 16312 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2072 ConstructedInterpolants, 0 QuantifiedInterpolants, 640910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 168/168 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...