java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 02:17:49,916 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 02:17:49,918 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 02:17:49,934 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 02:17:49,934 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 02:17:49,935 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 02:17:49,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 02:17:49,940 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 02:17:49,942 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 02:17:49,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 02:17:49,947 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 02:17:49,948 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 02:17:49,949 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 02:17:49,950 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 02:17:49,951 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 02:17:49,954 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 02:17:49,955 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 02:17:49,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 02:17:49,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 02:17:49,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 02:17:49,970 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 02:17:49,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 02:17:49,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 02:17:49,975 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 02:17:49,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 02:17:49,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 02:17:49,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 02:17:49,980 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 02:17:49,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 02:17:49,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 02:17:49,982 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 02:17:49,982 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 02:17:49,982 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 02:17:49,985 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 02:17:49,986 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 02:17:49,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 02:17:49,987 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 02:17:50,011 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 02:17:50,011 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 02:17:50,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 02:17:50,015 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 02:17:50,015 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 02:17:50,015 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 02:17:50,015 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 02:17:50,015 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 02:17:50,016 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 02:17:50,016 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 02:17:50,016 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 02:17:50,016 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 02:17:50,016 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 02:17:50,017 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 02:17:50,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 02:17:50,018 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 02:17:50,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 02:17:50,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 02:17:50,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 02:17:50,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 02:17:50,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 02:17:50,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 02:17:50,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 02:17:50,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 02:17:50,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 02:17:50,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 02:17:50,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 02:17:50,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 02:17:50,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 02:17:50,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 02:17:50,022 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 02:17:50,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 02:17:50,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 02:17:50,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 02:17:50,023 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 02:17:50,023 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 02:17:50,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 02:17:50,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 02:17:50,113 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 02:17:50,114 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 02:17:50,115 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 02:17:50,116 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-25 02:17:50,171 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b9f489ea/7c8ae3ffaf65464c8ca182a3a5dc14cb/FLAGcfbdf68d1 [2018-10-25 02:17:51,296 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 02:17:51,296 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/psyco/psyco_net_1_false-unreach-call_false-termination.c [2018-10-25 02:17:51,424 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b9f489ea/7c8ae3ffaf65464c8ca182a3a5dc14cb/FLAGcfbdf68d1 [2018-10-25 02:17:51,440 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/7b9f489ea/7c8ae3ffaf65464c8ca182a3a5dc14cb [2018-10-25 02:17:51,451 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 02:17:51,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 02:17:51,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:51,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 02:17:51,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 02:17:51,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:51" (1/1) ... [2018-10-25 02:17:51,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f02f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:51, skipping insertion in model container [2018-10-25 02:17:51,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 02:17:51" (1/1) ... [2018-10-25 02:17:51,475 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 02:17:52,132 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 02:17:53,810 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:53,817 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 02:17:55,078 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 02:17:55,096 INFO L193 MainTranslator]: Completed translation [2018-10-25 02:17:55,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55 WrapperNode [2018-10-25 02:17:55,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 02:17:55,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:55,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 02:17:55,098 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 02:17:55,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:55,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:55,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 02:17:55,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 02:17:55,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 02:17:55,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 02:17:55,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:55,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:55,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:55,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:56,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:56,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:56,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... [2018-10-25 02:17:56,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 02:17:56,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 02:17:56,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 02:17:56,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 02:17:56,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-25 02:17:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 02:17:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 02:17:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 02:17:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 02:17:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 02:17:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 02:18:21,093 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 02:18:21,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:18:21 BoogieIcfgContainer [2018-10-25 02:18:21,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 02:18:21,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 02:18:21,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 02:18:21,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 02:18:21,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 02:17:51" (1/3) ... [2018-10-25 02:18:21,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c995d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:18:21, skipping insertion in model container [2018-10-25 02:18:21,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 02:17:55" (2/3) ... [2018-10-25 02:18:21,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c995d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 02:18:21, skipping insertion in model container [2018-10-25 02:18:21,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 02:18:21" (3/3) ... [2018-10-25 02:18:21,103 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1_false-unreach-call_false-termination.c [2018-10-25 02:18:21,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 02:18:21,128 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 02:18:21,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 02:18:21,227 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 02:18:21,227 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 02:18:21,227 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 02:18:21,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 02:18:21,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 02:18:21,228 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 02:18:21,228 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 02:18:21,228 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 02:18:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 9216 states. [2018-10-25 02:18:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-25 02:18:21,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:21,385 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:21,388 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:21,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:21,395 INFO L82 PathProgramCache]: Analyzing trace with hash -178125889, now seen corresponding path program 1 times [2018-10-25 02:18:21,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:21,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:21,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:21,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:21,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:21,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-25 02:18:21,741 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:21,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-25 02:18:21,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-25 02:18:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-25 02:18:21,766 INFO L87 Difference]: Start difference. First operand 9216 states. Second operand 2 states. [2018-10-25 02:18:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:22,404 INFO L93 Difference]: Finished difference Result 17704 states and 35386 transitions. [2018-10-25 02:18:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-25 02:18:22,406 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-10-25 02:18:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:22,484 INFO L225 Difference]: With dead ends: 17704 [2018-10-25 02:18:22,484 INFO L226 Difference]: Without dead ends: 8284 [2018-10-25 02:18:22,506 INFO L605 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 [2018-10-25 02:18:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2018-10-25 02:18:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2018-10-25 02:18:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2018-10-25 02:18:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 13001 transitions. [2018-10-25 02:18:22,824 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 13001 transitions. Word has length 13 [2018-10-25 02:18:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:22,825 INFO L481 AbstractCegarLoop]: Abstraction has 8284 states and 13001 transitions. [2018-10-25 02:18:22,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-25 02:18:22,825 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 13001 transitions. [2018-10-25 02:18:22,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-25 02:18:22,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:22,826 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:22,828 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:22,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash -695873763, now seen corresponding path program 1 times [2018-10-25 02:18:22,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:22,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:22,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:22,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:23,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:23,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:23,014 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:23,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:23,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:23,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:23,019 INFO L87 Difference]: Start difference. First operand 8284 states and 13001 transitions. Second operand 3 states. [2018-10-25 02:18:27,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:27,098 INFO L93 Difference]: Finished difference Result 16565 states and 26000 transitions. [2018-10-25 02:18:27,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:27,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-10-25 02:18:27,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:27,147 INFO L225 Difference]: With dead ends: 16565 [2018-10-25 02:18:27,147 INFO L226 Difference]: Without dead ends: 8287 [2018-10-25 02:18:27,172 INFO L605 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 [2018-10-25 02:18:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2018-10-25 02:18:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8287. [2018-10-25 02:18:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8287 states. [2018-10-25 02:18:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 13004 transitions. [2018-10-25 02:18:27,345 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 13004 transitions. Word has length 14 [2018-10-25 02:18:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:27,346 INFO L481 AbstractCegarLoop]: Abstraction has 8287 states and 13004 transitions. [2018-10-25 02:18:27,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 13004 transitions. [2018-10-25 02:18:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-25 02:18:27,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:27,347 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:27,348 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:27,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:27,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1850457314, now seen corresponding path program 1 times [2018-10-25 02:18:27,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:27,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:27,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:27,350 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:27,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:27,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:27,471 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:27,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:27,472 INFO L87 Difference]: Start difference. First operand 8287 states and 13004 transitions. Second operand 3 states. [2018-10-25 02:18:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:31,918 INFO L93 Difference]: Finished difference Result 16460 states and 25849 transitions. [2018-10-25 02:18:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:31,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-25 02:18:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:31,961 INFO L225 Difference]: With dead ends: 16460 [2018-10-25 02:18:31,961 INFO L226 Difference]: Without dead ends: 8180 [2018-10-25 02:18:31,978 INFO L605 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 [2018-10-25 02:18:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2018-10-25 02:18:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8180. [2018-10-25 02:18:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8180 states. [2018-10-25 02:18:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8180 states to 8180 states and 12850 transitions. [2018-10-25 02:18:32,156 INFO L78 Accepts]: Start accepts. Automaton has 8180 states and 12850 transitions. Word has length 19 [2018-10-25 02:18:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:32,157 INFO L481 AbstractCegarLoop]: Abstraction has 8180 states and 12850 transitions. [2018-10-25 02:18:32,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 8180 states and 12850 transitions. [2018-10-25 02:18:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-25 02:18:32,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:32,159 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:32,159 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:32,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:32,161 INFO L82 PathProgramCache]: Analyzing trace with hash -913299057, now seen corresponding path program 1 times [2018-10-25 02:18:32,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:32,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:32,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:32,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:32,163 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:32,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:32,296 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:32,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:32,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:32,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:32,297 INFO L87 Difference]: Start difference. First operand 8180 states and 12850 transitions. Second operand 3 states. [2018-10-25 02:18:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:37,335 INFO L93 Difference]: Finished difference Result 16268 states and 25567 transitions. [2018-10-25 02:18:37,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:37,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-25 02:18:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:37,370 INFO L225 Difference]: With dead ends: 16268 [2018-10-25 02:18:37,371 INFO L226 Difference]: Without dead ends: 8060 [2018-10-25 02:18:37,385 INFO L605 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 [2018-10-25 02:18:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8060 states. [2018-10-25 02:18:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8060 to 8060. [2018-10-25 02:18:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8060 states. [2018-10-25 02:18:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8060 states to 8060 states and 12230 transitions. [2018-10-25 02:18:37,937 INFO L78 Accepts]: Start accepts. Automaton has 8060 states and 12230 transitions. Word has length 23 [2018-10-25 02:18:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:37,938 INFO L481 AbstractCegarLoop]: Abstraction has 8060 states and 12230 transitions. [2018-10-25 02:18:37,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 8060 states and 12230 transitions. [2018-10-25 02:18:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-25 02:18:37,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:37,942 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:37,942 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:37,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380717, now seen corresponding path program 1 times [2018-10-25 02:18:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:37,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:37,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:38,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:38,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:38,055 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:38,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:38,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:38,056 INFO L87 Difference]: Start difference. First operand 8060 states and 12230 transitions. Second operand 3 states. [2018-10-25 02:18:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:40,906 INFO L93 Difference]: Finished difference Result 16114 states and 24453 transitions. [2018-10-25 02:18:40,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:40,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-25 02:18:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:40,933 INFO L225 Difference]: With dead ends: 16114 [2018-10-25 02:18:40,934 INFO L226 Difference]: Without dead ends: 8066 [2018-10-25 02:18:40,947 INFO L605 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 [2018-10-25 02:18:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8066 states. [2018-10-25 02:18:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8066 to 8064. [2018-10-25 02:18:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8064 states. [2018-10-25 02:18:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8064 states to 8064 states and 12234 transitions. [2018-10-25 02:18:41,078 INFO L78 Accepts]: Start accepts. Automaton has 8064 states and 12234 transitions. Word has length 26 [2018-10-25 02:18:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:41,078 INFO L481 AbstractCegarLoop]: Abstraction has 8064 states and 12234 transitions. [2018-10-25 02:18:41,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:41,078 INFO L276 IsEmpty]: Start isEmpty. Operand 8064 states and 12234 transitions. [2018-10-25 02:18:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-25 02:18:41,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:41,080 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:41,080 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:41,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:41,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2018574225, now seen corresponding path program 1 times [2018-10-25 02:18:41,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:41,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:41,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:41,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:41,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:41,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:41,177 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:41,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:41,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:41,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:41,178 INFO L87 Difference]: Start difference. First operand 8064 states and 12234 transitions. Second operand 3 states. [2018-10-25 02:18:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:45,942 INFO L93 Difference]: Finished difference Result 24168 states and 36676 transitions. [2018-10-25 02:18:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:45,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-25 02:18:45,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:45,977 INFO L225 Difference]: With dead ends: 24168 [2018-10-25 02:18:45,978 INFO L226 Difference]: Without dead ends: 16068 [2018-10-25 02:18:45,995 INFO L605 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 [2018-10-25 02:18:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16068 states. [2018-10-25 02:18:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16068 to 14810. [2018-10-25 02:18:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14810 states. [2018-10-25 02:18:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14810 states to 14810 states and 23046 transitions. [2018-10-25 02:18:46,300 INFO L78 Accepts]: Start accepts. Automaton has 14810 states and 23046 transitions. Word has length 27 [2018-10-25 02:18:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:46,301 INFO L481 AbstractCegarLoop]: Abstraction has 14810 states and 23046 transitions. [2018-10-25 02:18:46,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14810 states and 23046 transitions. [2018-10-25 02:18:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-25 02:18:46,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:46,302 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:46,302 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:46,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1797395328, now seen corresponding path program 1 times [2018-10-25 02:18:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:46,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:46,304 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:46,454 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:46,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:46,455 INFO L87 Difference]: Start difference. First operand 14810 states and 23046 transitions. Second operand 3 states. [2018-10-25 02:18:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:18:55,082 INFO L93 Difference]: Finished difference Result 37340 states and 57908 transitions. [2018-10-25 02:18:55,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:18:55,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-25 02:18:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:18:55,124 INFO L225 Difference]: With dead ends: 37340 [2018-10-25 02:18:55,124 INFO L226 Difference]: Without dead ends: 22270 [2018-10-25 02:18:55,150 INFO L605 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 [2018-10-25 02:18:55,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22270 states. [2018-10-25 02:18:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22270 to 21076. [2018-10-25 02:18:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21076 states. [2018-10-25 02:18:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21076 states to 21076 states and 32688 transitions. [2018-10-25 02:18:55,467 INFO L78 Accepts]: Start accepts. Automaton has 21076 states and 32688 transitions. Word has length 29 [2018-10-25 02:18:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:18:55,467 INFO L481 AbstractCegarLoop]: Abstraction has 21076 states and 32688 transitions. [2018-10-25 02:18:55,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:18:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 21076 states and 32688 transitions. [2018-10-25 02:18:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-25 02:18:55,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:18:55,469 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:18:55,469 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:18:55,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:18:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash -922430293, now seen corresponding path program 1 times [2018-10-25 02:18:55,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:18:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:55,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:18:55,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:18:55,471 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:18:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:18:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:18:55,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:18:55,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:18:55,620 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:18:55,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:18:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:18:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:18:55,621 INFO L87 Difference]: Start difference. First operand 21076 states and 32688 transitions. Second operand 3 states. [2018-10-25 02:19:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:03,657 INFO L93 Difference]: Finished difference Result 63174 states and 97978 transitions. [2018-10-25 02:19:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:03,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-25 02:19:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:03,799 INFO L225 Difference]: With dead ends: 63174 [2018-10-25 02:19:03,799 INFO L226 Difference]: Without dead ends: 42110 [2018-10-25 02:19:03,832 INFO L605 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 [2018-10-25 02:19:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42110 states. [2018-10-25 02:19:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42110 to 40084. [2018-10-25 02:19:04,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40084 states. [2018-10-25 02:19:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40084 states to 40084 states and 63062 transitions. [2018-10-25 02:19:04,399 INFO L78 Accepts]: Start accepts. Automaton has 40084 states and 63062 transitions. Word has length 34 [2018-10-25 02:19:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:04,399 INFO L481 AbstractCegarLoop]: Abstraction has 40084 states and 63062 transitions. [2018-10-25 02:19:04,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 40084 states and 63062 transitions. [2018-10-25 02:19:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-25 02:19:04,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:04,401 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:04,401 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:04,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1813209489, now seen corresponding path program 1 times [2018-10-25 02:19:04,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:04,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:04,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:04,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:04,403 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:19:04,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:04,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:04,518 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:04,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:04,519 INFO L87 Difference]: Start difference. First operand 40084 states and 63062 transitions. Second operand 3 states. [2018-10-25 02:19:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:09,340 INFO L93 Difference]: Finished difference Result 107946 states and 170048 transitions. [2018-10-25 02:19:09,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:09,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-10-25 02:19:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:09,457 INFO L225 Difference]: With dead ends: 107946 [2018-10-25 02:19:09,457 INFO L226 Difference]: Without dead ends: 67826 [2018-10-25 02:19:09,510 INFO L605 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 [2018-10-25 02:19:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67826 states. [2018-10-25 02:19:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67826 to 66152. [2018-10-25 02:19:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66152 states. [2018-10-25 02:19:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66152 states to 66152 states and 104782 transitions. [2018-10-25 02:19:10,349 INFO L78 Accepts]: Start accepts. Automaton has 66152 states and 104782 transitions. Word has length 43 [2018-10-25 02:19:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:10,350 INFO L481 AbstractCegarLoop]: Abstraction has 66152 states and 104782 transitions. [2018-10-25 02:19:10,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 66152 states and 104782 transitions. [2018-10-25 02:19:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-25 02:19:10,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:10,351 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:10,351 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:10,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1800711001, now seen corresponding path program 1 times [2018-10-25 02:19:10,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:10,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:10,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:10,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:19:10,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:10,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:10,470 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:10,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:10,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:10,472 INFO L87 Difference]: Start difference. First operand 66152 states and 104782 transitions. Second operand 3 states. [2018-10-25 02:19:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:12,508 INFO L93 Difference]: Finished difference Result 132344 states and 209622 transitions. [2018-10-25 02:19:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:12,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-25 02:19:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:12,619 INFO L225 Difference]: With dead ends: 132344 [2018-10-25 02:19:12,619 INFO L226 Difference]: Without dead ends: 66204 [2018-10-25 02:19:12,696 INFO L605 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 [2018-10-25 02:19:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66204 states. [2018-10-25 02:19:13,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66204 to 66202. [2018-10-25 02:19:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66202 states. [2018-10-25 02:19:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66202 states to 66202 states and 104832 transitions. [2018-10-25 02:19:13,492 INFO L78 Accepts]: Start accepts. Automaton has 66202 states and 104832 transitions. Word has length 47 [2018-10-25 02:19:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:13,493 INFO L481 AbstractCegarLoop]: Abstraction has 66202 states and 104832 transitions. [2018-10-25 02:19:13,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 66202 states and 104832 transitions. [2018-10-25 02:19:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-25 02:19:13,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:13,494 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:13,494 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:13,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1274321111, now seen corresponding path program 1 times [2018-10-25 02:19:13,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:13,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:13,496 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:19:13,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:13,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:19:13,762 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:13,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:19:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:19:13,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:19:13,763 INFO L87 Difference]: Start difference. First operand 66202 states and 104832 transitions. Second operand 4 states. [2018-10-25 02:19:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:22,212 INFO L93 Difference]: Finished difference Result 126789 states and 200689 transitions. [2018-10-25 02:19:22,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:19:22,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-10-25 02:19:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:22,312 INFO L225 Difference]: With dead ends: 126789 [2018-10-25 02:19:22,312 INFO L226 Difference]: Without dead ends: 66496 [2018-10-25 02:19:22,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:19:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66496 states. [2018-10-25 02:19:22,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66496 to 63922. [2018-10-25 02:19:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63922 states. [2018-10-25 02:19:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63922 states to 63922 states and 99852 transitions. [2018-10-25 02:19:23,080 INFO L78 Accepts]: Start accepts. Automaton has 63922 states and 99852 transitions. Word has length 56 [2018-10-25 02:19:23,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:23,080 INFO L481 AbstractCegarLoop]: Abstraction has 63922 states and 99852 transitions. [2018-10-25 02:19:23,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:19:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 63922 states and 99852 transitions. [2018-10-25 02:19:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-25 02:19:23,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:23,081 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:23,081 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:23,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash -873438985, now seen corresponding path program 1 times [2018-10-25 02:19:23,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:23,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:23,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:23,083 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:19:23,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:23,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:23,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:23,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:23,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:23,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:23,183 INFO L87 Difference]: Start difference. First operand 63922 states and 99852 transitions. Second operand 3 states. [2018-10-25 02:19:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:25,249 INFO L93 Difference]: Finished difference Result 127894 states and 199782 transitions. [2018-10-25 02:19:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:25,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-10-25 02:19:25,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:25,356 INFO L225 Difference]: With dead ends: 127894 [2018-10-25 02:19:25,356 INFO L226 Difference]: Without dead ends: 63984 [2018-10-25 02:19:25,420 INFO L605 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 [2018-10-25 02:19:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63984 states. [2018-10-25 02:19:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63984 to 63982. [2018-10-25 02:19:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63982 states. [2018-10-25 02:19:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63982 states to 63982 states and 99912 transitions. [2018-10-25 02:19:26,533 INFO L78 Accepts]: Start accepts. Automaton has 63982 states and 99912 transitions. Word has length 57 [2018-10-25 02:19:26,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:26,534 INFO L481 AbstractCegarLoop]: Abstraction has 63982 states and 99912 transitions. [2018-10-25 02:19:26,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:26,534 INFO L276 IsEmpty]: Start isEmpty. Operand 63982 states and 99912 transitions. [2018-10-25 02:19:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-25 02:19:26,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:26,535 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:26,535 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:26,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash -781795417, now seen corresponding path program 1 times [2018-10-25 02:19:26,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:26,537 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:19:26,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:26,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:19:26,696 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:26,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:19:26,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:19:26,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:19:26,697 INFO L87 Difference]: Start difference. First operand 63982 states and 99912 transitions. Second operand 4 states. [2018-10-25 02:19:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:32,426 INFO L93 Difference]: Finished difference Result 116802 states and 181842 transitions. [2018-10-25 02:19:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:32,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-10-25 02:19:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:32,512 INFO L225 Difference]: With dead ends: 116802 [2018-10-25 02:19:32,513 INFO L226 Difference]: Without dead ends: 64992 [2018-10-25 02:19:32,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:19:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64992 states. [2018-10-25 02:19:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64992 to 63726. [2018-10-25 02:19:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63726 states. [2018-10-25 02:19:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63726 states to 63726 states and 98888 transitions. [2018-10-25 02:19:33,199 INFO L78 Accepts]: Start accepts. Automaton has 63726 states and 98888 transitions. Word has length 62 [2018-10-25 02:19:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:33,199 INFO L481 AbstractCegarLoop]: Abstraction has 63726 states and 98888 transitions. [2018-10-25 02:19:33,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:19:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 63726 states and 98888 transitions. [2018-10-25 02:19:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-25 02:19:33,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:33,201 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:33,201 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:33,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash 344861948, now seen corresponding path program 1 times [2018-10-25 02:19:33,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:33,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:33,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:33,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:19:33,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:33,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:33,356 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:33,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:33,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:33,358 INFO L87 Difference]: Start difference. First operand 63726 states and 98888 transitions. Second operand 3 states. [2018-10-25 02:19:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:39,929 INFO L93 Difference]: Finished difference Result 129854 states and 200368 transitions. [2018-10-25 02:19:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:39,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-10-25 02:19:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:40,015 INFO L225 Difference]: With dead ends: 129854 [2018-10-25 02:19:40,016 INFO L226 Difference]: Without dead ends: 66100 [2018-10-25 02:19:40,072 INFO L605 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 [2018-10-25 02:19:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66100 states. [2018-10-25 02:19:40,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66100 to 63406. [2018-10-25 02:19:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63406 states. [2018-10-25 02:19:40,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63406 states to 63406 states and 98168 transitions. [2018-10-25 02:19:40,682 INFO L78 Accepts]: Start accepts. Automaton has 63406 states and 98168 transitions. Word has length 68 [2018-10-25 02:19:40,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:40,683 INFO L481 AbstractCegarLoop]: Abstraction has 63406 states and 98168 transitions. [2018-10-25 02:19:40,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:40,683 INFO L276 IsEmpty]: Start isEmpty. Operand 63406 states and 98168 transitions. [2018-10-25 02:19:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-25 02:19:40,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:40,686 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:40,687 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:40,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2088965043, now seen corresponding path program 1 times [2018-10-25 02:19:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:40,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:40,688 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:19:40,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:40,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:40,886 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:40,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:40,887 INFO L87 Difference]: Start difference. First operand 63406 states and 98168 transitions. Second operand 3 states. [2018-10-25 02:19:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:48,241 INFO L93 Difference]: Finished difference Result 91362 states and 140322 transitions. [2018-10-25 02:19:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:48,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-25 02:19:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:48,329 INFO L225 Difference]: With dead ends: 91362 [2018-10-25 02:19:48,329 INFO L226 Difference]: Without dead ends: 64712 [2018-10-25 02:19:48,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64712 states. [2018-10-25 02:19:48,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64712 to 63414. [2018-10-25 02:19:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63414 states. [2018-10-25 02:19:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63414 states to 63414 states and 98096 transitions. [2018-10-25 02:19:49,020 INFO L78 Accepts]: Start accepts. Automaton has 63414 states and 98096 transitions. Word has length 78 [2018-10-25 02:19:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:49,020 INFO L481 AbstractCegarLoop]: Abstraction has 63414 states and 98096 transitions. [2018-10-25 02:19:49,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 63414 states and 98096 transitions. [2018-10-25 02:19:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-25 02:19:49,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:49,022 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:49,023 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:49,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1526478923, now seen corresponding path program 1 times [2018-10-25 02:19:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:49,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:49,024 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:19:49,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:49,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:49,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:49,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:49,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:49,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:49,134 INFO L87 Difference]: Start difference. First operand 63414 states and 98096 transitions. Second operand 3 states. [2018-10-25 02:19:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:50,843 INFO L93 Difference]: Finished difference Result 121049 states and 187242 transitions. [2018-10-25 02:19:50,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:50,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-10-25 02:19:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:50,945 INFO L225 Difference]: With dead ends: 121049 [2018-10-25 02:19:50,945 INFO L226 Difference]: Without dead ends: 57647 [2018-10-25 02:19:51,020 INFO L605 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 [2018-10-25 02:19:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57647 states. [2018-10-25 02:19:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57647 to 57645. [2018-10-25 02:19:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57645 states. [2018-10-25 02:19:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57645 states to 57645 states and 89118 transitions. [2018-10-25 02:19:51,694 INFO L78 Accepts]: Start accepts. Automaton has 57645 states and 89118 transitions. Word has length 85 [2018-10-25 02:19:51,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:51,694 INFO L481 AbstractCegarLoop]: Abstraction has 57645 states and 89118 transitions. [2018-10-25 02:19:51,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 57645 states and 89118 transitions. [2018-10-25 02:19:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-25 02:19:51,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:51,696 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:51,696 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:51,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:51,696 INFO L82 PathProgramCache]: Analyzing trace with hash -836452376, now seen corresponding path program 1 times [2018-10-25 02:19:51,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:51,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:51,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:51,697 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:19:51,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:19:51,829 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:51,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:19:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:19:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:19:51,830 INFO L87 Difference]: Start difference. First operand 57645 states and 89118 transitions. Second operand 3 states. [2018-10-25 02:19:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:19:54,363 INFO L93 Difference]: Finished difference Result 114970 states and 177752 transitions. [2018-10-25 02:19:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:19:54,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-10-25 02:19:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:19:54,439 INFO L225 Difference]: With dead ends: 114970 [2018-10-25 02:19:54,440 INFO L226 Difference]: Without dead ends: 57727 [2018-10-25 02:19:54,489 INFO L605 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 [2018-10-25 02:19:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57727 states. [2018-10-25 02:19:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57727 to 57725. [2018-10-25 02:19:54,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57725 states. [2018-10-25 02:19:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57725 states to 57725 states and 89198 transitions. [2018-10-25 02:19:55,037 INFO L78 Accepts]: Start accepts. Automaton has 57725 states and 89198 transitions. Word has length 88 [2018-10-25 02:19:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:19:55,037 INFO L481 AbstractCegarLoop]: Abstraction has 57725 states and 89198 transitions. [2018-10-25 02:19:55,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:19:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57725 states and 89198 transitions. [2018-10-25 02:19:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-25 02:19:55,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:19:55,039 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:19:55,039 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:19:55,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:19:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash -435648167, now seen corresponding path program 1 times [2018-10-25 02:19:55,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:19:55,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:55,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:19:55,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:19:55,041 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:19:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:19:55,395 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-25 02:19:55,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:19:55,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:19:55,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:19:55,423 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:19:55,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:19:55,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:19:55,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:19:55,424 INFO L87 Difference]: Start difference. First operand 57725 states and 89198 transitions. Second operand 4 states. [2018-10-25 02:20:02,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:02,480 INFO L93 Difference]: Finished difference Result 82683 states and 126801 transitions. [2018-10-25 02:20:02,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:20:02,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-10-25 02:20:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:02,526 INFO L225 Difference]: With dead ends: 82683 [2018-10-25 02:20:02,526 INFO L226 Difference]: Without dead ends: 36254 [2018-10-25 02:20:02,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:20:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36254 states. [2018-10-25 02:20:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36254 to 35103. [2018-10-25 02:20:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35103 states. [2018-10-25 02:20:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35103 states to 35103 states and 53387 transitions. [2018-10-25 02:20:03,406 INFO L78 Accepts]: Start accepts. Automaton has 35103 states and 53387 transitions. Word has length 92 [2018-10-25 02:20:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:03,406 INFO L481 AbstractCegarLoop]: Abstraction has 35103 states and 53387 transitions. [2018-10-25 02:20:03,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:20:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35103 states and 53387 transitions. [2018-10-25 02:20:03,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-25 02:20:03,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:03,408 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:03,408 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:03,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:03,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1691319959, now seen corresponding path program 1 times [2018-10-25 02:20:03,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:03,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:03,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:03,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:03,410 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:20:03,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:03,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-25 02:20:03,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:03,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-25 02:20:03,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-25 02:20:03,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-25 02:20:03,595 INFO L87 Difference]: Start difference. First operand 35103 states and 53387 transitions. Second operand 4 states. [2018-10-25 02:20:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:10,748 INFO L93 Difference]: Finished difference Result 48621 states and 72992 transitions. [2018-10-25 02:20:10,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 02:20:10,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-25 02:20:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:10,778 INFO L225 Difference]: With dead ends: 48621 [2018-10-25 02:20:10,778 INFO L226 Difference]: Without dead ends: 24954 [2018-10-25 02:20:10,804 INFO L605 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 [2018-10-25 02:20:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24954 states. [2018-10-25 02:20:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24954 to 23803. [2018-10-25 02:20:10,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23803 states. [2018-10-25 02:20:11,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23803 states to 23803 states and 35865 transitions. [2018-10-25 02:20:11,024 INFO L78 Accepts]: Start accepts. Automaton has 23803 states and 35865 transitions. Word has length 94 [2018-10-25 02:20:11,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:11,025 INFO L481 AbstractCegarLoop]: Abstraction has 23803 states and 35865 transitions. [2018-10-25 02:20:11,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-25 02:20:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23803 states and 35865 transitions. [2018-10-25 02:20:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-25 02:20:11,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:11,026 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:11,026 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:11,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash -722433105, now seen corresponding path program 1 times [2018-10-25 02:20:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:11,028 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 02:20:11,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:11,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:11,137 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:11,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:11,138 INFO L87 Difference]: Start difference. First operand 23803 states and 35865 transitions. Second operand 3 states. [2018-10-25 02:20:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:12,568 INFO L93 Difference]: Finished difference Result 24578 states and 36978 transitions. [2018-10-25 02:20:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:12,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-10-25 02:20:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:12,595 INFO L225 Difference]: With dead ends: 24578 [2018-10-25 02:20:12,595 INFO L226 Difference]: Without dead ends: 24576 [2018-10-25 02:20:12,604 INFO L605 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 [2018-10-25 02:20:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24576 states. [2018-10-25 02:20:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24576 to 24574. [2018-10-25 02:20:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24574 states. [2018-10-25 02:20:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24574 states to 24574 states and 36968 transitions. [2018-10-25 02:20:13,107 INFO L78 Accepts]: Start accepts. Automaton has 24574 states and 36968 transitions. Word has length 102 [2018-10-25 02:20:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:13,108 INFO L481 AbstractCegarLoop]: Abstraction has 24574 states and 36968 transitions. [2018-10-25 02:20:13,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 24574 states and 36968 transitions. [2018-10-25 02:20:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-25 02:20:13,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:13,110 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:13,111 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:13,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 796189882, now seen corresponding path program 1 times [2018-10-25 02:20:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:13,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:13,112 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-25 02:20:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:13,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:13,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:13,211 INFO L87 Difference]: Start difference. First operand 24574 states and 36968 transitions. Second operand 3 states. [2018-10-25 02:20:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:14,387 INFO L93 Difference]: Finished difference Result 42970 states and 64452 transitions. [2018-10-25 02:20:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:14,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2018-10-25 02:20:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:14,410 INFO L225 Difference]: With dead ends: 42970 [2018-10-25 02:20:14,410 INFO L226 Difference]: Without dead ends: 19569 [2018-10-25 02:20:14,433 INFO L605 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 [2018-10-25 02:20:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19569 states. [2018-10-25 02:20:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19569 to 19567. [2018-10-25 02:20:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19567 states. [2018-10-25 02:20:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19567 states to 19567 states and 29153 transitions. [2018-10-25 02:20:14,607 INFO L78 Accepts]: Start accepts. Automaton has 19567 states and 29153 transitions. Word has length 118 [2018-10-25 02:20:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:14,607 INFO L481 AbstractCegarLoop]: Abstraction has 19567 states and 29153 transitions. [2018-10-25 02:20:14,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19567 states and 29153 transitions. [2018-10-25 02:20:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-25 02:20:14,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:14,611 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:14,611 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:14,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash -90640293, now seen corresponding path program 1 times [2018-10-25 02:20:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:14,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:14,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:14,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:14,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:14,740 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:14,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:14,741 INFO L87 Difference]: Start difference. First operand 19567 states and 29153 transitions. Second operand 3 states. [2018-10-25 02:20:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:16,037 INFO L93 Difference]: Finished difference Result 36152 states and 53948 transitions. [2018-10-25 02:20:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:16,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2018-10-25 02:20:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:16,059 INFO L225 Difference]: With dead ends: 36152 [2018-10-25 02:20:16,059 INFO L226 Difference]: Without dead ends: 17948 [2018-10-25 02:20:16,077 INFO L605 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 [2018-10-25 02:20:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17948 states. [2018-10-25 02:20:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17948 to 17946. [2018-10-25 02:20:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17946 states. [2018-10-25 02:20:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17946 states to 17946 states and 26737 transitions. [2018-10-25 02:20:16,239 INFO L78 Accepts]: Start accepts. Automaton has 17946 states and 26737 transitions. Word has length 140 [2018-10-25 02:20:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:16,240 INFO L481 AbstractCegarLoop]: Abstraction has 17946 states and 26737 transitions. [2018-10-25 02:20:16,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:16,240 INFO L276 IsEmpty]: Start isEmpty. Operand 17946 states and 26737 transitions. [2018-10-25 02:20:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-25 02:20:16,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:16,243 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:16,243 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:16,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -888095592, now seen corresponding path program 1 times [2018-10-25 02:20:16,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:16,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:16,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:16,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:16,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:16,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:16,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:16,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:16,371 INFO L87 Difference]: Start difference. First operand 17946 states and 26737 transitions. Second operand 3 states. [2018-10-25 02:20:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:17,523 INFO L93 Difference]: Finished difference Result 29254 states and 43532 transitions. [2018-10-25 02:20:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:17,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2018-10-25 02:20:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:17,537 INFO L225 Difference]: With dead ends: 29254 [2018-10-25 02:20:17,538 INFO L226 Difference]: Without dead ends: 13062 [2018-10-25 02:20:17,552 INFO L605 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 [2018-10-25 02:20:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13062 states. [2018-10-25 02:20:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13062 to 13060. [2018-10-25 02:20:17,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13060 states. [2018-10-25 02:20:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 19302 transitions. [2018-10-25 02:20:17,666 INFO L78 Accepts]: Start accepts. Automaton has 13060 states and 19302 transitions. Word has length 142 [2018-10-25 02:20:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:17,666 INFO L481 AbstractCegarLoop]: Abstraction has 13060 states and 19302 transitions. [2018-10-25 02:20:17,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13060 states and 19302 transitions. [2018-10-25 02:20:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-25 02:20:17,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:17,669 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:17,669 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:17,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1774201195, now seen corresponding path program 1 times [2018-10-25 02:20:17,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:17,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:17,671 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:17,799 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:17,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:17,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:17,800 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:17,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:17,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:17,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:17,801 INFO L87 Difference]: Start difference. First operand 13060 states and 19302 transitions. Second operand 3 states. [2018-10-25 02:20:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:18,959 INFO L93 Difference]: Finished difference Result 23530 states and 34857 transitions. [2018-10-25 02:20:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:18,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2018-10-25 02:20:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:18,973 INFO L225 Difference]: With dead ends: 23530 [2018-10-25 02:20:18,973 INFO L226 Difference]: Without dead ends: 12419 [2018-10-25 02:20:18,985 INFO L605 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 [2018-10-25 02:20:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12419 states. [2018-10-25 02:20:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12419 to 12417. [2018-10-25 02:20:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12417 states. [2018-10-25 02:20:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12417 states to 12417 states and 18336 transitions. [2018-10-25 02:20:19,096 INFO L78 Accepts]: Start accepts. Automaton has 12417 states and 18336 transitions. Word has length 148 [2018-10-25 02:20:19,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:19,096 INFO L481 AbstractCegarLoop]: Abstraction has 12417 states and 18336 transitions. [2018-10-25 02:20:19,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 12417 states and 18336 transitions. [2018-10-25 02:20:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-25 02:20:19,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:19,099 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:19,099 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:19,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:19,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1702931622, now seen corresponding path program 1 times [2018-10-25 02:20:19,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:19,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:19,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:19,101 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:19,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:19,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:19,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:19,232 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:19,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:19,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:19,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:19,233 INFO L87 Difference]: Start difference. First operand 12417 states and 18336 transitions. Second operand 3 states. [2018-10-25 02:20:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:20,740 INFO L93 Difference]: Finished difference Result 22917 states and 33915 transitions. [2018-10-25 02:20:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:20,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2018-10-25 02:20:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:20,756 INFO L225 Difference]: With dead ends: 22917 [2018-10-25 02:20:20,756 INFO L226 Difference]: Without dead ends: 12449 [2018-10-25 02:20:20,766 INFO L605 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 [2018-10-25 02:20:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2018-10-25 02:20:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 12447. [2018-10-25 02:20:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12447 states. [2018-10-25 02:20:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 18366 transitions. [2018-10-25 02:20:20,887 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 18366 transitions. Word has length 152 [2018-10-25 02:20:20,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:20,888 INFO L481 AbstractCegarLoop]: Abstraction has 12447 states and 18366 transitions. [2018-10-25 02:20:20,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 18366 transitions. [2018-10-25 02:20:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-25 02:20:20,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:20,891 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:20,892 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:20,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1745923923, now seen corresponding path program 1 times [2018-10-25 02:20:20,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:20,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:20,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:20,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:20,893 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:21,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:21,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:21,042 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:21,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:21,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:21,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:21,043 INFO L87 Difference]: Start difference. First operand 12447 states and 18366 transitions. Second operand 3 states. [2018-10-25 02:20:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:22,259 INFO L93 Difference]: Finished difference Result 20619 states and 30503 transitions. [2018-10-25 02:20:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:22,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2018-10-25 02:20:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:22,268 INFO L225 Difference]: With dead ends: 20619 [2018-10-25 02:20:22,269 INFO L226 Difference]: Without dead ends: 10121 [2018-10-25 02:20:22,278 INFO L605 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 [2018-10-25 02:20:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10121 states. [2018-10-25 02:20:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10121 to 10119. [2018-10-25 02:20:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10119 states. [2018-10-25 02:20:22,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10119 states to 10119 states and 14916 transitions. [2018-10-25 02:20:22,376 INFO L78 Accepts]: Start accepts. Automaton has 10119 states and 14916 transitions. Word has length 182 [2018-10-25 02:20:22,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:22,376 INFO L481 AbstractCegarLoop]: Abstraction has 10119 states and 14916 transitions. [2018-10-25 02:20:22,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10119 states and 14916 transitions. [2018-10-25 02:20:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-25 02:20:22,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:22,379 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:22,379 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:22,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1841248048, now seen corresponding path program 1 times [2018-10-25 02:20:22,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:22,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:22,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:22,381 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 02:20:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-25 02:20:22,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 02:20:22,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 02:20:22,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 02:20:22,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 02:20:22,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 02:20:22,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 02:20:22,522 INFO L87 Difference]: Start difference. First operand 10119 states and 14916 transitions. Second operand 3 states. [2018-10-25 02:20:22,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 02:20:22,936 INFO L93 Difference]: Finished difference Result 10525 states and 15485 transitions. [2018-10-25 02:20:22,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 02:20:22,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2018-10-25 02:20:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 02:20:22,939 INFO L225 Difference]: With dead ends: 10525 [2018-10-25 02:20:22,939 INFO L226 Difference]: Without dead ends: 2361 [2018-10-25 02:20:22,946 INFO L605 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 [2018-10-25 02:20:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-10-25 02:20:22,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2359. [2018-10-25 02:20:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2359 states. [2018-10-25 02:20:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2359 states to 2359 states and 3363 transitions. [2018-10-25 02:20:22,965 INFO L78 Accepts]: Start accepts. Automaton has 2359 states and 3363 transitions. Word has length 187 [2018-10-25 02:20:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 02:20:22,965 INFO L481 AbstractCegarLoop]: Abstraction has 2359 states and 3363 transitions. [2018-10-25 02:20:22,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 02:20:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2359 states and 3363 transitions. [2018-10-25 02:20:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-25 02:20:22,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 02:20:22,968 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 02:20:22,968 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 02:20:22,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 02:20:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 421951123, now seen corresponding path program 1 times [2018-10-25 02:20:22,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 02:20:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:22,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 02:20:22,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 02:20:22,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 02:20:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-25 02:20:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-25 02:20:23,296 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-25 02:20:23,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 02:20:23 BoogieIcfgContainer [2018-10-25 02:20:23,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 02:20:23,491 INFO L168 Benchmark]: Toolchain (without parser) took 152038.62 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-25 02:20:23,492 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:20:23,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3643.06 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -419.2 MB). Peak memory consumption was 718.8 MB. Max. memory is 7.1 GB. [2018-10-25 02:20:23,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 153.39 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2018-10-25 02:20:23,494 INFO L168 Benchmark]: Boogie Preprocessor took 1477.57 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 589.8 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -563.8 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. [2018-10-25 02:20:23,495 INFO L168 Benchmark]: RCFGBuilder took 24364.74 ms. Allocated memory was 2.6 GB in the beginning and 3.2 GB in the end (delta: 583.0 MB). Free memory was 2.3 GB in the beginning and 1.4 GB in the end (delta: 957.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-25 02:20:23,496 INFO L168 Benchmark]: TraceAbstraction took 122394.73 ms. Allocated memory was 3.2 GB in the beginning and 3.6 GB in the end (delta: 449.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 02:20:23,501 INFO L336 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3643.06 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 478.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -419.2 MB). Peak memory consumption was 718.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 153.39 ms. Allocated memory is still 2.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 1477.57 ms. Allocated memory was 2.0 GB in the beginning and 2.6 GB in the end (delta: 589.8 MB). Free memory was 1.8 GB in the beginning and 2.3 GB in the end (delta: -563.8 MB). Peak memory consumption was 114.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 24364.74 ms. Allocated memory was 2.6 GB in the beginning and 3.2 GB in the end (delta: 583.0 MB). Free memory was 2.3 GB in the beginning and 1.4 GB in the end (delta: 957.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * TraceAbstraction took 122394.73 ms. Allocated memory was 3.2 GB in the beginning and 3.6 GB in the end (delta: 449.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -1.0 GB). There was no memory consumed. 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() [L119] COND TRUE 1 [L121] method_id = 39 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=0, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L123] COND FALSE !(0) [L127] q = 2 [L129] this_factory=0 [L129] this_shutIn=0 [L129] this_connected=0 [L129] this_closed=0 [L129] this_shutOut=0 [L129] this_created=0 [L129] this_impl=1 [L129] this_bound=0 [L129] this_oldImpl=0 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=1, P30=0, P4=0, P5=1, P6=1, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L136] COND FALSE !(q == 1) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=39, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L748] COND TRUE q == 2 [L749] COND FALSE !(__VERIFIER_nondet_int()) [L765] COND FALSE !(__VERIFIER_nondet_int()) [L781] COND FALSE !(__VERIFIER_nondet_int()) [L797] COND FALSE !(__VERIFIER_nondet_int()) [L813] COND FALSE !(__VERIFIER_nondet_int()) [L829] COND FALSE !(__VERIFIER_nondet_int()) [L845] COND FALSE !(__VERIFIER_nondet_int()) [L861] COND FALSE !(__VERIFIER_nondet_int()) [L877] COND FALSE !(__VERIFIER_nondet_int()) [L893] COND FALSE !(__VERIFIER_nondet_int()) [L909] COND FALSE !(__VERIFIER_nondet_int()) [L925] COND FALSE !(__VERIFIER_nondet_int()) [L941] COND FALSE !(__VERIFIER_nondet_int()) [L957] COND FALSE !(__VERIFIER_nondet_int()) [L973] COND FALSE !(__VERIFIER_nondet_int()) [L989] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1037] COND FALSE !(__VERIFIER_nondet_int()) [L1053] COND FALSE !(__VERIFIER_nondet_int()) [L1069] COND FALSE !(__VERIFIER_nondet_int()) [L1085] COND FALSE !(__VERIFIER_nondet_int()) [L1101] COND FALSE !(__VERIFIER_nondet_int()) [L1117] COND FALSE !(__VERIFIER_nondet_int()) [L1133] COND FALSE !(__VERIFIER_nondet_int()) [L1149] COND FALSE !(__VERIFIER_nondet_int()) [L1165] COND FALSE !(__VERIFIER_nondet_int()) [L1181] COND FALSE !(__VERIFIER_nondet_int()) [L1197] COND FALSE !(__VERIFIER_nondet_int()) [L1213] COND FALSE !(__VERIFIER_nondet_int()) [L1229] COND FALSE !(__VERIFIER_nondet_int()) [L1245] COND FALSE !(__VERIFIER_nondet_int()) [L1261] COND FALSE !(__VERIFIER_nondet_int()) [L1277] COND FALSE !(__VERIFIER_nondet_int()) [L1293] COND FALSE !(__VERIFIER_nondet_int()) [L1309] COND FALSE !(__VERIFIER_nondet_int()) [L1325] COND FALSE !(__VERIFIER_nondet_int()) [L1341] COND FALSE !(__VERIFIER_nondet_int()) [L1357] COND FALSE !(__VERIFIER_nondet_int()) [L1373] COND FALSE !(__VERIFIER_nondet_int()) [L1389] COND FALSE !(__VERIFIER_nondet_int()) [L1405] COND FALSE !(__VERIFIER_nondet_int()) [L1421] COND FALSE !(__VERIFIER_nondet_int()) [L1437] COND FALSE !(__VERIFIER_nondet_int()) [L1453] COND FALSE !(__VERIFIER_nondet_int()) [L1469] COND FALSE !(__VERIFIER_nondet_int()) [L1485] COND FALSE !(__VERIFIER_nondet_int()) [L1501] COND FALSE !(__VERIFIER_nondet_int()) [L1517] COND FALSE !(__VERIFIER_nondet_int()) [L1533] COND FALSE !(__VERIFIER_nondet_int()) [L1549] COND FALSE !(__VERIFIER_nondet_int()) [L1565] COND FALSE !(__VERIFIER_nondet_int()) [L1581] COND FALSE !(__VERIFIER_nondet_int()) [L1597] COND FALSE !(__VERIFIER_nondet_int()) [L1613] COND FALSE !(__VERIFIER_nondet_int()) [L1629] COND FALSE !(__VERIFIER_nondet_int()) [L1645] COND FALSE !(__VERIFIER_nondet_int()) [L1661] COND FALSE !(__VERIFIER_nondet_int()) [L1677] COND FALSE !(__VERIFIER_nondet_int()) [L1693] COND FALSE !(__VERIFIER_nondet_int()) [L1709] COND FALSE !(__VERIFIER_nondet_int()) [L1725] COND FALSE !(__VERIFIER_nondet_int()) [L1741] COND FALSE !(__VERIFIER_nondet_int()) [L1757] COND FALSE !(__VERIFIER_nondet_int()) [L1773] COND FALSE !(__VERIFIER_nondet_int()) [L1789] COND FALSE !(__VERIFIER_nondet_int()) [L1805] COND FALSE !(__VERIFIER_nondet_int()) [L1821] COND FALSE !(__VERIFIER_nondet_int()) [L1837] COND FALSE !(__VERIFIER_nondet_int()) [L1853] COND FALSE !(__VERIFIER_nondet_int()) [L1869] COND FALSE !(__VERIFIER_nondet_int()) [L1885] COND FALSE !(__VERIFIER_nondet_int()) [L1901] COND FALSE !(__VERIFIER_nondet_int()) [L1917] COND FALSE !(__VERIFIER_nondet_int()) [L1933] COND FALSE !(__VERIFIER_nondet_int()) [L1949] COND FALSE !(__VERIFIER_nondet_int()) [L1965] COND FALSE !(__VERIFIER_nondet_int()) [L1981] COND FALSE !(__VERIFIER_nondet_int()) [L1997] COND FALSE !(__VERIFIER_nondet_int()) [L2013] COND FALSE !(__VERIFIER_nondet_int()) [L2029] COND FALSE !(__VERIFIER_nondet_int()) [L2045] COND FALSE !(__VERIFIER_nondet_int()) [L2061] COND FALSE !(__VERIFIER_nondet_int()) [L2077] COND TRUE __VERIFIER_nondet_int() [L2079] COND TRUE !(P1 != 0) [L2081] method_id = 56 VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=0, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L2083] COND FALSE !(((this_factory != 0) && !(P30 != 0))) [L2087] q = 2 [L2089] this_factory=P30 [L2089] this_shutIn=this_shutIn [L2089] this_connected=this_connected [L2089] this_closed=this_closed [L2089] this_shutOut=this_shutOut [L2089] this_created=this_created [L2089] this_impl=this_impl [L2089] this_bound=this_bound [L2089] this_oldImpl=this_oldImpl VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=0, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=1, P18=0, P19=1, P2=0, P20=0, P21=0, P22=0, P23=0, P24=0, P25=0, P26=0, P27=0, P28=0, P29=0, P3=0, P30=1, P4=1, P5=1, P6=0, P7=0, P8=0, P9=0, q=2, this_bound=0, this_closed=0, this_connected=0, this_created=0, this_factory=1, this_impl=1, this_oldImpl=0, this_shutIn=0, this_shutOut=0] [L80] COND TRUE 1 [L83] _Bool P1=__VERIFIER_nondet_int(); [L84] int P2=__VERIFIER_nondet_int(); [L85] _Bool P3=__VERIFIER_nondet_int(); [L86] _Bool P4=__VERIFIER_nondet_int(); [L87] _Bool P5=__VERIFIER_nondet_int(); [L88] _Bool P6=__VERIFIER_nondet_int(); [L89] int P7=__VERIFIER_nondet_int(); [L90] int P8=__VERIFIER_nondet_int(); [L91] int P9=__VERIFIER_nondet_int(); [L92] int P10=__VERIFIER_nondet_int(); [L93] int P11=__VERIFIER_nondet_int(); [L94] int P12=__VERIFIER_nondet_int(); [L95] int P13=__VERIFIER_nondet_int(); [L96] int P14=__VERIFIER_nondet_int(); [L97] int P15=__VERIFIER_nondet_int(); [L98] int P16=__VERIFIER_nondet_int(); [L99] _Bool P17=__VERIFIER_nondet_int(); [L100] int P18=__VERIFIER_nondet_int(); [L101] _Bool P19=__VERIFIER_nondet_int(); [L102] int P20=__VERIFIER_nondet_int(); [L103] int P21=__VERIFIER_nondet_int(); [L104] int P22=__VERIFIER_nondet_int(); [L105] int P23=__VERIFIER_nondet_int(); [L106] int P24=__VERIFIER_nondet_int(); [L107] int P25=__VERIFIER_nondet_int(); [L108] int P26=__VERIFIER_nondet_int(); [L109] int P27=__VERIFIER_nondet_int(); [L110] int P28=__VERIFIER_nondet_int(); [L111] int P29=__VERIFIER_nondet_int(); [L112] int P30=__VERIFIER_nondet_int(); [L116] COND FALSE !(q == 0) VAL [m_bind=9, m_close=17, m_connect1_1=47, m_connect1_2=48, m_connect2_1=43, m_connect2_2=44, m_createImpl=24, m_getChannel=10, m_getImpl=12, m_getInetAddress=1, m_getInputStream=27, m_getKeepAlive=7, m_getLocalAddress=8, m_getLocalPort=3, m_getLocalSocketAddress=19, m_getOOBInline=2, m_getOutputStream=37, m_getPort=31, m_getReceiveBufferSize=20, m_getRemoteSocketAddress=40, m_getReuseAddress=23, m_getSendBufferSize=36, m_getSoLinger=11, m_getSoTimeout=14, m_getTcpNoDelay=13, m_getTrafficClass=22, m_isBound=34, m_isClosed=33, m_isConnected=6, m_isInputShutdown=4, m_isOutputShutdown=15, m_postAccept=16, m_sendUrgentData=32, m_setBound=35, m_setConnected=38, m_setCreated=25, m_setKeepAlive=26, m_setOOBInline=18, m_setPerformancePreferences=30, m_setReceiveBufferSize_1=41, m_setReceiveBufferSize_2=42, m_setReuseAddress=21, m_setSendBufferSize_1=53, m_setSendBufferSize_2=54, m_setSocketImplFactory_1=55, m_setSocketImplFactory_2=56, m_setSoLinger_1=45, m_setSoLinger_2=46, m_setSoTimeout_1=51, m_setSoTimeout_2=52, m_setTcpNoDelay=5, m_setTrafficClass_1=49, m_setTrafficClass_2=50, m_shutdownInput=29, m_shutdownOutput=28, m_Socket=39, method_id=56, P1=1, P10=0, P11=0, P12=0, P13=0, P14=0, P15=0, P16=0, P17=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=0, 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=0, 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=0, 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=0, 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=0, 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, 122.2s OverallTime, 28 OverallIterations, 4 TraceHistogramMax, 105.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 310329 SDtfs, 200627 SDslu, 192977 SDs, 0 SdLazy, 55854 SolverSat, 21037 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 78.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s 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: 11.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 16312 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2318 NumberOfCodeBlocks, 2318 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 533396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 214/214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...