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.epf -i ../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 15:23:51,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 15:23:51,148 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 15:23:51,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 15:23:51,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 15:23:51,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 15:23:51,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 15:23:51,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 15:23:51,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 15:23:51,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 15:23:51,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 15:23:51,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 15:23:51,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 15:23:51,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 15:23:51,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 15:23:51,173 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 15:23:51,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 15:23:51,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 15:23:51,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 15:23:51,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 15:23:51,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 15:23:51,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 15:23:51,184 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 15:23:51,185 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 15:23:51,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 15:23:51,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 15:23:51,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 15:23:51,188 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 15:23:51,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 15:23:51,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 15:23:51,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 15:23:51,190 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.epf [2018-01-24 15:23:51,199 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 15:23:51,200 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 15:23:51,201 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 15:23:51,201 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 15:23:51,201 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 15:23:51,201 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 15:23:51,201 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 15:23:51,202 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 15:23:51,202 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 15:23:51,202 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 15:23:51,203 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 15:23:51,203 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 15:23:51,203 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 15:23:51,203 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 15:23:51,203 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 15:23:51,204 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 15:23:51,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 15:23:51,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 15:23:51,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 15:23:51,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 15:23:51,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 15:23:51,205 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 15:23:51,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 15:23:51,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:23:51,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 15:23:51,206 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 15:23:51,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 15:23:51,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 15:23:51,206 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 15:23:51,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 15:23:51,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 15:23:51,207 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 15:23:51,207 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 15:23:51,208 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 15:23:51,208 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 15:23:51,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 15:23:51,259 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 15:23:51,264 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 15:23:51,266 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 15:23:51,266 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 15:23:51,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:23:51,483 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 15:23:51,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 15:23:51,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 15:23:51,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 15:23:51,497 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 15:23:51,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386958ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51, skipping insertion in model container [2018-01-24 15:23:51,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,517 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:23:51,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 15:23:51,677 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:23:51,699 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 15:23:51,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51 WrapperNode [2018-01-24 15:23:51,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 15:23:51,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 15:23:51,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 15:23:51,709 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 15:23:51,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... [2018-01-24 15:23:51,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 15:23:51,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 15:23:51,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 15:23:51,748 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 15:23:51,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 15:23:51,805 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 15:23:51,805 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 15:23:51,825 INFO L136 BoogieDeclarations]: Found implementation of procedure substring [2018-01-24 15:23:51,825 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 15:23:51,826 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 15:23:51,827 INFO L128 BoogieDeclarations]: Found specification of procedure substring [2018-01-24 15:23:51,827 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 15:23:51,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 15:23:51,827 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 15:23:52,092 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 15:23:52,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:23:52 BoogieIcfgContainer [2018-01-24 15:23:52,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 15:23:52,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 15:23:52,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 15:23:52,096 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 15:23:52,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 03:23:51" (1/3) ... [2018-01-24 15:23:52,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be92a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:23:52, skipping insertion in model container [2018-01-24 15:23:52,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 03:23:51" (2/3) ... [2018-01-24 15:23:52,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be92a5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 03:23:52, skipping insertion in model container [2018-01-24 15:23:52,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 03:23:52" (3/3) ... [2018-01-24 15:23:52,099 INFO L105 eAbstractionObserver]: Analyzing ICFG substring-alloca_true-valid-memsafety_true-termination.i [2018-01-24 15:23:52,105 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 15:23:52,111 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 15:23:52,146 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 15:23:52,147 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 15:23:52,147 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 15:23:52,147 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 15:23:52,147 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 15:23:52,147 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 15:23:52,148 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 15:23:52,148 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 15:23:52,149 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 15:23:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 15:23:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:23:52,177 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:52,178 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:52,179 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash 680757637, now seen corresponding path program 1 times [2018-01-24 15:23:52,184 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:52,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:52,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:52,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:52,227 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:52,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:52,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:52,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:52,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:52,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:23:52,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:23:52,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:23:52,451 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 15:23:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:52,669 INFO L93 Difference]: Finished difference Result 92 states and 104 transitions. [2018-01-24 15:23:52,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:23:52,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 15:23:52,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:52,680 INFO L225 Difference]: With dead ends: 92 [2018-01-24 15:23:52,680 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 15:23:52,683 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 15:23:52,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 15:23:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 15:23:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 15:23:52,719 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 13 [2018-01-24 15:23:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:52,719 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 15:23:52,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:23:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 15:23:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 15:23:52,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:52,720 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:52,720 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:52,721 INFO L82 PathProgramCache]: Analyzing trace with hash 680757638, now seen corresponding path program 1 times [2018-01-24 15:23:52,721 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:52,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:52,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:52,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:52,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:52,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:52,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:52,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:52,890 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:23:52,890 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:52,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:52,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:52,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:52,898 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-24 15:23:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,001 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 15:23:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:53,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 15:23:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,003 INFO L225 Difference]: With dead ends: 52 [2018-01-24 15:23:53,003 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:23:53,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:23:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:23:53,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 15:23:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 15:23:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 15:23:53,012 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 13 [2018-01-24 15:23:53,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,012 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 15:23:53,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 15:23:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:23:53,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,013 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,013 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -371349738, now seen corresponding path program 1 times [2018-01-24 15:23:53,014 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:53,072 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 15:23:53,073 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 15:23:53,073 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 15:23:53,073 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-01-24 15:23:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,161 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 15:23:53,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 15:23:53,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 15:23:53,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,163 INFO L225 Difference]: With dead ends: 51 [2018-01-24 15:23:53,163 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 15:23:53,163 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 15:23:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 15:23:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:23:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 15:23:53,170 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 14 [2018-01-24 15:23:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,170 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 15:23:53,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 15:23:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 15:23:53,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 15:23:53,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,171 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,172 INFO L82 PathProgramCache]: Analyzing trace with hash -371349737, now seen corresponding path program 1 times [2018-01-24 15:23:53,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,249 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:23:53,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:23:53,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:23:53,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:53,250 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-01-24 15:23:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,327 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 15:23:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:53,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 15:23:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,328 INFO L225 Difference]: With dead ends: 50 [2018-01-24 15:23:53,328 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 15:23:53,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:53,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 15:23:53,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 15:23:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 15:23:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 15:23:53,333 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 14 [2018-01-24 15:23:53,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,333 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 15:23:53,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:23:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 15:23:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:23:53,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,334 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,334 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,334 INFO L82 PathProgramCache]: Analyzing trace with hash -435796900, now seen corresponding path program 1 times [2018-01-24 15:23:53,334 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,335 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,335 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,335 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 15:23:53,391 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 15:23:53,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 15:23:53,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 15:23:53,392 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-24 15:23:53,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,475 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 15:23:53,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 15:23:53,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 15:23:53,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,476 INFO L225 Difference]: With dead ends: 49 [2018-01-24 15:23:53,476 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 15:23:53,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 15:23:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-24 15:23:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 15:23:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 15:23:53,484 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 18 [2018-01-24 15:23:53,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,485 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 15:23:53,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 15:23:53,485 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 15:23:53,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 15:23:53,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,486 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,486 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,486 INFO L82 PathProgramCache]: Analyzing trace with hash -435796899, now seen corresponding path program 1 times [2018-01-24 15:23:53,487 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,488 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,611 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:23:53,611 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:23:53,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:23:53,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:53,612 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 8 states. [2018-01-24 15:23:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,721 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 15:23:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:23:53,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 15:23:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,725 INFO L225 Difference]: With dead ends: 73 [2018-01-24 15:23:53,725 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 15:23:53,725 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 15:23:53,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 15:23:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-01-24 15:23:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 15:23:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 15:23:53,730 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 18 [2018-01-24 15:23:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,730 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 15:23:53,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:23:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 15:23:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:23:53,731 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,731 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,732 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash 860706905, now seen corresponding path program 1 times [2018-01-24 15:23:53,732 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:23:53,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,786 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:53,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:53,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:53,787 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 6 states. [2018-01-24 15:23:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:53,857 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-24 15:23:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:53,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-24 15:23:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:53,859 INFO L225 Difference]: With dead ends: 54 [2018-01-24 15:23:53,859 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 15:23:53,859 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 15:23:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-01-24 15:23:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 15:23:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 15:23:53,865 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 21 [2018-01-24 15:23:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:53,866 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 15:23:53,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 15:23:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 15:23:53,867 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:53,867 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:53,867 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash 860706906, now seen corresponding path program 1 times [2018-01-24 15:23:53,867 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:53,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,868 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:53,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:53,869 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:53,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:53,980 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:53,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 15:23:53,980 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:53,980 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 15:23:53,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 15:23:53,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:23:53,981 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-24 15:23:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:54,105 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 15:23:54,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:23:54,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-01-24 15:23:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:54,107 INFO L225 Difference]: With dead ends: 69 [2018-01-24 15:23:54,107 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 15:23:54,107 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-24 15:23:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 15:23:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 15:23:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 15:23:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2018-01-24 15:23:54,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 21 [2018-01-24 15:23:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:54,115 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2018-01-24 15:23:54,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 15:23:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-01-24 15:23:54,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:23:54,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:54,116 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:54,116 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:54,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895137, now seen corresponding path program 1 times [2018-01-24 15:23:54,117 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:54,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:54,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,118 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:54,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:54,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:54,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 15:23:54,188 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:54,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:54,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:54,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:54,189 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 6 states. [2018-01-24 15:23:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:54,303 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-01-24 15:23:54,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 15:23:54,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 15:23:54,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:54,308 INFO L225 Difference]: With dead ends: 60 [2018-01-24 15:23:54,308 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 15:23:54,309 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 15:23:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-01-24 15:23:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 15:23:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 15:23:54,316 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 25 [2018-01-24 15:23:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:54,316 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 15:23:54,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 15:23:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 15:23:54,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:54,317 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:54,317 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1579895136, now seen corresponding path program 1 times [2018-01-24 15:23:54,318 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:54,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:54,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:54,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:54,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:54,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 15:23:54,403 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:54,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 15:23:54,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 15:23:54,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 15:23:54,404 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 8 states. [2018-01-24 15:23:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:54,504 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-01-24 15:23:54,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 15:23:54,504 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 15:23:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:54,505 INFO L225 Difference]: With dead ends: 93 [2018-01-24 15:23:54,506 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 15:23:54,506 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-24 15:23:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 15:23:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-01-24 15:23:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 15:23:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2018-01-24 15:23:54,515 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 25 [2018-01-24 15:23:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:54,516 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2018-01-24 15:23:54,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 15:23:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2018-01-24 15:23:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 15:23:54,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:54,517 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:54,517 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1731827764, now seen corresponding path program 1 times [2018-01-24 15:23:54,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:54,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:54,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:54,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:54,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:54,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 15:23:54,545 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:54,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 15:23:54,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 15:23:54,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:23:54,546 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 3 states. [2018-01-24 15:23:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:54,557 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2018-01-24 15:23:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 15:23:54,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-24 15:23:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:54,558 INFO L225 Difference]: With dead ends: 101 [2018-01-24 15:23:54,558 INFO L226 Difference]: Without dead ends: 64 [2018-01-24 15:23:54,559 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 15:23:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-24 15:23:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-24 15:23:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 15:23:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-01-24 15:23:54,566 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 26 [2018-01-24 15:23:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:54,566 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-01-24 15:23:54,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 15:23:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-01-24 15:23:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:23:54,567 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:54,567 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:54,567 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2135151184, now seen corresponding path program 1 times [2018-01-24 15:23:54,568 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:54,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,569 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:54,569 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,569 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:54,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:54,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:54,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:23:54,640 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:54,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 15:23:54,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 15:23:54,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 15:23:54,641 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 6 states. [2018-01-24 15:23:54,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:54,714 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2018-01-24 15:23:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 15:23:54,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 15:23:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:54,715 INFO L225 Difference]: With dead ends: 109 [2018-01-24 15:23:54,715 INFO L226 Difference]: Without dead ends: 70 [2018-01-24 15:23:54,716 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:23:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-24 15:23:54,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-01-24 15:23:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 15:23:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-24 15:23:54,723 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-01-24 15:23:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:54,723 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-24 15:23:54,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 15:23:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-24 15:23:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 15:23:54,724 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:54,724 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:54,725 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:54,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1750130544, now seen corresponding path program 1 times [2018-01-24 15:23:54,725 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:54,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:54,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:54,726 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:54,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:54,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 15:23:54,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 15:23:54,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:23:54,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 15:23:54,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 15:23:54,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 15:23:54,919 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 7 states. [2018-01-24 15:23:55,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 15:23:55,009 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-01-24 15:23:55,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 15:23:55,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 15:23:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 15:23:55,010 INFO L225 Difference]: With dead ends: 67 [2018-01-24 15:23:55,010 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 15:23:55,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 15:23:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 15:23:55,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 15:23:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 15:23:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-24 15:23:55,020 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-01-24 15:23:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 15:23:55,020 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-24 15:23:55,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 15:23:55,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-24 15:23:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 15:23:55,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 15:23:55,021 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 15:23:55,021 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, substringErr3RequiresViolation, substringErr1RequiresViolation, substringErr7RequiresViolation, substringErr9RequiresViolation, substringErr2RequiresViolation, substringErr8RequiresViolation, substringErr4RequiresViolation, substringErr6RequiresViolation, substringErr0RequiresViolation, substringErr5RequiresViolation]=== [2018-01-24 15:23:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1520679734, now seen corresponding path program 1 times [2018-01-24 15:23:55,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 15:23:55,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:55,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:55,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 15:23:55,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 15:23:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:55,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 15:23:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:23:55,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:55,242 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 15:23:55,243 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-24 15:23:55,245 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [42], [49], [53], [55], [57], [58], [61], [62], [65], [68], [76], [92], [93], [94], [96] [2018-01-24 15:23:55,306 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 15:23:55,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 15:23:57,826 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 15:23:57,827 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-24 15:23:57,886 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 15:23:57,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 15:23:57,887 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 15:23:57,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 15:23:57,898 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 15:23:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 15:23:57,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 15:23:57,998 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-24 15:23:57,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 15:23:58,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:58,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 15:23:58,116 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-24 15:23:58,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 15:23:58,170 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-24 15:23:58,174 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-24 15:23:58,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 15:23:58,238 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-24 15:23:58,241 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-24 15:23:58,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:23:58,252 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-24 15:23:58,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 15:24:00,603 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 30 [2018-01-24 15:24:00,927 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-24 15:24:00,947 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-24 15:24:00,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,055 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-24 15:24:01,056 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,092 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-24 15:24:01,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,201 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-24 15:24:01,201 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,280 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-24 15:24:01,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,310 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-24 15:24:01,310 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,347 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-24 15:24:01,347 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,374 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-24 15:24:01,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 15:24:01,417 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-24 15:24:01,417 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:44, output treesize:8 [2018-01-24 15:24:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:24:01,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 15:24:01,819 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-24 15:24:01,850 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-24 15:24:01,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,868 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-24 15:24:01,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 15:24:01,882 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-24 15:24:01,882 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:48, output treesize:3 [2018-01-24 15:24:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 15:24:01,966 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 15:24:01,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18, 14] imperfect sequences [12] total 39 [2018-01-24 15:24:01,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 15:24:01,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 15:24:01,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 15:24:01,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1369, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 15:24:01,968 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 18 states. [2018-01-24 15:24:06,294 WARN L143 SmtUtils]: Spent 4026ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-24 15:24:11,423 WARN L143 SmtUtils]: Spent 5089ms on a formula simplification that was a NOOP. DAG size: 38 [2018-01-24 15:24:16,538 WARN L143 SmtUtils]: Spent 5054ms on a formula simplification that was a NOOP. DAG size: 44 [2018-01-24 15:24:30,559 WARN L146 SmtUtils]: Spent 13958ms on a formula simplification. DAG size of input: 51 DAG size of output 51 [2018-01-24 15:24:42,776 WARN L146 SmtUtils]: Spent 12186ms on a formula simplification. DAG size of input: 51 DAG size of output 47 [2018-01-24 15:24:56,875 WARN L146 SmtUtils]: Spent 14068ms on a formula simplification. DAG size of input: 55 DAG size of output 51 Received shutdown request... [2018-01-24 15:25:00,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 15:25:00,932 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 15:25:00,935 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 15:25:00,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 03:25:00 BoogieIcfgContainer [2018-01-24 15:25:00,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 15:25:00,936 INFO L168 Benchmark]: Toolchain (without parser) took 69453.21 ms. Allocated memory was 308.3 MB in the beginning and 602.4 MB in the end (delta: 294.1 MB). Free memory was 268.3 MB in the beginning and 510.3 MB in the end (delta: -242.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 5.3 GB. [2018-01-24 15:25:00,937 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 15:25:00,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 15:25:00,937 INFO L168 Benchmark]: Boogie Preprocessor took 39.04 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 15:25:00,937 INFO L168 Benchmark]: RCFGBuilder took 345.47 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 235.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. [2018-01-24 15:25:00,937 INFO L168 Benchmark]: TraceAbstraction took 68841.82 ms. Allocated memory was 308.3 MB in the beginning and 602.4 MB in the end (delta: 294.1 MB). Free memory was 235.7 MB in the beginning and 510.3 MB in the end (delta: -274.6 MB). Peak memory consumption was 19.5 MB. Max. memory is 5.3 GB. [2018-01-24 15:25:00,938 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.25 ms. Allocated memory is still 308.3 MB. Free memory is still 274.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 217.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.3 MB in the beginning and 257.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.04 ms. Allocated memory is still 308.3 MB. Free memory was 257.3 MB in the beginning and 255.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 345.47 ms. Allocated memory is still 308.3 MB. Free memory was 255.3 MB in the beginning and 235.7 MB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 68841.82 ms. Allocated memory was 308.3 MB in the beginning and 602.4 MB in the end (delta: 294.1 MB). Free memory was 235.7 MB in the beginning and 510.3 MB in the end (delta: -274.6 MB). Peak memory consumption was 19.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) : 6.868620 RENAME_VARIABLES(MILLISECONDS) : 1.010187 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 6.821271 PROJECTAWAY(MILLISECONDS) : 11.712673 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.097852 DISJOIN(MILLISECONDS) : 0.549041 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.040292 ADD_EQUALITY(MILLISECONDS) : 0.015306 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009393 #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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - 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 16 states, 18 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 59. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 68.7s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 60.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 558 SDtfs, 734 SDslu, 1165 SDs, 0 SdLazy, 978 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 58.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s 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.2s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_15-25-00-948.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.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_15-25-00-948.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.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_15-25-00-948.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_15-25-00-948.csv Completed graceful shutdown