java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:47:42,148 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:47:42,149 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:47:42,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:47:42,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:47:42,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:47:42,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:47:42,165 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:47:42,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:47:42,168 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:47:42,169 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:47:42,169 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:47:42,170 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:47:42,171 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:47:42,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:47:42,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:47:42,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:47:42,178 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:47:42,179 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:47:42,180 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:47:42,183 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:47:42,183 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:47:42,183 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:47:42,184 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:47:42,185 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:47:42,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:47:42,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:47:42,187 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:47:42,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:47:42,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:47:42,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:47:42,188 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:47:42,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:47:42,199 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:47:42,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:47:42,200 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:47:42,200 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:47:42,200 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:47:42,200 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:47:42,200 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:47:42,201 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:47:42,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:47:42,201 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:47:42,202 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:47:42,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:47:42,202 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:47:42,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:47:42,202 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:47:42,203 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:47:42,203 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:47:42,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:47:42,203 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:47:42,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:47:42,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:47:42,204 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:47:42,204 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:47:42,204 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:47:42,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:47:42,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:47:42,205 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:47:42,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:47:42,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:47:42,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:47:42,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:47:42,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:47:42,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:47:42,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:47:42,207 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:47:42,207 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:47:42,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:47:42,253 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:47:42,257 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:47:42,258 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:47:42,258 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:47:42,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:47:42,439 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:47:42,445 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:47:42,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:47:42,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:47:42,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:47:42,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42, skipping insertion in model container [2018-01-25 02:47:42,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,469 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:47:42,507 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:47:42,649 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:47:42,675 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:47:42,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42 WrapperNode [2018-01-25 02:47:42,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:47:42,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:47:42,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:47:42,687 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:47:42,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... [2018-01-25 02:47:42,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:47:42,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:47:42,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:47:42,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:47:42,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:47:42,806 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:47:42,806 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:47:42,806 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-25 02:47:42,806 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-25 02:47:42,807 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-25 02:47:42,807 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:47:42,807 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:47:42,807 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:47:42,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:47:42,807 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:47:42,808 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:47:42,808 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:47:42,808 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-25 02:47:42,808 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-25 02:47:42,808 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-25 02:47:42,809 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:47:42,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:47:42,809 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:47:43,190 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:47:43,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:47:43 BoogieIcfgContainer [2018-01-25 02:47:43,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:47:43,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:47:43,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:47:43,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:47:43,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:47:42" (1/3) ... [2018-01-25 02:47:43,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b20224a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:47:43, skipping insertion in model container [2018-01-25 02:47:43,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:47:42" (2/3) ... [2018-01-25 02:47:43,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b20224a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:47:43, skipping insertion in model container [2018-01-25 02:47:43,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:47:43" (3/3) ... [2018-01-25 02:47:43,199 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:47:43,207 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:47:43,213 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-25 02:47:43,258 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:47:43,258 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:47:43,258 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:47:43,258 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:47:43,258 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:47:43,258 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:47:43,259 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:47:43,259 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:47:43,259 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:47:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-01-25 02:47:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:47:43,281 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:43,282 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:43,283 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:43,287 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-01-25 02:47:43,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:43,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:43,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:43,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:43,349 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:43,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:43,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:43,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:47:43,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:43,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:47:43,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:47:43,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:47:43,650 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-01-25 02:47:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:43,841 INFO L93 Difference]: Finished difference Result 147 states and 171 transitions. [2018-01-25 02:47:43,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:47:43,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:47:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:43,852 INFO L225 Difference]: With dead ends: 147 [2018-01-25 02:47:43,852 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 02:47:43,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 02:47:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-25 02:47:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-25 02:47:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-01-25 02:47:43,896 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-01-25 02:47:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:43,897 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-01-25 02:47:43,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:47:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-01-25 02:47:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:47:43,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:43,898 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:43,898 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-01-25 02:47:43,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:43,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:43,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:43,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:43,900 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:43,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:44,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:44,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:47:44,098 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:44,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:47:44,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:47:44,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:47:44,101 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-01-25 02:47:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:44,424 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-01-25 02:47:44,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:47:44,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:47:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:44,427 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:47:44,427 INFO L226 Difference]: Without dead ends: 85 [2018-01-25 02:47:44,428 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-25 02:47:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-25 02:47:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-25 02:47:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 02:47:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-01-25 02:47:44,440 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-01-25 02:47:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:44,441 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-01-25 02:47:44,441 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:47:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-01-25 02:47:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:47:44,442 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:44,442 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:44,442 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:44,442 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-01-25 02:47:44,442 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:44,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:44,444 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,444 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:44,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:44,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:44,525 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:44,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:47:44,525 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:44,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:47:44,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:47:44,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:47:44,526 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-01-25 02:47:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:44,721 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-25 02:47:44,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:47:44,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:47:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:44,723 INFO L225 Difference]: With dead ends: 85 [2018-01-25 02:47:44,723 INFO L226 Difference]: Without dead ends: 84 [2018-01-25 02:47:44,724 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-25 02:47:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-25 02:47:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-25 02:47:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-25 02:47:44,734 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-01-25 02:47:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:44,734 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-25 02:47:44,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:47:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-25 02:47:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:47:44,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:44,735 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:44,736 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-01-25 02:47:44,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:44,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:44,737 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,737 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:44,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:44,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:44,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:47:44,818 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:44,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:47:44,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:47:44,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:44,819 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-01-25 02:47:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:44,847 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-01-25 02:47:44,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:47:44,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:47:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:44,849 INFO L225 Difference]: With dead ends: 84 [2018-01-25 02:47:44,849 INFO L226 Difference]: Without dead ends: 83 [2018-01-25 02:47:44,849 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:47:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-25 02:47:44,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-25 02:47:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 02:47:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-01-25 02:47:44,855 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-01-25 02:47:44,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:44,856 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-01-25 02:47:44,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:47:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-01-25 02:47:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:47:44,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:44,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:44,856 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-01-25 02:47:44,857 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:44,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,858 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:44,858 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:44,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:44,868 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:44,903 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:44,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:47:44,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:44,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:47:44,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:47:44,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:47:44,907 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-01-25 02:47:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:44,994 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-01-25 02:47:44,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:47:44,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 02:47:44,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:44,996 INFO L225 Difference]: With dead ends: 83 [2018-01-25 02:47:44,996 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 02:47:44,996 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:47:44,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 02:47:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-25 02:47:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-25 02:47:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-25 02:47:45,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-01-25 02:47:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,006 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-25 02:47:45,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:47:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-25 02:47:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 02:47:45,007 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,007 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,008 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-01-25 02:47:45,008 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,009 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:45,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:45,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:45,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:47:45,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:45,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:47:45,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:47:45,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:47:45,100 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-01-25 02:47:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:45,204 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-25 02:47:45,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:47:45,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-25 02:47:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:45,205 INFO L225 Difference]: With dead ends: 82 [2018-01-25 02:47:45,205 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 02:47:45,206 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:47:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 02:47:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-25 02:47:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 02:47:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-01-25 02:47:45,222 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-01-25 02:47:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,222 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-01-25 02:47:45,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:47:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-01-25 02:47:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:47:45,223 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,224 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,224 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-01-25 02:47:45,224 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,225 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,225 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,226 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:45,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:45,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:47:45,329 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:45,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:47:45,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:47:45,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:47:45,330 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-01-25 02:47:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:45,473 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-01-25 02:47:45,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 02:47:45,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-25 02:47:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:45,474 INFO L225 Difference]: With dead ends: 81 [2018-01-25 02:47:45,474 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 02:47:45,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:47:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 02:47:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-25 02:47:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-25 02:47:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-25 02:47:45,480 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-01-25 02:47:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,480 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-25 02:47:45,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:47:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-25 02:47:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:47:45,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,481 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,481 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-01-25 02:47:45,481 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,482 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:45,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:45,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:45,672 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 02:47:45,672 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:45,672 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 02:47:45,672 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 02:47:45,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:47:45,673 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-01-25 02:47:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:45,962 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2018-01-25 02:47:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-25 02:47:45,963 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-25 02:47:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:45,966 INFO L225 Difference]: With dead ends: 165 [2018-01-25 02:47:45,966 INFO L226 Difference]: Without dead ends: 104 [2018-01-25 02:47:45,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-01-25 02:47:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-25 02:47:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-01-25 02:47:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-25 02:47:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-01-25 02:47:45,973 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-01-25 02:47:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:45,974 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-01-25 02:47:45,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 02:47:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-01-25 02:47:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:47:45,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:45,974 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:45,975 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-01-25 02:47:45,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:45,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:45,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:45,976 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:45,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:46,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:46,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-25 02:47:46,476 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:46,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-25 02:47:46,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-25 02:47:46,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:47:46,476 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 16 states. [2018-01-25 02:47:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:47,365 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-01-25 02:47:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 02:47:47,365 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-25 02:47:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:47,368 INFO L225 Difference]: With dead ends: 153 [2018-01-25 02:47:47,368 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 02:47:47,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-01-25 02:47:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 02:47:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-01-25 02:47:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-25 02:47:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2018-01-25 02:47:47,386 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 23 [2018-01-25 02:47:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:47,386 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2018-01-25 02:47:47,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-25 02:47:47,386 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2018-01-25 02:47:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:47:47,387 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:47,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:47:47,388 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:47,388 INFO L82 PathProgramCache]: Analyzing trace with hash -197547585, now seen corresponding path program 1 times [2018-01-25 02:47:47,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:47,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:47,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:47,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:47,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:47,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:47,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:47:47,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:47:47,767 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:47:47,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:47:47,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:47:47,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-25 02:47:47,767 INFO L87 Difference]: Start difference. First operand 131 states and 151 transitions. Second operand 13 states. [2018-01-25 02:47:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:47:48,147 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-01-25 02:47:48,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:47:48,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-01-25 02:47:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:47:48,149 INFO L225 Difference]: With dead ends: 150 [2018-01-25 02:47:48,149 INFO L226 Difference]: Without dead ends: 149 [2018-01-25 02:47:48,150 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-01-25 02:47:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-25 02:47:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 96. [2018-01-25 02:47:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-25 02:47:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-01-25 02:47:48,160 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-01-25 02:47:48,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:47:48,160 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-01-25 02:47:48,160 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:47:48,160 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-01-25 02:47:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 02:47:48,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:47:48,162 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] [2018-01-25 02:47:48,162 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:47:48,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-01-25 02:47:48,162 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:47:48,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:48,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:47:48,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:47:48,164 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:47:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:47:48,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:47:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:47:48,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:47:48,474 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:47:48,474 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 02:47:48,476 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [7], [9], [14], [16], [25], [28], [36], [38], [39], [40], [41], [42], [45], [104], [105], [108], [111], [155], [156], [157], [159], [161] [2018-01-25 02:47:48,525 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:47:48,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:48:34,545 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:48:34,546 INFO L268 AbstractInterpreter]: Visited 26 different actions 31 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 02:48:34,578 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:48:34,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:34,579 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:48:34,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:34,596 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:48:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:34,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:48:34,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:48:34,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:34,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:34,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:48:34,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:48:34,742 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 12 treesize of output 11 [2018-01-25 02:48:34,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:34,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:34,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:34,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:48:34,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:48:34,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:48:34,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:48:34,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:34,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:34,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 02:48:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:35,079 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:48:35,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:48:35,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:48:35,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:35,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 02:48:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:35,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:48:35,675 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:48:35,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:35,680 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:48:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:35,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:48:35,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 02:48:35,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 02:48:35,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:48:35,752 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 12 treesize of output 11 [2018-01-25 02:48:35,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-25 02:48:35,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-25 02:48:35,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-01-25 02:48:35,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-25 02:48:35,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:35,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:35,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-25 02:48:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:35,801 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:48:35,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-25 02:48:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-25 02:48:35,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:48:35,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-25 02:48:35,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-01-25 02:48:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:35,925 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:48:35,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12, 12] total 32 [2018-01-25 02:48:35,925 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:48:35,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 02:48:35,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 02:48:35,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 02:48:35,927 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-01-25 02:48:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:37,014 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2018-01-25 02:48:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 02:48:37,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-01-25 02:48:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:37,015 INFO L225 Difference]: With dead ends: 101 [2018-01-25 02:48:37,015 INFO L226 Difference]: Without dead ends: 100 [2018-01-25 02:48:37,016 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=1889, Unknown=0, NotChecked=0, Total=2162 [2018-01-25 02:48:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-25 02:48:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-01-25 02:48:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 02:48:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-01-25 02:48:37,025 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-01-25 02:48:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:37,026 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-01-25 02:48:37,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 02:48:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-01-25 02:48:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 02:48:37,027 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:37,027 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:48:37,027 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:48:37,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-01-25 02:48:37,028 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:37,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:37,029 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:37,029 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:37,029 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:37,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:48:37,480 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 19 DAG size of output 10 [2018-01-25 02:48:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:48:37,721 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:48:37,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:48:37,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:48:37,722 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:48:37,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:48:37,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:48:37,722 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-01-25 02:48:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:48:37,950 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-01-25 02:48:37,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:48:37,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 02:48:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:48:37,951 INFO L225 Difference]: With dead ends: 93 [2018-01-25 02:48:37,951 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 02:48:37,952 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:48:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 02:48:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-25 02:48:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 02:48:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-01-25 02:48:37,958 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-01-25 02:48:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:48:37,958 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-01-25 02:48:37,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:48:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-01-25 02:48:37,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 02:48:37,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:48:37,959 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, 1, 1, 1] [2018-01-25 02:48:37,959 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-01-25 02:48:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-01-25 02:48:37,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:48:37,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:37,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:48:37,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:48:37,960 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:48:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:48:37,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-25 02:48:38,071 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:48:38,078 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:48:38,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:48:38 BoogieIcfgContainer [2018-01-25 02:48:38,078 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:48:38,079 INFO L168 Benchmark]: Toolchain (without parser) took 55639.72 ms. Allocated memory was 299.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 258.2 MB in the beginning and 1.1 GB in the end (delta: -861.9 MB). Peak memory consumption was 972.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:38,080 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:48:38,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.98 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 246.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:38,081 INFO L168 Benchmark]: Boogie Preprocessor took 48.72 ms. Allocated memory is still 299.9 MB. Free memory was 246.3 MB in the beginning and 244.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:38,081 INFO L168 Benchmark]: RCFGBuilder took 454.75 ms. Allocated memory is still 299.9 MB. Free memory was 244.3 MB in the beginning and 218.6 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:38,081 INFO L168 Benchmark]: TraceAbstraction took 54886.31 ms. Allocated memory was 299.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 218.6 MB in the beginning and 1.1 GB in the end (delta: -901.5 MB). Peak memory consumption was 932.4 MB. Max. memory is 5.3 GB. [2018-01-25 02:48:38,083 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.98 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 246.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.72 ms. Allocated memory is still 299.9 MB. Free memory was 246.3 MB in the beginning and 244.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 454.75 ms. Allocated memory is still 299.9 MB. Free memory was 244.3 MB in the beginning and 218.6 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 54886.31 ms. Allocated memory was 299.9 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 218.6 MB in the beginning and 1.1 GB in the end (delta: -901.5 MB). Peak memory consumption was 932.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 244 LocStat_NO_SUPPORTING_DISEQUALITIES : 59 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 34 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 60 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.608805 RENAME_VARIABLES(MILLISECONDS) : 0.300925 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.572021 PROJECTAWAY(MILLISECONDS) : 0.375549 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.076594 DISJOIN(MILLISECONDS) : 0.277247 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.332736 ADD_EQUALITY(MILLISECONDS) : 0.015105 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013706 #CONJOIN_DISJUNCTIVE : 55 #RENAME_VARIABLES : 84 #UNFREEZE : 0 #CONJOIN : 103 #PROJECTAWAY : 78 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 81 #ADD_EQUALITY : 62 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 32 with TraceHistMax 1, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 30 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 54.8s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 970 SDtfs, 688 SDslu, 3648 SDs, 0 SdLazy, 2111 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 91 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 327 ConstructedInterpolants, 14 QuantifiedInterpolants, 72514 SizeOfPredicates, 29 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 0/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/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-48-38-095.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-48-38-095.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-48-38-095.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-48-38-095.csv Completed graceful shutdown