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_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:25:01,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:25:01,123 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:25:01,138 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:25:01,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:25:01,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:25:01,141 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:25:01,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:25:01,145 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:25:01,145 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:25:01,146 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:25:01,147 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:25:01,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:25:01,149 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:25:01,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:25:01,152 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:25:01,154 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:25:01,156 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:25:01,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:25:01,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:25:01,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:25:01,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:25:01,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:25:01,163 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:25:01,163 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:25:01,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:25:01,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:25:01,166 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:25:01,166 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:25:01,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:25:01,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:25:01,167 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_precise.epf [2018-01-24 23:25:01,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:25:01,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:25:01,176 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:25:01,177 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:25:01,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:25:01,177 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:25:01,177 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:25:01,177 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:25:01,177 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:25:01,178 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:25:01,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:25:01,179 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:25:01,180 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:25:01,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:25:01,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:25:01,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:25:01,180 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:25:01,181 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:25:01,182 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:25:01,182 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:25:01,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:25:01,226 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:25:01,230 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:25:01,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:25:01,231 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:25:01,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:25:01,413 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:25:01,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:25:01,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:25:01,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:25:01,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:25:01,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01, skipping insertion in model container [2018-01-24 23:25:01,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,443 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:25:01,480 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:25:01,604 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:25:01,636 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:25:01,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01 WrapperNode [2018-01-24 23:25:01,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:25:01,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:25:01,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:25:01,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:25:01,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (1/1) ... [2018-01-24 23:25:01,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:25:01,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:25:01,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:25:01,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:25:01,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (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-24 23:25:01,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:25:01,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:25:01,740 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-24 23:25:01,740 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:25:01,740 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:25:01,740 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:25:01,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:25:01,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:25:01,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:25:01,978 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:25:01,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:25:01 BoogieIcfgContainer [2018-01-24 23:25:01,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:25:01,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:25:01,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:25:01,981 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:25:01,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:25:01" (1/3) ... [2018-01-24 23:25:01,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdbf16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:25:01, skipping insertion in model container [2018-01-24 23:25:01,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:25:01" (2/3) ... [2018-01-24 23:25:01,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdbf16d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:25:01, skipping insertion in model container [2018-01-24 23:25:01,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:25:01" (3/3) ... [2018-01-24 23:25:01,984 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:25:01,991 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:25:01,997 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 23:25:02,045 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:25:02,045 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:25:02,046 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:25:02,046 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:25:02,046 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:25:02,046 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:25:02,046 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:25:02,046 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:25:02,047 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:25:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 23:25:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:25:02,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:02,077 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:25:02,077 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:02,082 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-24 23:25:02,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:02,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:02,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,128 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:02,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:02,332 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-24 23:25:02,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:02,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:25:02,336 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:02,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:25:02,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:25:02,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:25:02,356 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 23:25:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:02,562 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-24 23:25:02,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:25:02,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:25:02,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:02,573 INFO L225 Difference]: With dead ends: 92 [2018-01-24 23:25:02,573 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:25:02,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:25:02,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:25:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:25:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:25:02,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 23:25:02,605 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-24 23:25:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:02,605 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 23:25:02,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:25:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 23:25:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:25:02,606 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:02,607 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:25:02,607 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-24 23:25:02,607 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:02,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:02,609 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:02,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:02,762 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-24 23:25:02,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:02,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:25:02,763 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:02,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:25:02,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:25:02,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:25:02,768 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-24 23:25:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:02,856 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 23:25:02,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:25:02,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:25:02,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:02,858 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:25:02,858 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:25:02,859 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-24 23:25:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:25:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:25:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:25:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 23:25:02,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 23:25:02,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:02,867 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 23:25:02,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:25:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 23:25:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:25:02,868 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:02,868 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:25:02,868 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-24 23:25:02,869 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:02,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:02,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:02,870 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:02,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:02,936 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-24 23:25:02,937 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:02,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:25:02,937 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:02,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:25:02,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:25:02,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:25:02,938 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 23:25:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:03,071 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 23:25:03,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:25:03,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:25:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:03,072 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:25:03,072 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:25:03,073 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-24 23:25:03,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:25:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 23:25:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:25:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 23:25:03,077 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-24 23:25:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:03,078 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 23:25:03,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:25:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 23:25:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:25:03,078 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:03,078 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:25:03,079 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:03,079 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-24 23:25:03,079 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:03,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:03,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,080 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:03,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:03,155 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-24 23:25:03,155 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:03,155 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:25:03,155 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:03,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:25:03,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:25:03,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:25:03,156 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-24 23:25:03,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:03,237 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 23:25:03,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:25:03,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:25:03,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:03,238 INFO L225 Difference]: With dead ends: 50 [2018-01-24 23:25:03,239 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 23:25:03,239 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-24 23:25:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 23:25:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 23:25:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 23:25:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 23:25:03,246 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 23:25:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:03,246 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 23:25:03,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:25:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 23:25:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:25:03,247 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:03,247 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-24 23:25:03,247 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-24 23:25:03,248 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:03,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:03,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,249 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:03,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:03,306 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-24 23:25:03,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:03,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:25:03,307 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:03,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:25:03,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:25:03,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:25:03,308 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 23:25:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:03,387 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 23:25:03,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:25:03,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 23:25:03,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:03,389 INFO L225 Difference]: With dead ends: 49 [2018-01-24 23:25:03,389 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 23:25:03,390 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-24 23:25:03,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 23:25:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 23:25:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 23:25:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 23:25:03,397 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-24 23:25:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:03,397 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 23:25:03,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:25:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 23:25:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:25:03,398 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:03,399 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-24 23:25:03,399 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-24 23:25:03,399 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:03,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:03,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,401 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:03,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:03,504 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-24 23:25:03,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:03,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:25:03,505 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:03,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:25:03,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:25:03,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:25:03,506 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-24 23:25:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:03,618 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 23:25:03,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:25:03,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 23:25:03,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:03,621 INFO L225 Difference]: With dead ends: 73 [2018-01-24 23:25:03,622 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 23:25:03,622 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-24 23:25:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 23:25:03,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-24 23:25:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:25:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 23:25:03,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-24 23:25:03,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:03,629 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 23:25:03,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:25:03,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 23:25:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:25:03,629 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:03,629 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] [2018-01-24 23:25:03,630 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:03,630 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-24 23:25:03,630 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:03,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,631 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:03,631 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,631 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:03,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:03,683 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-24 23:25:03,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:03,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:25:03,684 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:03,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:25:03,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:25:03,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:25:03,685 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-24 23:25:03,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:03,776 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 23:25:03,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:25:03,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 23:25:03,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:03,778 INFO L225 Difference]: With dead ends: 54 [2018-01-24 23:25:03,778 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:25:03,778 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-24 23:25:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:25:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-24 23:25:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 23:25:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 23:25:03,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-24 23:25:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:03,785 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 23:25:03,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:25:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 23:25:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 23:25:03,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:03,786 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] [2018-01-24 23:25:03,786 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-24 23:25:03,787 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:03,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:03,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:03,788 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:03,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:03,962 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-24 23:25:03,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:03,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 23:25:03,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:03,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 23:25:03,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 23:25:03,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:25:03,963 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-24 23:25:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:04,111 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 23:25:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:25:04,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 23:25:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:04,113 INFO L225 Difference]: With dead ends: 69 [2018-01-24 23:25:04,113 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 23:25:04,113 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:25:04,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 23:25:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 23:25:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 23:25:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-24 23:25:04,120 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-24 23:25:04,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:04,121 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-24 23:25:04,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 23:25:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-24 23:25:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:25:04,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:04,122 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] [2018-01-24 23:25:04,122 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:04,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-24 23:25:04,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:04,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:04,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,124 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:04,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:04,181 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-24 23:25:04,181 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:04,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:25:04,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:04,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:25:04,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:25:04,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:25:04,183 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-24 23:25:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:04,263 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-24 23:25:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:25:04,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 23:25:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:04,264 INFO L225 Difference]: With dead ends: 60 [2018-01-24 23:25:04,264 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 23:25:04,265 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-24 23:25:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 23:25:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 23:25:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:25:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 23:25:04,271 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-24 23:25:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:04,272 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 23:25:04,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:25:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 23:25:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 23:25:04,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:04,273 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] [2018-01-24 23:25:04,273 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:04,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-24 23:25:04,273 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:04,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,274 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:04,274 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,275 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:04,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:04,426 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-24 23:25:04,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:04,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:25:04,427 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:04,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:25:04,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:25:04,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:25:04,427 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-24 23:25:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:04,647 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-24 23:25:04,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 23:25:04,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 23:25:04,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:04,648 INFO L225 Difference]: With dead ends: 93 [2018-01-24 23:25:04,648 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 23:25:04,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 23:25:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 23:25:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-24 23:25:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 23:25:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-24 23:25:04,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-24 23:25:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:04,657 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-24 23:25:04,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:25:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-24 23:25:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:25:04,658 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:04,658 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] [2018-01-24 23:25:04,658 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:04,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-24 23:25:04,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:04,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,660 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:04,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,660 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:04,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:04,692 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-24 23:25:04,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:04,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:25:04,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:04,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:25:04,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:25:04,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:25:04,693 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-24 23:25:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:04,710 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-24 23:25:04,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:25:04,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 23:25:04,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:04,713 INFO L225 Difference]: With dead ends: 101 [2018-01-24 23:25:04,713 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 23:25:04,714 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-24 23:25:04,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 23:25:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 23:25:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 23:25:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-24 23:25:04,724 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-24 23:25:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:04,724 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-24 23:25:04,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:25:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-24 23:25:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 23:25:04,725 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:04,725 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-24 23:25:04,725 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-24 23:25:04,726 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:04,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:04,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,727 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:04,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:04,810 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-24 23:25:04,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:04,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:25:04,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:04,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:25:04,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:25:04,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:25:04,811 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-24 23:25:04,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:04,865 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-24 23:25:04,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 23:25:04,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 23:25:04,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:04,866 INFO L225 Difference]: With dead ends: 109 [2018-01-24 23:25:04,866 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 23:25:04,867 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:25:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 23:25:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-24 23:25:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 23:25:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-24 23:25:04,876 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-24 23:25:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:04,876 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-24 23:25:04,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:25:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-24 23:25:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 23:25:04,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:04,878 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-24 23:25:04,878 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-24 23:25:04,878 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:04,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:04,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:04,880 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:04,893 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:05,091 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-24 23:25:05,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:25:05,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 23:25:05,092 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:25:05,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 23:25:05,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 23:25:05,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:25:05,093 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-24 23:25:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:25:05,190 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-24 23:25:05,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:25:05,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 23:25:05,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:25:05,191 INFO L225 Difference]: With dead ends: 67 [2018-01-24 23:25:05,191 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 23:25:05,192 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 23:25:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 23:25:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 23:25:05,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 23:25:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 23:25:05,198 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-24 23:25:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:25:05,199 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 23:25:05,199 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 23:25:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 23:25:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 23:25:05,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:25:05,199 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] [2018-01-24 23:25:05,199 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 23:25:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-24 23:25:05,200 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:25:05,200 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:05,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:25:05,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:25:05,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:25:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:25:05,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:25:05,496 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-24 23:25:05,497 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:25:05,497 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:25:05,498 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 23:25:05,500 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [42], [49], [53], [55], [57], [58], [61], [62], [65], [68], [76], [92], [93], [94], [96] [2018-01-24 23:25:05,562 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:25:05,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:26:06,033 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:26:06,034 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:26:06,035 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:26:06,035 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:26:06,035 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:26:06,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:26:06,041 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:26:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:26:06,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:26:06,115 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:26:06,115 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:26:06,122 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:26:06,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:26:06 BoogieIcfgContainer [2018-01-24 23:26:06,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:26:06,123 INFO L168 Benchmark]: Toolchain (without parser) took 64709.56 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 265.7 MB in the beginning and 331.9 MB in the end (delta: -66.2 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-24 23:26:06,125 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:26:06,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.29 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 23:26:06,126 INFO L168 Benchmark]: Boogie Preprocessor took 43.08 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:26:06,126 INFO L168 Benchmark]: RCFGBuilder took 289.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 232.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-24 23:26:06,127 INFO L168 Benchmark]: TraceAbstraction took 64142.76 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 232.9 MB in the beginning and 331.9 MB in the end (delta: -99.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-24 23:26:06,129 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.29 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.5 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.08 ms. Allocated memory is still 305.7 MB. Free memory was 254.5 MB in the beginning and 252.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 289.76 ms. Allocated memory is still 305.7 MB. Free memory was 252.6 MB in the beginning and 232.9 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64142.76 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 232.9 MB in the beginning and 331.9 MB in the end (delta: -99.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 64.0s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 691 SDslu, 1022 SDs, 0 SdLazy, 798 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 60.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 73 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 18756 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-26-06-138.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/substring-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-26-06-138.csv Completed graceful shutdown