java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:36:57,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:36:57,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:36:57,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:36:57,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:36:57,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:36:57,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:36:57,739 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:36:57,741 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:36:57,742 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:36:57,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:36:57,743 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:36:57,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:36:57,745 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:36:57,746 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:36:57,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:36:57,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:36:57,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:36:57,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:36:57,755 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:36:57,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:36:57,758 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:36:57,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:36:57,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:36:57,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:36:57,762 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:36:57,762 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:36:57,763 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:36:57,763 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:36:57,763 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:36:57,764 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:36:57,765 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:36:57,774 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:36:57,775 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:36:57,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:36:57,775 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:36:57,775 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:36:57,776 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:36:57,776 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:36:57,776 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:36:57,776 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:36:57,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:36:57,777 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:36:57,778 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:36:57,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:36:57,779 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:36:57,779 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:36:57,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:36:57,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:36:57,779 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:36:57,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:36:57,780 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:36:57,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:36:57,781 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:36:57,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:36:57,826 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:36:57,829 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:36:57,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:36:57,831 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:36:57,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:36:58,010 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:36:58,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:36:58,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:36:58,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:36:58,036 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:36:58,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464f907a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58, skipping insertion in model container [2018-01-25 02:36:58,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:36:58,100 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:36:58,254 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:36:58,271 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:36:58,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58 WrapperNode [2018-01-25 02:36:58,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:36:58,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:36:58,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:36:58,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:36:58,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,314 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... [2018-01-25 02:36:58,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:36:58,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:36:58,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:36:58,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:36:58,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:36:58,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:36:58,422 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:36:58,422 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-25 02:36:58,422 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:36:58,423 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:36:58,424 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-25 02:36:58,424 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:36:58,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:36:58,424 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:36:58,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:36:58,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:36:58 BoogieIcfgContainer [2018-01-25 02:36:58,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:36:58,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:36:58,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:36:58,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:36:58,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:36:58" (1/3) ... [2018-01-25 02:36:58,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc34a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:36:58, skipping insertion in model container [2018-01-25 02:36:58,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:36:58" (2/3) ... [2018-01-25 02:36:58,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fc34a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:36:58, skipping insertion in model container [2018-01-25 02:36:58,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:36:58" (3/3) ... [2018-01-25 02:36:58,711 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:36:58,718 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:36:58,725 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:36:58,766 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:36:58,766 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:36:58,766 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:36:58,766 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:36:58,766 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:36:58,766 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:36:58,767 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:36:58,767 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:36:58,767 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:36:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-25 02:36:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:36:58,791 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:58,792 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:58,792 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:36:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash 380982983, now seen corresponding path program 1 times [2018-01-25 02:36:58,798 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:58,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:58,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:58,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:58,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:58,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:59,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:59,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:36:59,036 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:59,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:36:59,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:36:59,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:36:59,119 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-25 02:36:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:59,254 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-25 02:36:59,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:36:59,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:36:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:59,263 INFO L225 Difference]: With dead ends: 96 [2018-01-25 02:36:59,263 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 02:36:59,267 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 02:36:59,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 02:36:59,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 02:36:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-25 02:36:59,297 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-25 02:36:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:59,298 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-25 02:36:59,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:36:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-25 02:36:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:36:59,298 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:59,299 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:59,299 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:36:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash 380982984, now seen corresponding path program 1 times [2018-01-25 02:36:59,299 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:59,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:59,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,300 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:59,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:59,438 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:59,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:36:59,439 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:59,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:36:59,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:36:59,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:36:59,442 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-25 02:36:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:59,603 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-25 02:36:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:36:59,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:36:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:59,605 INFO L225 Difference]: With dead ends: 54 [2018-01-25 02:36:59,605 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:36:59,606 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:36:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:36:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 02:36:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:36:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-25 02:36:59,614 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-25 02:36:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:59,614 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-25 02:36:59,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:36:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-25 02:36:59,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:36:59,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:59,615 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:59,615 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:36:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429420, now seen corresponding path program 1 times [2018-01-25 02:36:59,615 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:59,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:59,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:59,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:59,694 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:59,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:36:59,694 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:59,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:36:59,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:36:59,695 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:36:59,695 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-25 02:36:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:36:59,802 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-25 02:36:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:36:59,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:36:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:36:59,804 INFO L225 Difference]: With dead ends: 53 [2018-01-25 02:36:59,804 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:36:59,804 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:36:59,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:36:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:36:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 02:36:59,809 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-25 02:36:59,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:36:59,809 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 02:36:59,809 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:36:59,809 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 02:36:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:36:59,810 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:36:59,810 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:36:59,810 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:36:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429419, now seen corresponding path program 1 times [2018-01-25 02:36:59,810 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:36:59,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:36:59,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:36:59,811 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:36:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:36:59,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:36:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:36:59,954 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:36:59,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:36:59,954 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:36:59,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:36:59,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:36:59,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:36:59,955 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-25 02:37:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:00,123 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 02:37:00,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:37:00,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:37:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:00,128 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:37:00,128 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:37:00,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:37:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:37:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:37:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:37:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 02:37:00,137 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-25 02:37:00,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:00,137 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 02:37:00,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:37:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 02:37:00,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:37:00,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:00,138 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:37:00,138 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash -425895657, now seen corresponding path program 1 times [2018-01-25 02:37:00,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:00,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:00,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:00,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:00,247 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:00,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:37:00,248 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:00,248 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:37:00,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:37:00,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:37:00,249 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-25 02:37:00,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:00,314 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 02:37:00,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:37:00,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:37:00,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:00,316 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:37:00,316 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:37:00,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:37:00,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:37:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:37:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:37:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:37:00,325 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-25 02:37:00,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:00,325 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:37:00,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:37:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:37:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:37:00,326 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:00,326 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:37:00,327 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -425895656, now seen corresponding path program 1 times [2018-01-25 02:37:00,327 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:00,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,328 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:00,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,328 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:00,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:00,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:00,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:37:00,468 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:00,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:37:00,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:37:00,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:37:00,468 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-25 02:37:00,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:00,591 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-25 02:37:00,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:37:00,591 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:37:00,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:00,594 INFO L225 Difference]: With dead ends: 75 [2018-01-25 02:37:00,595 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 02:37:00,595 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:37:00,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 02:37:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-25 02:37:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:37:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-25 02:37:00,601 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-25 02:37:00,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:00,602 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-25 02:37:00,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:37:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-25 02:37:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:37:00,603 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:00,603 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:37:00,603 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:00,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031168, now seen corresponding path program 1 times [2018-01-25 02:37:00,603 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:00,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:00,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,604 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:00,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:00,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:00,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:37:00,664 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:00,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:37:00,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:37:00,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:37:00,665 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-25 02:37:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:00,748 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-25 02:37:00,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:37:00,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-25 02:37:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:00,749 INFO L225 Difference]: With dead ends: 56 [2018-01-25 02:37:00,749 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:37:00,749 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:37:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:37:00,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-25 02:37:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:37:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 02:37:00,754 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-25 02:37:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:00,755 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 02:37:00,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:37:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 02:37:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:37:00,756 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:00,756 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:37:00,756 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:00,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031167, now seen corresponding path program 1 times [2018-01-25 02:37:00,757 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:00,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:00,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:00,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:00,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:00,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:00,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:00,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:37:00,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:00,885 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:37:00,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:37:00,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:37:00,885 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-25 02:37:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:01,033 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-25 02:37:01,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:37:01,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 02:37:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:01,034 INFO L225 Difference]: With dead ends: 70 [2018-01-25 02:37:01,035 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 02:37:01,035 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:37:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 02:37:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-25 02:37:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 02:37:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-25 02:37:01,044 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-25 02:37:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:01,044 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-25 02:37:01,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:37:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-25 02:37:01,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:37:01,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:01,046 INFO L322 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] [2018-01-25 02:37:01,046 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1785224664, now seen corresponding path program 1 times [2018-01-25 02:37:01,046 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:01,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,047 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:01,047 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,047 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:01,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:01,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:01,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:37:01,087 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:01,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:37:01,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:37:01,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:37:01,088 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-01-25 02:37:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:01,100 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-01-25 02:37:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:37:01,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-25 02:37:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:01,101 INFO L225 Difference]: With dead ends: 98 [2018-01-25 02:37:01,102 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:37:01,102 INFO L525 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-01-25 02:37:01,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:37:01,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 02:37:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 02:37:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-01-25 02:37:01,110 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-01-25 02:37:01,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:01,110 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-01-25 02:37:01,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:37:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-01-25 02:37:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:37:01,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:01,112 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:37:01,112 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -419708018, now seen corresponding path program 1 times [2018-01-25 02:37:01,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:01,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:01,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,114 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:01,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:01,254 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:37:01,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:37:01,254 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:37:01,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:37:01,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:37:01,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:37:01,255 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 6 states. [2018-01-25 02:37:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:37:01,526 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-01-25 02:37:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:37:01,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 02:37:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:37:01,528 INFO L225 Difference]: With dead ends: 60 [2018-01-25 02:37:01,528 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:37:01,528 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:37:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:37:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:37:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:37:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 02:37:01,536 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-25 02:37:01,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:37:01,536 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 02:37:01,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:37:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 02:37:01,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 02:37:01,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:37:01,538 INFO L322 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] [2018-01-25 02:37:01,538 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-25 02:37:01,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2090509973, now seen corresponding path program 1 times [2018-01-25 02:37:01,538 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:37:01,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:37:01,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:37:01,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:37:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:37:01,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:37:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:37:01,841 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:37:01,841 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:37:01,842 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-25 02:37:01,844 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [41], [48], [49], [52], [56], [58], [60], [61], [64], [65], [68], [76], [94], [95], [96], [98] [2018-01-25 02:37:01,893 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:37:01,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown