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_mostprecise.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 20:00:58,286 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:00:58,288 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:00:58,301 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:00:58,301 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:00:58,302 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:00:58,303 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:00:58,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:00:58,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:00:58,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:00:58,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:00:58,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:00:58,309 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:00:58,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:00:58,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:00:58,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:00:58,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:00:58,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:00:58,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:00:58,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:00:58,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:00:58,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:00:58,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:00:58,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:00:58,324 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:00:58,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:00:58,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:00:58,326 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:00:58,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:00:58,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:00:58,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:00:58,327 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_mostprecise.epf [2018-01-24 20:00:58,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:00:58,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:00:58,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:00:58,338 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:00:58,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:00:58,338 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:00:58,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:00:58,339 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:00:58,339 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:00:58,339 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:00:58,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:00:58,340 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:00:58,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:00:58,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:00:58,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:00:58,341 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:00:58,341 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:00:58,341 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:00:58,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:00:58,341 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:00:58,342 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:00:58,342 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:00:58,342 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:00:58,342 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:00:58,342 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:00:58,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:00:58,343 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:00:58,343 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:00:58,343 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:00:58,343 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:00:58,343 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:00:58,344 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:00:58,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:00:58,344 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:00:58,344 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:00:58,345 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:00:58,345 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:00:58,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:00:58,390 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:00:58,394 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:00:58,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:00:58,396 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:00:58,396 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 20:00:58,526 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:00:58,532 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:00:58,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:00:58,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:00:58,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:00:58,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,539 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 08:00:58, skipping insertion in model container [2018-01-24 20:00:58,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,552 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:00:58,588 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:00:58,697 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:00:58,712 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:00:58,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58 WrapperNode [2018-01-24 20:00:58,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:00:58,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:00:58,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:00:58,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:00:58,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... [2018-01-24 20:00:58,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:00:58,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:00:58,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:00:58,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:00:58,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:00:58,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:00:58,818 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:00:58,819 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-24 20:00:58,819 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:00:58,819 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 20:00:58,819 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 20:00:58,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:00:58,819 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:00:58,819 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:00:58,820 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:00:58,820 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-24 20:00:58,820 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:00:58,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:00:58,820 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:00:59,060 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:00:59,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:00:59 BoogieIcfgContainer [2018-01-24 20:00:59,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:00:59,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:00:59,062 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:00:59,064 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:00:59,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:00:58" (1/3) ... [2018-01-24 20:00:59,065 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 08:00:59, skipping insertion in model container [2018-01-24 20:00:59,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:00:58" (2/3) ... [2018-01-24 20:00:59,065 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 08:00:59, skipping insertion in model container [2018-01-24 20:00:59,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:00:59" (3/3) ... [2018-01-24 20:00:59,067 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 20:00:59,073 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:00:59,081 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 20:00:59,125 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:00:59,126 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:00:59,126 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:00:59,126 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:00:59,126 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:00:59,126 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:00:59,126 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:00:59,126 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:00:59,127 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:00:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 20:00:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:00:59,156 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:59,157 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:59,157 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:00:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-24 20:00:59,164 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:59,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:59,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,207 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:59,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:59,393 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 20:00:59,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:59,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:00:59,396 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:59,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:00:59,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:00:59,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:00:59,479 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 20:00:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:59,599 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-24 20:00:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:00:59,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 20:00:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:59,612 INFO L225 Difference]: With dead ends: 92 [2018-01-24 20:00:59,612 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 20:00:59,616 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 20:00:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 20:00:59,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 20:00:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 20:00:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 20:00:59,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-24 20:00:59,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:59,659 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 20:00:59,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:00:59,659 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 20:00:59,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 20:00:59,660 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:59,660 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:59,660 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:00:59,661 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-24 20:00:59,661 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:59,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:59,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,663 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:59,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:59,795 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 20:00:59,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:59,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:00:59,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:59,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:00:59,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:00:59,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:00:59,804 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-24 20:00:59,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:00:59,903 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 20:00:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:00:59,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 20:00:59,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:00:59,905 INFO L225 Difference]: With dead ends: 52 [2018-01-24 20:00:59,905 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 20:00:59,906 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 20:00:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 20:00:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 20:00:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 20:00:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 20:00:59,914 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 20:00:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:00:59,915 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 20:00:59,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:00:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 20:00:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:00:59,915 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:00:59,915 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:00:59,915 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:00:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-24 20:00:59,916 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:00:59,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:00:59,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:00:59,917 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:00:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:00:59,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:00:59,963 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 20:00:59,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:00:59,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:00:59,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:00:59,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:00:59,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:00:59,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:00:59,965 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 20:01:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:00,068 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 20:01:00,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:01:00,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 20:01:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:00,070 INFO L225 Difference]: With dead ends: 51 [2018-01-24 20:01:00,070 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 20:01:00,071 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 20:01:00,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 20:01:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 20:01:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 20:01:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 20:01:00,078 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-24 20:01:00,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:00,078 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 20:01:00,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:01:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 20:01:00,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:01:00,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:00,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:01:00,079 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:00,080 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-24 20:01:00,080 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:00,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:00,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,082 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:00,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:00,174 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 20:01:00,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:00,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:01:00,174 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:00,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:01:00,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:01:00,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:01:00,175 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-24 20:01:00,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:00,236 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 20:01:00,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:01:00,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 20:01:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:00,238 INFO L225 Difference]: With dead ends: 50 [2018-01-24 20:01:00,238 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 20:01:00,238 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 20:01:00,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 20:01:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 20:01:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:01:00,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 20:01:00,243 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 20:01:00,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:00,243 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 20:01:00,243 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:01:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 20:01:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:01:00,244 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:00,244 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 20:01:00,244 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-24 20:01:00,244 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:00,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:00,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,246 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:00,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:00,300 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 20:01:00,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:00,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:01:00,300 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:00,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:01:00,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:01:00,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:01:00,302 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 20:01:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:00,380 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 20:01:00,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:01:00,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:01:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:00,381 INFO L225 Difference]: With dead ends: 49 [2018-01-24 20:01:00,382 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 20:01:00,382 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 20:01:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 20:01:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 20:01:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 20:01:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 20:01:00,389 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-24 20:01:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:00,389 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 20:01:00,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:01:00,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 20:01:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:01:00,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:00,390 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 20:01:00,391 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-24 20:01:00,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:00,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:00,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,392 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:00,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:00,502 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 20:01:00,502 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:00,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:01:00,503 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:00,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:01:00,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:01:00,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:01:00,504 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-24 20:01:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:00,618 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 20:01:00,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:01:00,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 20:01:00,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:00,621 INFO L225 Difference]: With dead ends: 73 [2018-01-24 20:01:00,621 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 20:01:00,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 20:01:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 20:01:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-24 20:01:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 20:01:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 20:01:00,627 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-24 20:01:00,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:00,628 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 20:01:00,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:01:00,628 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 20:01:00,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:01:00,628 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:00,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 20:01:00,629 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-24 20:01:00,629 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:00,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,630 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:00,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,630 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:00,643 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:00,680 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 20:01:00,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:00,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:01:00,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:00,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:01:00,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:01:00,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:01:00,681 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-24 20:01:00,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:00,782 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 20:01:00,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:01:00,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 20:01:00,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:00,783 INFO L225 Difference]: With dead ends: 54 [2018-01-24 20:01:00,783 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 20:01:00,784 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 20:01:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 20:01:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-24 20:01:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 20:01:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 20:01:00,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-24 20:01:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:00,789 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 20:01:00,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:01:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 20:01:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:01:00,790 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:00,790 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 20:01:00,790 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-24 20:01:00,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:00,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,792 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:00,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:00,792 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:00,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:00,922 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 20:01:00,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:00,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:01:00,922 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:00,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:01:00,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:01:00,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:01:00,923 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-24 20:01:01,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:01,046 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 20:01:01,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:01:01,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 20:01:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:01,047 INFO L225 Difference]: With dead ends: 69 [2018-01-24 20:01:01,047 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 20:01:01,048 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 20:01:01,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 20:01:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 20:01:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 20:01:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-24 20:01:01,056 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-24 20:01:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:01,057 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-24 20:01:01,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:01:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-24 20:01:01,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:01:01,058 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:01,058 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 20:01:01,058 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-24 20:01:01,058 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:01,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,059 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:01,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:01,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:01,176 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 20:01:01,177 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:01,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:01:01,177 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:01,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:01:01,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:01:01,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:01:01,178 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-24 20:01:01,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:01,309 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-24 20:01:01,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:01:01,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 20:01:01,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:01,310 INFO L225 Difference]: With dead ends: 60 [2018-01-24 20:01:01,311 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 20:01:01,311 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 20:01:01,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 20:01:01,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 20:01:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 20:01:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 20:01:01,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-24 20:01:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:01,319 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 20:01:01,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:01:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 20:01:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:01:01,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:01,320 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 20:01:01,320 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-24 20:01:01,321 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:01,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:01,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:01,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:01,420 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 20:01:01,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:01,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:01:01,420 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:01,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:01:01,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:01:01,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:01:01,421 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-24 20:01:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:01,620 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-24 20:01:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:01:01,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 20:01:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:01,621 INFO L225 Difference]: With dead ends: 93 [2018-01-24 20:01:01,621 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 20:01:01,622 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 20:01:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 20:01:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-24 20:01:01,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 20:01:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-24 20:01:01,632 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-24 20:01:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:01,632 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-24 20:01:01,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:01:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-24 20:01:01,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:01:01,634 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:01,634 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 20:01:01,634 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:01,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-24 20:01:01,634 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:01,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:01,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,636 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:01,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:01,664 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 20:01:01,664 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:01,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:01:01,665 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:01,665 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:01:01,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:01:01,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:01:01,665 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-24 20:01:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:01,686 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-24 20:01:01,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:01:01,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 20:01:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:01,688 INFO L225 Difference]: With dead ends: 101 [2018-01-24 20:01:01,688 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 20:01:01,688 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 20:01:01,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 20:01:01,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 20:01:01,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 20:01:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-24 20:01:01,696 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-24 20:01:01,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:01,696 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-24 20:01:01,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:01:01,697 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-24 20:01:01,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:01:01,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:01,698 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 20:01:01,698 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:01,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-24 20:01:01,698 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:01,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:01,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,700 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:01,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:01,775 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 20:01:01,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:01,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:01:01,775 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:01,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:01:01,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:01:01,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:01:01,776 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-24 20:01:01,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:01,871 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-24 20:01:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:01:01,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 20:01:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:01,873 INFO L225 Difference]: With dead ends: 109 [2018-01-24 20:01:01,873 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 20:01:01,873 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 20:01:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 20:01:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-24 20:01:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 20:01:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-24 20:01:01,882 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-24 20:01:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:01,882 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-24 20:01:01,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:01:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-24 20:01:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:01:01,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:01,884 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 20:01:01,884 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-24 20:01:01,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:01,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:01,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:01,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:02,054 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 20:01:02,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:01:02,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:01:02,054 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:01:02,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:01:02,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:01:02,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:01:02,055 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-24 20:01:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:01:02,139 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-24 20:01:02,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:01:02,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 20:01:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:01:02,140 INFO L225 Difference]: With dead ends: 67 [2018-01-24 20:01:02,140 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 20:01:02,141 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 20:01:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 20:01:02,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 20:01:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:01:02,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 20:01:02,145 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-24 20:01:02,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:01:02,145 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 20:01:02,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:01:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 20:01:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 20:01:02,146 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:01:02,146 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 20:01:02,146 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 20:01:02,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-24 20:01:02,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:01:02,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:02,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:01:02,148 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:01:02,148 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:01:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:01:02,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:01:02,412 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 20:01:02,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:01:02,413 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:01:02,414 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 20:01:02,416 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 20:01:02,482 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:01:02,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 20:02:02,258 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 20:02:02,259 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 20:02:02,260 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 20:02:02,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:02:02,260 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 20:02:02,266 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:02:02,267 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:02:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:02:02,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:02:02,319 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:02:02,319 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:02:02,325 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:02:02,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:02:02 BoogieIcfgContainer [2018-01-24 20:02:02,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:02:02,327 INFO L168 Benchmark]: Toolchain (without parser) took 63800.22 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 260.3 MB in the beginning and 1.2 GB in the end (delta: -941.6 MB). Peak memory consumption was 738.7 MB. Max. memory is 5.3 GB. [2018-01-24 20:02:02,328 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:02:02,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.22 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:02:02,329 INFO L168 Benchmark]: Boogie Preprocessor took 39.81 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:02:02,329 INFO L168 Benchmark]: RCFGBuilder took 303.42 ms. Allocated memory is still 300.4 MB. Free memory was 247.3 MB in the beginning and 227.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:02:02,330 INFO L168 Benchmark]: TraceAbstraction took 63264.20 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 227.2 MB in the beginning and 1.2 GB in the end (delta: -974.7 MB). Peak memory consumption was 705.7 MB. Max. memory is 5.3 GB. [2018-01-24 20:02:02,332 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.16 ms. Allocated memory is still 300.4 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 185.22 ms. Allocated memory is still 300.4 MB. Free memory was 259.3 MB in the beginning and 249.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.81 ms. Allocated memory is still 300.4 MB. Free memory was 249.4 MB in the beginning and 247.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 303.42 ms. Allocated memory is still 300.4 MB. Free memory was 247.3 MB in the beginning and 227.2 MB in the end (delta: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63264.20 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 227.2 MB in the beginning and 1.2 GB in the end (delta: -974.7 MB). Peak memory consumption was 705.7 MB. 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, 63.2s 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.8s 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, 59.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 73 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-02-02-341.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-02-02-341.csv Completed graceful shutdown