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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:44:00,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:44:00,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:44:00,176 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:44:00,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:44:00,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:44:00,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:44:00,180 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:44:00,182 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:44:00,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:44:00,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:44:00,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:44:00,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:44:00,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:44:00,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:44:00,188 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:44:00,191 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:44:00,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:44:00,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:44:00,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:44:00,198 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:44:00,198 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:44:00,199 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:44:00,200 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:44:00,201 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:44:00,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:44:00,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:44:00,203 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:44:00,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:44:00,204 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:44:00,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:44:00,205 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:44:00,215 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:44:00,215 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:44:00,216 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:44:00,216 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:44:00,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:44:00,217 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:44:00,217 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:44:00,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:44:00,218 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:44:00,218 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:44:00,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:44:00,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:44:00,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:44:00,219 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:44:00,219 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:44:00,219 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:44:00,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:44:00,219 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:44:00,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:44:00,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:44:00,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:44:00,220 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:44:00,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:44:00,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:00,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:44:00,221 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:44:00,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:44:00,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:44:00,222 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:44:00,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:44:00,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:44:00,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:44:00,223 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:44:00,223 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:44:00,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:44:00,270 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:44:00,274 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:44:00,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:44:00,277 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:44:00,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-01-24 12:44:00,447 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:44:00,453 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:44:00,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:00,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:44:00,459 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:44:00,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a926555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00, skipping insertion in model container [2018-01-24 12:44:00,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,478 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:00,518 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:44:00,633 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:00,648 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:44:00,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00 WrapperNode [2018-01-24 12:44:00,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:44:00,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:44:00,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:44:00,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:44:00,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... [2018-01-24 12:44:00,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:44:00,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:44:00,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:44:00,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:44:00,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:44:00,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:44:00,731 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:44:00,731 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-24 12:44:00,731 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-24 12:44:00,731 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:44:00,732 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-24 12:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-24 12:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:44:00,733 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:44:00,949 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:44:00,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:00 BoogieIcfgContainer [2018-01-24 12:44:00,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:44:00,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:44:00,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:44:00,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:44:00,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:44:00" (1/3) ... [2018-01-24 12:44:00,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1037edec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:00, skipping insertion in model container [2018-01-24 12:44:00,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:44:00" (2/3) ... [2018-01-24 12:44:00,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1037edec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:44:00, skipping insertion in model container [2018-01-24 12:44:00,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:44:00" (3/3) ... [2018-01-24 12:44:00,956 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-01-24 12:44:00,963 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:44:00,969 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-24 12:44:01,005 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:44:01,006 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:44:01,006 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:44:01,006 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:44:01,006 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:44:01,006 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:44:01,007 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:44:01,007 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:44:01,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:44:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-24 12:44:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:44:01,037 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:01,038 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:01,038 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:01,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965141, now seen corresponding path program 1 times [2018-01-24 12:44:01,047 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:01,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:01,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,087 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:01,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:01,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:01,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:01,217 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:01,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:44:01,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:44:01,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:44:01,232 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2018-01-24 12:44:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:01,419 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 12:44:01,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:44:01,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-01-24 12:44:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:01,432 INFO L225 Difference]: With dead ends: 70 [2018-01-24 12:44:01,432 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 12:44:01,436 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 12:44:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 12:44:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 12:44:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 12:44:01,467 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2018-01-24 12:44:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:01,467 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 12:44:01,467 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:44:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 12:44:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 12:44:01,468 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:01,468 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:01,468 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965140, now seen corresponding path program 1 times [2018-01-24 12:44:01,468 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:01,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,469 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:01,469 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,469 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:01,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:01,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:01,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:44:01,603 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:01,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:44:01,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:44:01,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:44:01,606 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-24 12:44:01,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:01,648 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-24 12:44:01,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:44:01,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-24 12:44:01,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:01,650 INFO L225 Difference]: With dead ends: 46 [2018-01-24 12:44:01,651 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 12:44:01,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:44:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 12:44:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 12:44:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 12:44:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-24 12:44:01,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-01-24 12:44:01,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:01,658 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-24 12:44:01,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:44:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-24 12:44:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:44:01,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:01,659 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:01,659 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925183, now seen corresponding path program 1 times [2018-01-24 12:44:01,660 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:01,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:01,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:01,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:01,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:01,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:44:01,777 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:01,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:44:01,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:44:01,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:44:01,778 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2018-01-24 12:44:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:01,965 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-01-24 12:44:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:44:01,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:44:01,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:01,967 INFO L225 Difference]: With dead ends: 45 [2018-01-24 12:44:01,967 INFO L226 Difference]: Without dead ends: 41 [2018-01-24 12:44:01,967 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:44:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-24 12:44:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-24 12:44:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-24 12:44:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-24 12:44:01,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-01-24 12:44:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:01,972 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-24 12:44:01,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:44:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-24 12:44:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:44:01,973 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:01,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] [2018-01-24 12:44:01,974 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:01,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925182, now seen corresponding path program 1 times [2018-01-24 12:44:01,974 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:01,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:01,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:01,976 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:01,993 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:02,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:02,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:44:02,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:02,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:44:02,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:44:02,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:44:02,134 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-01-24 12:44:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:02,338 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 12:44:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:44:02,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-01-24 12:44:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:02,343 INFO L225 Difference]: With dead ends: 56 [2018-01-24 12:44:02,343 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 12:44:02,344 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:44:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 12:44:02,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-01-24 12:44:02,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 12:44:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-24 12:44:02,352 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2018-01-24 12:44:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:02,352 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-24 12:44:02,352 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:44:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-24 12:44:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 12:44:02,354 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:02,354 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] [2018-01-24 12:44:02,354 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:02,354 INFO L82 PathProgramCache]: Analyzing trace with hash -908438943, now seen corresponding path program 1 times [2018-01-24 12:44:02,354 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:02,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:02,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:02,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:02,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:02,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:44:02,397 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:02,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:44:02,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:44:02,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:44:02,398 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-01-24 12:44:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:02,411 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 12:44:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:44:02,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-24 12:44:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:02,413 INFO L225 Difference]: With dead ends: 73 [2018-01-24 12:44:02,413 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 12:44:02,414 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:44:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 12:44:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 12:44:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 12:44:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-01-24 12:44:02,421 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-01-24 12:44:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:02,422 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-01-24 12:44:02,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:44:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-01-24 12:44:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:44:02,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:02,423 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:02,423 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1313023324, now seen corresponding path program 1 times [2018-01-24 12:44:02,424 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:02,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:02,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:02,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:02,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:44:02,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:44:02,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:44:02,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:44:02,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:44:02,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:44:02,628 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 13 states. [2018-01-24 12:44:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:02,869 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-24 12:44:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:44:02,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-01-24 12:44:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:02,872 INFO L225 Difference]: With dead ends: 105 [2018-01-24 12:44:02,872 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 12:44:02,873 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:44:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 12:44:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-01-24 12:44:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 12:44:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-01-24 12:44:02,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2018-01-24 12:44:02,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:02,882 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-01-24 12:44:02,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:44:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-01-24 12:44:02,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 12:44:02,883 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:02,883 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:02,884 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:02,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1293000230, now seen corresponding path program 1 times [2018-01-24 12:44:02,884 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:02,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:02,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:02,885 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:02,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:44:03,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:03,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:03,188 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:44:03,202 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:03,203 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:03,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:03,291 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 14 treesize of output 11 [2018-01-24 12:44:03,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 12:44:03,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:03,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:03,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:44:03,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 12:44:03,544 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 18 treesize of output 14 [2018-01-24 12:44:03,552 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 14 treesize of output 11 [2018-01-24 12:44:03,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:44:03,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:44:03,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:44:03,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-24 12:44:03,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:03,783 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:04,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-24 12:44:04,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,198 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-24 12:44:04,211 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-24 12:44:04,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,226 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-01-24 12:44:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:04,255 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:44:04,255 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-24 12:44:04,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:04,259 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:44:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:44:04,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:44:04,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:44:04,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-01-24 12:44:04,332 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 16 treesize of output 13 [2018-01-24 12:44:04,334 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 13 treesize of output 12 [2018-01-24 12:44:04,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:04,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-24 12:44:04,571 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-24 12:44:04,584 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 16 [2018-01-24 12:44:04,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 12:44:04,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:44:04,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:44:04,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:30 [2018-01-24 12:44:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:04,772 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:44:05,007 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-24 12:44:05,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 12:44:05,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:44:05,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:05,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:44:05,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2018-01-24 12:44:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:44:05,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:44:05,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12, 14, 14] total 49 [2018-01-24 12:44:05,095 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:44:05,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 12:44:05,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 12:44:05,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2257, Unknown=0, NotChecked=0, Total=2450 [2018-01-24 12:44:05,096 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 24 states. [2018-01-24 12:44:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:44:06,214 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-24 12:44:06,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 12:44:06,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2018-01-24 12:44:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:44:06,215 INFO L225 Difference]: With dead ends: 94 [2018-01-24 12:44:06,215 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 12:44:06,217 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=344, Invalid=3438, Unknown=0, NotChecked=0, Total=3782 [2018-01-24 12:44:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 12:44:06,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2018-01-24 12:44:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 12:44:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-01-24 12:44:06,225 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2018-01-24 12:44:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:44:06,226 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-01-24 12:44:06,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 12:44:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-01-24 12:44:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:44:06,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:44:06,227 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:44:06,227 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 12:44:06,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1770747854, now seen corresponding path program 1 times [2018-01-24 12:44:06,227 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:44:06,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:06,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:44:06,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:44:06,228 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:44:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:44:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 12:44:06,273 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 12:44:06,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:44:06 BoogieIcfgContainer [2018-01-24 12:44:06,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:44:06,302 INFO L168 Benchmark]: Toolchain (without parser) took 5854.09 ms. Allocated memory was 302.5 MB in the beginning and 543.7 MB in the end (delta: 241.2 MB). Free memory was 261.5 MB in the beginning and 471.0 MB in the end (delta: -209.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:06,303 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:44:06,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.25 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 251.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:06,304 INFO L168 Benchmark]: Boogie Preprocessor took 31.78 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:06,304 INFO L168 Benchmark]: RCFGBuilder took 263.13 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 230.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:44:06,305 INFO L168 Benchmark]: TraceAbstraction took 5350.59 ms. Allocated memory was 302.5 MB in the beginning and 543.7 MB in the end (delta: 241.2 MB). Free memory was 230.5 MB in the beginning and 471.0 MB in the end (delta: -240.4 MB). Peak memory consumption was 727.3 kB. Max. memory is 5.3 GB. [2018-01-24 12:44:06,307 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 302.5 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.25 ms. Allocated memory is still 302.5 MB. Free memory was 261.5 MB in the beginning and 251.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.78 ms. Allocated memory is still 302.5 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 263.13 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 230.5 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5350.59 ms. Allocated memory was 302.5 MB in the beginning and 543.7 MB in the end (delta: 241.2 MB). Free memory was 230.5 MB in the beginning and 471.0 MB in the end (delta: -240.4 MB). Peak memory consumption was 727.3 kB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); [L542] COND TRUE length < 1 [L543] length = 1 VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={3:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] RET return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L556] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L556] char* s = build_nondet_String(); [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={3:0}] [L551] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) [L553] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] COND FALSE, EXPR !((*s == c) ? (char *) s : 0) VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] RET return ( (*s == c) ? (char *) s : 0 ); [L557] cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] [L557] FCALL cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 13 error locations. UNSAFE Result, 5.3s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 250 SDtfs, 348 SDslu, 1048 SDs, 0 SdLazy, 974 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 72 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 229 ConstructedInterpolants, 14 QuantifiedInterpolants, 42830 SizeOfPredicates, 25 NumberOfNonLiveVariables, 214 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 4/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-44-06-315.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-44-06-315.csv Received shutdown request...