java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:18:54,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:18:54,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:18:54,929 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:18:54,929 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:18:54,930 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:18:54,931 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:18:54,933 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:18:54,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:18:54,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:18:54,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:18:54,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:18:54,937 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:18:54,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:18:54,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:18:54,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:18:54,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:18:54,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:18:54,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:18:54,949 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:18:54,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:18:54,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:18:54,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:18:54,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:18:54,953 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:18:54,955 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:18:54,955 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:18:54,956 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:18:54,956 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:18:54,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:18:54,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:18:54,957 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:18:54,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:18:54,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:18:54,967 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:18:54,967 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:18:54,967 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:18:54,967 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:18:54,968 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:18:54,968 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:18:54,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:18:54,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:18:54,968 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:18:54,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:18:54,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:18:54,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:18:54,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:18:54,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:18:54,970 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:18:54,970 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:18:54,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:18:54,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:18:54,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:18:54,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:18:54,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:18:54,972 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:18:54,972 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:18:55,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:18:55,018 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:18:55,022 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:18:55,024 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:18:55,024 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:18:55,025 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrpbrk_unsafe_false-valid-deref.i [2018-01-25 05:18:55,199 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:18:55,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:18:55,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:18:55,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:18:55,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:18:55,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cecf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55, skipping insertion in model container [2018-01-25 05:18:55,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,237 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:18:55,279 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:18:55,393 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:18:55,411 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:18:55,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55 WrapperNode [2018-01-25 05:18:55,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:18:55,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:18:55,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:18:55,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:18:55,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... [2018-01-25 05:18:55,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:18:55,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:18:55,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:18:55,458 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:18:55,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:18:55,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:18:55,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:18:55,511 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-25 05:18:55,511 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrpbrk [2018-01-25 05:18:55,511 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:18:55,511 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:18:55,511 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:18:55,511 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-25 05:18:55,512 INFO L128 BoogieDeclarations]: Found specification of procedure cstrpbrk [2018-01-25 05:18:55,513 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:18:55,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:18:55,513 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:18:55,771 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:18:55,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:18:55 BoogieIcfgContainer [2018-01-25 05:18:55,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:18:55,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:18:55,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:18:55,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:18:55,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:18:55" (1/3) ... [2018-01-25 05:18:55,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a4e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:18:55, skipping insertion in model container [2018-01-25 05:18:55,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:18:55" (2/3) ... [2018-01-25 05:18:55,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34a4e4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:18:55, skipping insertion in model container [2018-01-25 05:18:55,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:18:55" (3/3) ... [2018-01-25 05:18:55,778 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrpbrk_unsafe_false-valid-deref.i [2018-01-25 05:18:55,785 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:18:55,792 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-01-25 05:18:55,840 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:18:55,840 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:18:55,841 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:18:55,841 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:18:55,841 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:18:55,841 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:18:55,841 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:18:55,841 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:18:55,842 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:18:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-25 05:18:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:18:55,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:18:55,873 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:18:55,873 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:18:55,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838739, now seen corresponding path program 1 times [2018-01-25 05:18:55,880 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:18:55,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:55,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:18:55,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:55,928 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:18:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:18:55,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:18:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:18:56,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:18:56,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:18:56,053 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:18:56,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:18:56,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:18:56,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:18:56,068 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 4 states. [2018-01-25 05:18:56,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:18:56,326 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-01-25 05:18:56,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:18:56,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-25 05:18:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:18:56,335 INFO L225 Difference]: With dead ends: 109 [2018-01-25 05:18:56,336 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 05:18:56,338 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:18:56,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 05:18:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-25 05:18:56,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-25 05:18:56,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2018-01-25 05:18:56,372 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 11 [2018-01-25 05:18:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:18:56,373 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2018-01-25 05:18:56,373 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:18:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2018-01-25 05:18:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 05:18:56,373 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:18:56,373 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:18:56,374 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:18:56,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1167838738, now seen corresponding path program 1 times [2018-01-25 05:18:56,374 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:18:56,375 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:56,375 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:18:56,376 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:56,376 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:18:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:18:56,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:18:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:18:56,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:18:56,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:18:56,494 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:18:56,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:18:56,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:18:56,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:18:56,496 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 5 states. [2018-01-25 05:18:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:18:56,536 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2018-01-25 05:18:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:18:56,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-25 05:18:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:18:56,539 INFO L225 Difference]: With dead ends: 61 [2018-01-25 05:18:56,539 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 05:18:56,540 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:18:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 05:18:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 05:18:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 05:18:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-25 05:18:56,549 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 11 [2018-01-25 05:18:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:18:56,549 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-25 05:18:56,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:18:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-25 05:18:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:18:56,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:18:56,551 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:18:56,551 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:18:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023599, now seen corresponding path program 1 times [2018-01-25 05:18:56,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:18:56,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:56,553 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:18:56,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:18:56,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:18:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:18:56,581 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:18:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:18:56,870 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:18:56,870 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:18:56,871 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:18:56,873 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [12], [13], [15], [17], [32], [33], [34], [38], [40], [95], [96], [97], [98], [99], [101], [102], [103] [2018-01-25 05:18:56,915 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:18:56,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:18:58,524 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:18:58,526 INFO L268 AbstractInterpreter]: Visited 22 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-01-25 05:18:58,545 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 05:18:59,628 INFO L232 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 70.71% of their original sizes. [2018-01-25 05:18:59,628 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:19:00,126 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse52 (select |c_old(#valid)| 0)) (.cse0 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse53 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse63 (select (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base) (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1))))) (and (not (= |c_build_nondet_String_#t~malloc1.base| 0)) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= .cse0 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (forall ((v_weq0_1 Int)) (let ((.cse1 (select |c_#length| v_weq0_1)) (.cse2 (select |c_old(#valid)| v_weq0_1))) (or (not (= v_weq0_1 |c_build_nondet_String_#t~malloc1.base|)) (= .cse1 .cse2) (let ((.cse8 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse3 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse5 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse6 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse7 (select .cse8 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse4 (select |c_old(#valid)| 0))) (and (= .cse1 1) (= v_weq0_1 |c_build_nondet_String_#res.base|) (= .cse3 (select |c_#valid| v_weq0_1)) (= c_build_nondet_String_~nondetString~4.offset .cse4) (= c_build_nondet_String_~length~4 .cse1) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= (select |c_old(#memory_int)| v_weq0_1) (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= .cse5 .cse3) (= 1 .cse5) (= .cse2 .cse6) (= .cse6 .cse7) (= .cse7 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= (select |c_#memory_int| v_weq0_1) .cse8) (not (= |c_build_nondet_String_#res.base| 0)) (= .cse4 .cse2) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (= c_build_nondet_String_~nondetString~4.base v_weq0_1))))))) (= |c_#NULL.base| |c_#NULL.offset|) (forall ((v_weq0_1 Int) (v_weq1_1 Int)) (let ((.cse19 (select |c_#memory_int| v_weq0_1)) (.cse13 (select |c_old(#memory_int)| v_weq0_1))) (or (let ((.cse20 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base)) (.cse21 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (let ((.cse9 (select |c_#length| v_weq0_1)) (.cse10 (select |c_old(#valid)| v_weq0_1)) (.cse11 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse16 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse12 (select .cse20 .cse21)) (.cse15 (select .cse20 v_weq1_1)) (.cse17 (select .cse19 .cse21)) (.cse14 (select |c_old(#valid)| 0)) (.cse18 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|))) (and (= .cse9 1) (= c_build_nondet_String_~nondetString~4.offset .cse10) (= .cse11 (select |c_#valid| v_weq0_1)) (= c_build_nondet_String_~length~4 .cse9) (= .cse10 .cse12) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4) (+ v_weq1_1 1)) (= v_weq0_1 c_build_nondet_String_~nondetString~4.base) (= .cse13 (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= 0 .cse14) (= .cse15 |c_#NULL.base|) (= .cse16 .cse11) (= 1 .cse16) (= |c_#NULL.base| .cse17) (= c_build_nondet_String_~nondetString~4.base |c_build_nondet_String_#res.base|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= .cse18 |c_#NULL.offset|) (= .cse12 .cse15) (= .cse17 0) (= .cse19 .cse20) (not (= |c_build_nondet_String_#res.base| 0)) (= |c_build_nondet_String_#t~malloc1.base| v_weq0_1) (= .cse14 .cse18) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4)))) (= (select .cse19 v_weq1_1) (select .cse13 v_weq1_1))))) (forall ((v_weq0_1 Int)) (let ((.cse22 (select |c_old(#valid)| v_weq0_1))) (or (not (= v_weq0_1 |c_build_nondet_String_#t~malloc1.base|)) (= (select |c_old(#length)| v_weq0_1) .cse22) (let ((.cse29 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse23 (select |c_#length| v_weq0_1)) (.cse24 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse26 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse27 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse28 (select .cse29 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse25 (select |c_old(#valid)| 0))) (and (= .cse23 1) (= v_weq0_1 |c_build_nondet_String_#res.base|) (= .cse24 (select |c_#valid| v_weq0_1)) (= c_build_nondet_String_~nondetString~4.offset .cse25) (= c_build_nondet_String_~length~4 .cse23) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= (select |c_old(#memory_int)| v_weq0_1) (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= .cse26 .cse24) (= 1 .cse26) (= .cse22 .cse27) (= .cse27 .cse28) (= .cse28 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= (select |c_#memory_int| v_weq0_1) .cse29) (not (= |c_build_nondet_String_#res.base| 0)) (= .cse25 .cse22) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (= c_build_nondet_String_~nondetString~4.base v_weq0_1))))))) (forall ((v_weq0_1 Int)) (let ((.cse31 (select |c_#valid| v_weq0_1)) (.cse30 (select |c_old(#valid)| v_weq0_1))) (or (= .cse30 .cse31) (let ((.cse38 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse32 (select |c_#length| v_weq0_1)) (.cse33 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse35 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse36 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse37 (select .cse38 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse34 (select |c_old(#valid)| 0))) (and (= .cse32 1) (= v_weq0_1 |c_build_nondet_String_#res.base|) (= .cse33 .cse31) (= c_build_nondet_String_~nondetString~4.offset .cse34) (= c_build_nondet_String_~length~4 .cse32) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= (select |c_old(#memory_int)| v_weq0_1) (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= .cse35 .cse33) (= 1 .cse35) (= .cse30 .cse36) (= .cse36 .cse37) (= .cse37 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= (select |c_#memory_int| v_weq0_1) .cse38) (not (= |c_build_nondet_String_#res.base| 0)) (= .cse34 .cse30) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (= c_build_nondet_String_~nondetString~4.base v_weq0_1))))))) (forall ((v_weq0_1 Int)) (let ((.cse43 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse42 (select .cse43 v_weq0_1))) (or (let ((.cse40 (select .cse43 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse41 (select |c_old(#valid)| 0)) (.cse39 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|))) (and (= .cse39 .cse40) (= .cse40 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (not (= |c_build_nondet_String_#t~malloc1.base| 0)) (= |c_build_nondet_String_#t~malloc1.offset| 0) (= (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4) (+ v_weq0_1 1)) (= c_build_nondet_String_~nondetString~4.offset .cse41) (= 0 .cse42) (= .cse41 .cse39) (= .cse42 |c_build_nondet_String_#res.offset|))) (= (select (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base) v_weq0_1) .cse42))))) (forall ((v_weq0_1 Int)) (let ((.cse44 (select |c_#length| v_weq0_1))) (or (= .cse44 (select |c_old(#length)| v_weq0_1)) (let ((.cse51 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse45 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse47 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse49 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse50 (select .cse51 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse46 (select |c_old(#valid)| 0)) (.cse48 (select |c_old(#valid)| v_weq0_1))) (and (= .cse44 1) (= v_weq0_1 |c_build_nondet_String_#res.base|) (= .cse45 (select |c_#valid| v_weq0_1)) (= c_build_nondet_String_~nondetString~4.offset .cse46) (= c_build_nondet_String_~length~4 .cse44) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= (select |c_old(#memory_int)| v_weq0_1) (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= .cse47 .cse45) (= 1 .cse47) (= .cse48 .cse49) (= .cse49 .cse50) (= .cse50 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= (select |c_#memory_int| v_weq0_1) .cse51) (not (= |c_build_nondet_String_#res.base| 0)) (= .cse46 .cse48) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (= c_build_nondet_String_~nondetString~4.base v_weq0_1))))))) (= .cse52 .cse53) (forall ((v_weq0_1 Int)) (or (not (= v_weq0_1 |c_build_nondet_String_#t~malloc1.base|)) (= (select |c_#length| v_weq0_1) (select |c_#valid| v_weq0_1)))) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (not (= |c_#length| |c_old(#valid)|)) (forall ((v_weq0_1 Int)) (let ((.cse54 (select |c_#valid| v_weq0_1))) (or (= (select |c_old(#length)| v_weq0_1) .cse54) (not (= v_weq0_1 |c_build_nondet_String_#t~malloc1.base|)) (let ((.cse62 (select |c_#memory_int| c_build_nondet_String_~nondetString~4.base))) (let ((.cse55 (select |c_#length| v_weq0_1)) (.cse56 (select |c_#length| |c_build_nondet_String_#t~malloc1.base|)) (.cse58 (select |c_#valid| |c_build_nondet_String_#t~malloc1.base|)) (.cse60 (select |c_old(#valid)| |c_build_nondet_String_#t~malloc1.base|)) (.cse61 (select .cse62 (+ c_build_nondet_String_~nondetString~4.offset c_build_nondet_String_~length~4 (- 1)))) (.cse57 (select |c_old(#valid)| 0)) (.cse59 (select |c_old(#valid)| v_weq0_1))) (and (= .cse55 1) (= v_weq0_1 |c_build_nondet_String_#res.base|) (= .cse56 .cse54) (= c_build_nondet_String_~nondetString~4.offset .cse57) (= c_build_nondet_String_~length~4 .cse55) (= |c_build_nondet_String_#t~malloc1.base| c_build_nondet_String_~nondetString~4.base) (= |c_build_nondet_String_#t~malloc1.offset| |c_build_nondet_String_#res.offset|) (= 0 |c_build_nondet_String_#t~malloc1.offset|) (= (select |c_old(#memory_int)| v_weq0_1) (select |c_old(#memory_int)| c_build_nondet_String_~nondetString~4.base)) (= .cse58 .cse56) (= 1 .cse58) (= .cse59 .cse60) (= .cse60 .cse61) (= .cse61 |c_#NULL.base|) (= |c_#NULL.base| |c_#NULL.offset|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= (select |c_#memory_int| v_weq0_1) .cse62) (not (= |c_build_nondet_String_#res.base| 0)) (= .cse57 .cse59) (= (select |c_#valid| c_build_nondet_String_~nondetString~4.base) c_build_nondet_String_~length~4) (= c_build_nondet_String_~nondetString~4.base v_weq0_1))))))) (= c_build_nondet_String_~nondetString~4.offset .cse52) (= 1 .cse0) (= .cse53 .cse63) (= c_build_nondet_String_~nondetString~4.base |c_build_nondet_String_#res.base|) (= .cse63 |c_#NULL.base|) (= |c_build_nondet_String_#res.offset| c_build_nondet_String_~nondetString~4.offset) (= c_build_nondet_String_~length~4 1) (not (= |c_#valid| |c_old(#valid)|)))) is different from false [2018-01-25 05:19:00,317 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 05:19:00,318 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:19:00,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [11] total 29 [2018-01-25 05:19:00,318 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:19:00,319 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 05:19:00,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 05:19:00,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=275, Unknown=2, NotChecked=34, Total=380 [2018-01-25 05:19:00,320 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 20 states. [2018-01-25 05:19:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:34,630 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-01-25 05:19:34,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 05:19:34,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-01-25 05:19:34,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:34,635 INFO L225 Difference]: With dead ends: 161 [2018-01-25 05:19:34,635 INFO L226 Difference]: Without dead ends: 157 [2018-01-25 05:19:34,636 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=4, NotChecked=42, Total=552 [2018-01-25 05:19:34,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-25 05:19:34,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2018-01-25 05:19:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 05:19:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 159 transitions. [2018-01-25 05:19:34,653 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 159 transitions. Word has length 29 [2018-01-25 05:19:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:34,654 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 159 transitions. [2018-01-25 05:19:34,654 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 05:19:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 159 transitions. [2018-01-25 05:19:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:19:34,655 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:34,656 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:34,656 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:19:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1764023598, now seen corresponding path program 1 times [2018-01-25 05:19:34,656 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:34,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:34,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:34,657 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:34,658 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:34,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:34,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:34,906 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:19:34,907 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:19:34,907 INFO L201 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [12], [13], [15], [17], [32], [33], [34], [38], [41], [95], [96], [97], [98], [99], [101], [102], [103] [2018-01-25 05:19:34,908 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:19:34,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:19:35,509 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:19:35,510 INFO L268 AbstractInterpreter]: Visited 22 different actions 29 times. Never merged. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-01-25 05:19:35,513 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:19:35,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:35,514 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:19:35,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:35,522 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:35,565 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:35,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:19:35,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:35,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:35,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-25 05:19:35,894 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int)) (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| 1) |c_#length|)) is different from true [2018-01-25 05:19:35,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-25 05:19:35,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:35,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 05:19:35,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-01-25 05:19:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-25 05:19:35,984 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:36,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:36,463 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 05:19:36,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:36,467 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:19:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:36,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:19:36,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:19:36,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:19:36,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-25 05:19:36,670 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|build_nondet_String_#t~malloc1.base| Int) (build_nondet_String_~length~4 Int)) (and (= (store |c_old(#length)| |build_nondet_String_#t~malloc1.base| build_nondet_String_~length~4) |c_#length|) (= 0 (select |c_old(#valid)| |build_nondet_String_#t~malloc1.base|)))) is different from true [2018-01-25 05:19:36,678 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:36,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-25 05:19:36,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:36,695 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 05:19:36,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-25 05:19:36,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:36,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-01-25 05:19:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-01-25 05:19:36,748 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:19:36,866 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 05:19:38,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-01-25 05:19:38,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:38,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-01-25 05:19:38,091 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-25 05:19:38,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:38,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-01-25 05:19:38,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 05:19:38,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:38,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:19:38,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:21, output treesize:3 [2018-01-25 05:19:38,116 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:38,118 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:19:38,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13, 12, 12] total 50 [2018-01-25 05:19:38,119 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:19:38,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-25 05:19:38,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-25 05:19:38,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2187, Unknown=3, NotChecked=190, Total=2550 [2018-01-25 05:19:38,121 INFO L87 Difference]: Start difference. First operand 123 states and 159 transitions. Second operand 28 states. [2018-01-25 05:19:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:19:39,724 INFO L93 Difference]: Finished difference Result 212 states and 260 transitions. [2018-01-25 05:19:39,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-25 05:19:39,724 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 29 [2018-01-25 05:19:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:19:39,727 INFO L225 Difference]: With dead ends: 212 [2018-01-25 05:19:39,727 INFO L226 Difference]: Without dead ends: 209 [2018-01-25 05:19:39,729 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=427, Invalid=4000, Unknown=3, NotChecked=262, Total=4692 [2018-01-25 05:19:39,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-25 05:19:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 132. [2018-01-25 05:19:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-25 05:19:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 172 transitions. [2018-01-25 05:19:39,748 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 172 transitions. Word has length 29 [2018-01-25 05:19:39,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:19:39,749 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 172 transitions. [2018-01-25 05:19:39,749 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-25 05:19:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 172 transitions. [2018-01-25 05:19:39,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:19:39,750 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:19:39,750 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:19:39,750 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrpbrkErr3RequiresViolation, cstrpbrkErr1RequiresViolation, cstrpbrkErr9RequiresViolation, cstrpbrkErr7RequiresViolation, cstrpbrkErr2RequiresViolation, cstrpbrkErr8RequiresViolation, cstrpbrkErr4RequiresViolation, cstrpbrkErr0RequiresViolation, cstrpbrkErr6RequiresViolation, cstrpbrkErr5RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-25 05:19:39,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1505858161, now seen corresponding path program 1 times [2018-01-25 05:19:39,751 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:19:39,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:39,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:19:39,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:19:39,752 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:19:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:19:39,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:19:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:19:39,862 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:19:39,862 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:19:39,862 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 05:19:39,862 INFO L201 CegarAbsIntRunner]: [0], [3], [5], [7], [8], [9], [12], [13], [15], [17], [32], [33], [34], [38], [40], [95], [96], [97], [98], [99], [101], [102], [103] [2018-01-25 05:19:39,863 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:19:39,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:19:45,686 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 05:19:45,686 INFO L268 AbstractInterpreter]: Visited 23 different actions 75 times. Merged at 10 different actions 26 times. Never widened. Never found a fixpoint. Largest state had 23 variables. [2018-01-25 05:19:45,688 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates Received shutdown request... [2018-01-25 05:19:46,770 INFO L232 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 50.99% of their original sizes. [2018-01-25 05:19:46,770 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 05:19:46,778 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:19:46,782 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:19:46,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:19:46 BoogieIcfgContainer [2018-01-25 05:19:46,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:19:46,783 INFO L168 Benchmark]: Toolchain (without parser) took 51582.95 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 767.0 MB). Free memory was 265.2 MB in the beginning and 636.0 MB in the end (delta: -370.8 MB). Peak memory consumption was 396.2 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:46,783 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:19:46,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 212.56 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:46,784 INFO L168 Benchmark]: Boogie Preprocessor took 37.95 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:46,784 INFO L168 Benchmark]: RCFGBuilder took 314.21 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 231.6 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:46,785 INFO L168 Benchmark]: TraceAbstraction took 51009.92 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 767.0 MB). Free memory was 231.6 MB in the beginning and 636.0 MB in the end (delta: -404.3 MB). Peak memory consumption was 362.7 MB. Max. memory is 5.3 GB. [2018-01-25 05:19:46,786 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.21 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 212.56 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 254.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.95 ms. Allocated memory is still 305.1 MB. Free memory was 254.2 MB in the beginning and 252.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 314.21 ms. Allocated memory is still 305.1 MB. Free memory was 252.2 MB in the beginning and 231.6 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51009.92 ms. Allocated memory was 305.1 MB in the beginning and 1.1 GB in the end (delta: 767.0 MB). Free memory was 231.6 MB in the beginning and 636.0 MB in the end (delta: -404.3 MB). Peak memory consumption was 362.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 161 LocStat_NO_SUPPORTING_DISEQUALITIES : 32 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 51 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.958469 RENAME_VARIABLES(MILLISECONDS) : 0.455215 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.902286 PROJECTAWAY(MILLISECONDS) : 0.042302 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.241756 DISJOIN(MILLISECONDS) : 0.158461 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.491960 ADD_EQUALITY(MILLISECONDS) : 0.019983 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017938 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 90 #PROJECTAWAY : 72 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 8 #RENAME_VARIABLES_DISJUNCTIVE : 77 #ADD_EQUALITY : 52 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 180 LocStat_NO_SUPPORTING_DISEQUALITIES : 35 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 53 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.579911 RENAME_VARIABLES(MILLISECONDS) : 0.300726 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.616415 PROJECTAWAY(MILLISECONDS) : 0.073248 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.045800 DISJOIN(MILLISECONDS) : 0.102981 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.321410 ADD_EQUALITY(MILLISECONDS) : 0.018802 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009289 #CONJOIN_DISJUNCTIVE : 48 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 91 #PROJECTAWAY : 75 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 77 #ADD_EQUALITY : 54 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 148 LocStat_NO_SUPPORTING_DISEQUALITIES : 27 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 52 TransStat_NO_SUPPORTING_DISEQUALITIES : 3 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.175079 RENAME_VARIABLES(MILLISECONDS) : 0.049871 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.156916 PROJECTAWAY(MILLISECONDS) : 0.027193 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.117689 DISJOIN(MILLISECONDS) : 0.085341 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.062458 ADD_EQUALITY(MILLISECONDS) : 0.008953 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016146 #CONJOIN_DISJUNCTIVE : 117 #RENAME_VARIABLES : 246 #UNFREEZE : 0 #CONJOIN : 197 #PROJECTAWAY : 171 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 46 #RENAME_VARIABLES_DISJUNCTIVE : 246 #ADD_EQUALITY : 53 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 568). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 30 with TraceHistMax 2, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 65 locations, 19 error locations. TIMEOUT Result, 50.9s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 36.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 205 SDtfs, 690 SDslu, 659 SDs, 0 SdLazy, 1221 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 187 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 8.1s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.8600659261373548 AbsIntWeakeningRatio, 1.3214285714285714 AbsIntAvgWeakeningVarsNumRemoved, 5.660714285714286 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 111 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 188 ConstructedInterpolants, 32 QuantifiedInterpolants, 49100 SizeOfPredicates, 27 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/48 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/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_05-19-46-795.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrpbrk_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-19-46-795.csv Completed graceful shutdown