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_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:32:31,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:32:31,135 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:32:31,150 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:32:31,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:32:31,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:32:31,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:32:31,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:32:31,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:32:31,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:32:31,160 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:32:31,160 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:32:31,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:32:31,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:32:31,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:32:31,166 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:32:31,168 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:32:31,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:32:31,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:32:31,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:32:31,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:32:31,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:32:31,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:32:31,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:32:31,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:32:31,180 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:32:31,180 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:32:31,181 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:32:31,181 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:32:31,181 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:32:31,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:32:31,182 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_smtcomp.epf [2018-01-25 05:32:31,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:32:31,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:32:31,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:32:31,192 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:32:31,192 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:32:31,192 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:32:31,193 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:32:31,193 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:32:31,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:32:31,193 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:32:31,193 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:32:31,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:32:31,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:32:31,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:32:31,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:32:31,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:32:31,195 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:32:31,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:32:31,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:31,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:32:31,196 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:32:31,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:32:31,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:32:31,197 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:32:31,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:32:31,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:32:31,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:32:31,197 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:32:31,198 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:32:31,198 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:32:31,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:32:31,243 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:32:31,247 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:32:31,248 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:32:31,248 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:32:31,249 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-25 05:32:31,422 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:32:31,427 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:32:31,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:31,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:32:31,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:32:31,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,438 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7832e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31, skipping insertion in model container [2018-01-25 05:32:31,438 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,451 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:31,490 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:32:31,616 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:31,637 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:32:31,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31 WrapperNode [2018-01-25 05:32:31,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:32:31,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:32:31,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:32:31,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:32:31,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... [2018-01-25 05:32:31,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:32:31,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:32:31,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:32:31,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:32:31,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:32:31,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:32:31,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:32:31,743 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-25 05:32:31,743 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:32:31,743 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-25 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:32:31,744 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:32:31,975 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:32:31,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:31 BoogieIcfgContainer [2018-01-25 05:32:32,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:32:32,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:32:32,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:32:32,011 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:32:32,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:32:31" (1/3) ... [2018-01-25 05:32:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be8b273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:32, skipping insertion in model container [2018-01-25 05:32:32,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:32:31" (2/3) ... [2018-01-25 05:32:32,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be8b273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:32:32, skipping insertion in model container [2018-01-25 05:32:32,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:32:31" (3/3) ... [2018-01-25 05:32:32,014 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-25 05:32:32,021 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:32:32,027 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 05:32:32,068 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:32:32,068 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:32:32,069 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:32:32,069 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:32:32,069 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:32:32,069 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:32:32,069 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:32:32,069 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:32:32,070 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:32:32,093 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 05:32:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:32:32,102 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:32,103 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:32,103 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:32,110 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-25 05:32:32,113 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:32,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,157 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:32,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:32,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:32,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:32,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:32,371 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:32,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:32,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:32,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:32,452 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-25 05:32:32,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:32,581 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-25 05:32:32,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:32:32,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 05:32:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:32,591 INFO L225 Difference]: With dead ends: 92 [2018-01-25 05:32:32,591 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 05:32:32,594 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-25 05:32:32,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 05:32:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 05:32:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 05:32:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-25 05:32:32,625 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-25 05:32:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:32,625 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-25 05:32:32,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-25 05:32:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:32:32,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:32,626 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:32,626 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-25 05:32:32,626 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:32,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:32,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:32,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:32,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:32,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:32,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:32,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:32,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:32,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:32,791 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-25 05:32:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:32,880 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-25 05:32:32,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:32,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 05:32:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:32,882 INFO L225 Difference]: With dead ends: 52 [2018-01-25 05:32:32,882 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:32:32,883 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:32,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:32:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:32:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:32:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-25 05:32:32,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-25 05:32:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:32,892 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-25 05:32:32,892 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-25 05:32:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:32:32,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:32,892 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:32,892 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:32,893 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-25 05:32:32,893 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:32,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,894 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:32,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:32,894 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:32,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:32,940 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:32,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:32,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:32,941 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:32:32,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:32:32,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:32:32,942 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-25 05:32:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:33,024 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-25 05:32:33,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:32:33,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:32:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:33,026 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:32:33,026 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 05:32:33,027 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 05:32:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 05:32:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:32:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 05:32:33,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-25 05:32:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:33,034 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 05:32:33,035 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:32:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 05:32:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:32:33,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:33,035 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:33,036 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:33,036 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-25 05:32:33,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:33,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,049 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:33,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:33,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:33,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:33,131 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:33,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:33,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:33,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:33,132 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-25 05:32:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:33,192 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-25 05:32:33,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:33,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 05:32:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:33,193 INFO L225 Difference]: With dead ends: 50 [2018-01-25 05:32:33,193 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:32:33,194 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:32:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:32:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:32:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 05:32:33,200 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-25 05:32:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:33,201 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 05:32:33,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 05:32:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:32:33,201 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:33,202 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:33,202 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-25 05:32:33,202 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:33,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:33,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:33,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:32:33,270 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:33,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:32:33,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:32:33,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:32:33,271 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-25 05:32:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:33,352 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 05:32:33,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:32:33,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 05:32:33,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:33,354 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:32:33,354 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:32:33,354 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:33,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:32:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:32:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:32:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-25 05:32:33,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-25 05:32:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:33,361 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-25 05:32:33,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:32:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-25 05:32:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 05:32:33,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:33,363 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:33,363 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:33,363 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-25 05:32:33,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:33,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,364 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:33,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:33,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:32:33,481 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:33,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:32:33,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:32:33,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:33,482 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-25 05:32:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:33,599 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-25 05:32:33,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:33,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 05:32:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:33,603 INFO L225 Difference]: With dead ends: 73 [2018-01-25 05:32:33,603 INFO L226 Difference]: Without dead ends: 72 [2018-01-25 05:32:33,603 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:32:33,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-25 05:32:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-25 05:32:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 05:32:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-25 05:32:33,609 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-25 05:32:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:33,609 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-25 05:32:33,609 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:32:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-25 05:32:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:33,610 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:33,610 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-25 05:32:33,610 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-25 05:32:33,611 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:33,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,612 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:33,700 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:33,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:33,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:33,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:33,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:33,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:33,701 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-25 05:32:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:33,798 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 05:32:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:33,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 05:32:33,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:33,799 INFO L225 Difference]: With dead ends: 54 [2018-01-25 05:32:33,799 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:32:33,800 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:32:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-25 05:32:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 05:32:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-25 05:32:33,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-25 05:32:33,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:33,805 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-25 05:32:33,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:33,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-25 05:32:33,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:32:33,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:33,805 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-25 05:32:33,806 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:33,806 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-25 05:32:33,806 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:33,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:33,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:33,807 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:33,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:33,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:33,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:32:33,912 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:33,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 05:32:33,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 05:32:33,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 05:32:33,913 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-25 05:32:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,029 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-25 05:32:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:34,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-25 05:32:34,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,031 INFO L225 Difference]: With dead ends: 69 [2018-01-25 05:32:34,031 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 05:32:34,032 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:32:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 05:32:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-25 05:32:34,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 05:32:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-25 05:32:34,039 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-25 05:32:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,039 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-25 05:32:34,040 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 05:32:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-25 05:32:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:32:34,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,041 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-25 05:32:34,041 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-25 05:32:34,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,042 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,042 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:34,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:34,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:34,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:32:34,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:34,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:34,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:34,122 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-25 05:32:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,232 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-25 05:32:34,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:32:34,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-25 05:32:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,233 INFO L225 Difference]: With dead ends: 60 [2018-01-25 05:32:34,233 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 05:32:34,233 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:34,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 05:32:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-25 05:32:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 05:32:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-25 05:32:34,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-25 05:32:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,241 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-25 05:32:34,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-25 05:32:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 05:32:34,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,242 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-25 05:32:34,242 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-25 05:32:34,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:34,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:34,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:34,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:32:34,377 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:32:34,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:32:34,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:32:34,377 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-25 05:32:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,471 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-25 05:32:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 05:32:34,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-25 05:32:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,472 INFO L225 Difference]: With dead ends: 93 [2018-01-25 05:32:34,472 INFO L226 Difference]: Without dead ends: 92 [2018-01-25 05:32:34,473 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-25 05:32:34,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-25 05:32:34,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-25 05:32:34,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-25 05:32:34,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-25 05:32:34,481 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-25 05:32:34,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,482 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-25 05:32:34,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:32:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-25 05:32:34,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 05:32:34,483 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,483 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-25 05:32:34,483 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-25 05:32:34,484 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,485 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:34,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:34,519 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:34,519 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:32:34,519 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:32:34,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:32:34,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:32:34,519 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-25 05:32:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,528 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-25 05:32:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:32:34,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-25 05:32:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,529 INFO L225 Difference]: With dead ends: 101 [2018-01-25 05:32:34,529 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 05:32:34,529 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:32:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 05:32:34,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 05:32:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 05:32:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-25 05:32:34,536 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-25 05:32:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,536 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-25 05:32:34,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:32:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-25 05:32:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:32:34,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,537 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:34,537 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-25 05:32:34,538 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:34,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:34,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:34,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:34,589 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:32:34,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:32:34,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:32:34,590 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-25 05:32:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,699 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-25 05:32:34,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:32:34,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 05:32:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,701 INFO L225 Difference]: With dead ends: 109 [2018-01-25 05:32:34,701 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 05:32:34,701 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-25 05:32:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 05:32:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-25 05:32:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 05:32:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-25 05:32:34,708 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-25 05:32:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,708 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-25 05:32:34,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:32:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-25 05:32:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:32:34,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,710 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:32:34,710 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-25 05:32:34,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:34,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:34,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:32:34,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:32:34,883 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:34,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:32:34,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:32:34,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:32:34,884 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-25 05:32:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:32:34,982 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-25 05:32:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:32:34,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 05:32:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:32:34,983 INFO L225 Difference]: With dead ends: 67 [2018-01-25 05:32:34,983 INFO L226 Difference]: Without dead ends: 54 [2018-01-25 05:32:34,984 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-25 05:32:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-25 05:32:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-25 05:32:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 05:32:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-25 05:32:34,990 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-25 05:32:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:32:34,990 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-25 05:32:34,990 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:32:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-25 05:32:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:32:34,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:32:34,992 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-25 05:32:34,992 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-25 05:32:34,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-25 05:32:34,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:32:34,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:34,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:32:34,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:32:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:35,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:32:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:35,238 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:35,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:32:35,239 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:32:35,241 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-25 05:32:35,300 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:32:35,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:32:37,980 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:32:37,981 INFO L268 AbstractInterpreter]: Visited 28 different actions 46 times. Merged at 9 different actions 18 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-01-25 05:32:37,991 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:32:37,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:32:37,992 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-25 05:32:38,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:32:38,005 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:32:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:32:38,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:32:38,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:32:38,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:32:38,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:38,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:32:38,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:32:38,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-25 05:32:38,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-25 05:32:38,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-25 05:32:38,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-25 05:32:38,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-01-25 05:32:38,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-25 05:32:38,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:38,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-25 05:32:38,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-25 05:32:40,592 WARN L143 SmtUtils]: Spent 2023ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-25 05:32:40,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 50 [2018-01-25 05:32:40,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-01-25 05:32:40,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:40,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-01-25 05:32:40,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:40,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-25 05:32:40,869 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:40,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-01-25 05:32:40,909 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:40,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-01-25 05:32:40,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:40,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-01-25 05:32:40,981 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-01-25 05:32:41,009 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-01-25 05:32:41,040 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-25 05:32:41,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,131 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-01-25 05:32:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:41,176 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:32:41,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-01-25 05:32:41,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-01-25 05:32:41,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-01-25 05:32:41,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:32:41,689 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-01-25 05:32:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:32:41,765 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:32:41,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [12] total 39 [2018-01-25 05:32:41,765 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:32:41,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 05:32:41,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 05:32:41,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 05:32:41,767 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 18 states. [2018-01-25 05:32:45,588 WARN L143 SmtUtils]: Spent 3612ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-25 05:32:51,660 WARN L143 SmtUtils]: Spent 6034ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-25 05:32:57,723 WARN L143 SmtUtils]: Spent 6016ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-25 05:33:11,833 WARN L146 SmtUtils]: Spent 14062ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-01-25 05:33:25,916 WARN L146 SmtUtils]: Spent 14048ms on a formula simplification. DAG size of input: 51 DAG size of output 47 Received shutdown request... [2018-01-25 05:33:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 05:33:40,013 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:33:40,016 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:33:40,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:33:40 BoogieIcfgContainer [2018-01-25 05:33:40,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:33:40,017 INFO L168 Benchmark]: Toolchain (without parser) took 68594.54 ms. Allocated memory was 306.7 MB in the beginning and 651.7 MB in the end (delta: 345.0 MB). Free memory was 265.8 MB in the beginning and 401.6 MB in the end (delta: -135.8 MB). Peak memory consumption was 209.1 MB. Max. memory is 5.3 GB. [2018-01-25 05:33:40,018 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:33:40,018 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.69 ms. Allocated memory is still 306.7 MB. Free memory was 265.8 MB in the beginning and 255.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:33:40,018 INFO L168 Benchmark]: Boogie Preprocessor took 37.94 ms. Allocated memory is still 306.7 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:33:40,018 INFO L168 Benchmark]: RCFGBuilder took 323.86 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 233.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:33:40,018 INFO L168 Benchmark]: TraceAbstraction took 68007.62 ms. Allocated memory was 306.7 MB in the beginning and 651.7 MB in the end (delta: 345.0 MB). Free memory was 233.1 MB in the beginning and 401.6 MB in the end (delta: -168.5 MB). Peak memory consumption was 176.5 MB. Max. memory is 5.3 GB. [2018-01-25 05:33:40,020 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.14 ms. Allocated memory is still 306.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.69 ms. Allocated memory is still 306.7 MB. Free memory was 265.8 MB in the beginning and 255.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.94 ms. Allocated memory is still 306.7 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 323.86 ms. Allocated memory is still 306.7 MB. Free memory was 253.7 MB in the beginning and 233.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 68007.62 ms. Allocated memory was 306.7 MB in the beginning and 651.7 MB in the end (delta: 345.0 MB). Free memory was 233.1 MB in the beginning and 401.6 MB in the end (delta: -168.5 MB). Peak memory consumption was 176.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 419 LocStat_NO_SUPPORTING_DISEQUALITIES : 79 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 71 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 7.774710 RENAME_VARIABLES(MILLISECONDS) : 1.112528 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 7.721533 PROJECTAWAY(MILLISECONDS) : 13.817316 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.116223 DISJOIN(MILLISECONDS) : 0.569680 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.143452 ADD_EQUALITY(MILLISECONDS) : 0.014052 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008028 #CONJOIN_DISJUNCTIVE : 85 #RENAME_VARIABLES : 141 #UNFREEZE : 0 #CONJOIN : 148 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 129 #ADD_EQUALITY : 73 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * 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 constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (54states) and interpolant automaton (currently 15 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 55. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 67.9s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 558 SDtfs, 727 SDslu, 1165 SDs, 0 SdLazy, 967 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 48.0s 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, 2.7s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 73 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 322 NumberOfCodeBlocks, 322 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 335 ConstructedInterpolants, 21 QuantifiedInterpolants, 45188 SizeOfPredicates, 28 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 8/10 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-33-40-027.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_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-33-40-027.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_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-33-40-027.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-33-40-027.csv Completed graceful shutdown