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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:20:40,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:20:40,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:20:40,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:20:40,390 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:20:40,391 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:20:40,393 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:20:40,395 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:20:40,397 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:20:40,398 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:20:40,399 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:20:40,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:20:40,400 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:20:40,405 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:20:40,406 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:20:40,417 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:20:40,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:20:40,421 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:20:40,422 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:20:40,423 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:20:40,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:20:40,431 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:20:40,431 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:20:40,432 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:20:40,433 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:20:40,434 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:20:40,434 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:20:40,435 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:20:40,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:20:40,437 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:20:40,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:20:40,438 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:20:40,458 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:20:40,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:20:40,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:20:40,461 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:20:40,462 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:20:40,462 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:20:40,462 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:20:40,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:20:40,463 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:20:40,463 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:20:40,463 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:20:40,463 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:20:40,463 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:20:40,464 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:20:40,464 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:20:40,464 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:20:40,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:20:40,464 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:20:40,464 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:20:40,465 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:20:40,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:20:40,465 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:20:40,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:20:40,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:20:40,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:20:40,466 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:20:40,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:20:40,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:20:40,467 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:20:40,467 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:20:40,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:20:40,467 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:20:40,468 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:20:40,468 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:20:40,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:20:40,535 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:20:40,539 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:20:40,541 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:20:40,542 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:20:40,543 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-31 08:20:40,746 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:20:40,753 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:20:40,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:20:40,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:20:40,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:20:40,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:20:40" (1/1) ... [2018-01-31 08:20:40,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3b7e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:40, skipping insertion in model container [2018-01-31 08:20:40,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:20:40" (1/1) ... [2018-01-31 08:20:40,783 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:20:40,842 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:20:41,017 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:20:41,048 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:20:41,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41 WrapperNode [2018-01-31 08:20:41,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:20:41,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:20:41,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:20:41,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:20:41,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (1/1) ... [2018-01-31 08:20:41,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:20:41,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:20:41,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:20:41,109 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:20:41,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (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-31 08:20:41,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:20:41,176 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:20:41,177 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-31 08:20:41,177 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-31 08:20:41,177 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:20:41,177 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:20:41,177 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:20:41,178 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:20:41,179 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-31 08:20:41,179 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-31 08:20:41,179 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:20:41,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:20:41,179 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:20:41,668 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:20:41,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:20:41 BoogieIcfgContainer [2018-01-31 08:20:41,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:20:41,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:20:41,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:20:41,673 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:20:41,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:20:40" (1/3) ... [2018-01-31 08:20:41,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f60b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:20:41, skipping insertion in model container [2018-01-31 08:20:41,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:20:41" (2/3) ... [2018-01-31 08:20:41,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@105f60b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:20:41, skipping insertion in model container [2018-01-31 08:20:41,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:20:41" (3/3) ... [2018-01-31 08:20:41,676 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-01-31 08:20:41,682 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:20:41,688 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-31 08:20:41,736 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:20:41,736 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:20:41,736 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:20:41,736 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:20:41,736 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:20:41,736 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:20:41,736 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:20:41,737 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:20:41,737 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:20:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-31 08:20:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 08:20:41,770 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:41,771 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:41,771 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1553699360, now seen corresponding path program 1 times [2018-01-31 08:20:41,779 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:41,779 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:41,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:41,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:41,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:41,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:42,127 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-31 08:20:42,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:42,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:42,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:20:42,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:20:42,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:42,144 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2018-01-31 08:20:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:42,535 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-31 08:20:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:20:42,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-31 08:20:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:42,549 INFO L225 Difference]: With dead ends: 100 [2018-01-31 08:20:42,550 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 08:20:42,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 08:20:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-31 08:20:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-31 08:20:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-01-31 08:20:42,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 14 [2018-01-31 08:20:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:42,591 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-01-31 08:20:42,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:20:42,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-01-31 08:20:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 08:20:42,592 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:42,592 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:42,592 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1553699361, now seen corresponding path program 1 times [2018-01-31 08:20:42,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:42,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:42,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:42,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:42,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:42,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:42,853 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-31 08:20:42,853 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:42,853 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:20:42,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:20:42,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:20:42,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:42,856 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2018-01-31 08:20:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:42,920 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-31 08:20:42,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:20:42,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-31 08:20:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:42,926 INFO L225 Difference]: With dead ends: 69 [2018-01-31 08:20:42,927 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 08:20:42,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:20:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 08:20:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-31 08:20:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 08:20:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-31 08:20:42,942 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 14 [2018-01-31 08:20:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:42,943 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-31 08:20:42,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:20:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-31 08:20:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:20:42,944 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:42,944 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:42,944 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:42,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1194220645, now seen corresponding path program 1 times [2018-01-31 08:20:42,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:42,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:42,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:42,946 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:42,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:42,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:43,109 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-31 08:20:43,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:43,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:20:43,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:20:43,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:20:43,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:20:43,111 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2018-01-31 08:20:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:43,438 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-31 08:20:43,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:20:43,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-31 08:20:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:43,440 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:20:43,440 INFO L226 Difference]: Without dead ends: 68 [2018-01-31 08:20:43,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:20:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-31 08:20:43,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-31 08:20:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-31 08:20:43,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-31 08:20:43,448 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 25 [2018-01-31 08:20:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:43,449 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-31 08:20:43,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:20:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-31 08:20:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:20:43,450 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:43,450 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:43,450 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:43,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1194220644, now seen corresponding path program 1 times [2018-01-31 08:20:43,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:43,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:43,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:43,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:43,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:43,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:43,968 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-31 08:20:43,968 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:43,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 08:20:43,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:20:43,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:20:43,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:20:43,993 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 11 states. [2018-01-31 08:20:44,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:44,351 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-31 08:20:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:20:44,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-31 08:20:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:44,357 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:20:44,357 INFO L226 Difference]: Without dead ends: 88 [2018-01-31 08:20:44,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:20:44,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-31 08:20:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-01-31 08:20:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:20:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-31 08:20:44,366 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 25 [2018-01-31 08:20:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:44,367 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-31 08:20:44,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:20:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-31 08:20:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:20:44,368 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:44,369 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:44,369 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:44,369 INFO L82 PathProgramCache]: Analyzing trace with hash -610285232, now seen corresponding path program 1 times [2018-01-31 08:20:44,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:44,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:44,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:44,371 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:44,387 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:44,447 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-31 08:20:44,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:44,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:44,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:20:44,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:20:44,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:20:44,449 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-01-31 08:20:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:44,477 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-31 08:20:44,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:20:44,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-31 08:20:44,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:44,479 INFO L225 Difference]: With dead ends: 117 [2018-01-31 08:20:44,480 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 08:20:44,480 INFO L554 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-31 08:20:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 08:20:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-31 08:20:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-31 08:20:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-31 08:20:44,488 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 36 [2018-01-31 08:20:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:44,489 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-31 08:20:44,489 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:20:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-31 08:20:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:20:44,491 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:44,491 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:44,491 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1193627987, now seen corresponding path program 1 times [2018-01-31 08:20:44,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:44,492 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:44,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,493 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:44,493 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:44,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:20:44,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:44,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:20:44,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:20:44,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:20:44,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:20:44,591 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2018-01-31 08:20:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:44,664 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-31 08:20:44,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:20:44,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-31 08:20:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:44,666 INFO L225 Difference]: With dead ends: 77 [2018-01-31 08:20:44,666 INFO L226 Difference]: Without dead ends: 76 [2018-01-31 08:20:44,667 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:20:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-31 08:20:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-31 08:20:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-31 08:20:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-31 08:20:44,674 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 38 [2018-01-31 08:20:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:44,674 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-31 08:20:44,674 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:20:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-31 08:20:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:20:44,676 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:44,676 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:44,676 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:44,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1193627988, now seen corresponding path program 1 times [2018-01-31 08:20:44,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:44,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:44,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:44,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:44,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:45,332 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-31 08:20:45,332 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:45,332 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-31 08:20:45,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:45,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:45,447 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-31 08:20:45,467 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-31 08:20:45,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:45,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:45,480 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-31 08:20:45,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-31 08:20:46,089 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-31 08:20:46,098 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-31 08:20:46,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:46,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:46,125 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-31 08:20:46,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-31 08:20:46,347 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-31 08:20:46,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:46,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-01-31 08:20:46,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:20:46,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:20:46,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:20:46,387 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 26 states. [2018-01-31 08:20:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:48,477 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-01-31 08:20:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:20:48,477 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-31 08:20:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:48,478 INFO L225 Difference]: With dead ends: 130 [2018-01-31 08:20:48,478 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:20:48,479 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:20:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:20:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2018-01-31 08:20:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-31 08:20:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-31 08:20:48,493 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 38 [2018-01-31 08:20:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:48,493 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-31 08:20:48,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:20:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-31 08:20:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:20:48,494 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:48,495 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:48,495 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1928744096, now seen corresponding path program 1 times [2018-01-31 08:20:48,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:48,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:48,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:48,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:48,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:48,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:48,608 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-31 08:20:48,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:48,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:20:48,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:20:48,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:20:48,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:20:48,610 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 6 states. [2018-01-31 08:20:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:48,709 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-31 08:20:48,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:20:48,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-31 08:20:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:48,710 INFO L225 Difference]: With dead ends: 97 [2018-01-31 08:20:48,710 INFO L226 Difference]: Without dead ends: 96 [2018-01-31 08:20:48,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:20:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-31 08:20:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-01-31 08:20:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-31 08:20:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-31 08:20:48,722 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 40 [2018-01-31 08:20:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:48,723 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-31 08:20:48,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:20:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-31 08:20:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:20:48,724 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:48,724 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:48,725 INFO L371 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:48,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1928744097, now seen corresponding path program 1 times [2018-01-31 08:20:48,725 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:48,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:48,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:48,726 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:48,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:48,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:48,936 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-31 08:20:48,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:20:48,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-31 08:20:48,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:20:48,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:20:48,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:20:48,937 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 13 states. [2018-01-31 08:20:49,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:49,333 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-01-31 08:20:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:20:49,334 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-01-31 08:20:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:49,335 INFO L225 Difference]: With dead ends: 118 [2018-01-31 08:20:49,335 INFO L226 Difference]: Without dead ends: 117 [2018-01-31 08:20:49,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-01-31 08:20:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-31 08:20:49,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-01-31 08:20:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-31 08:20:49,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-01-31 08:20:49,345 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2018-01-31 08:20:49,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:49,346 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-01-31 08:20:49,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:20:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-01-31 08:20:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:20:49,347 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:49,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:20:49,347 INFO L371 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1229751552, now seen corresponding path program 1 times [2018-01-31 08:20:49,348 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:49,348 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:49,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:49,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:49,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:20:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:20:49,408 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 08:20:49,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:20:49 BoogieIcfgContainer [2018-01-31 08:20:49,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:20:49,461 INFO L168 Benchmark]: Toolchain (without parser) took 8714.78 ms. Allocated memory was 304.6 MB in the beginning and 511.7 MB in the end (delta: 207.1 MB). Free memory was 263.5 MB in the beginning and 349.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 120.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:49,464 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:20:49,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.52 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:49,464 INFO L168 Benchmark]: Boogie Preprocessor took 51.39 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:49,465 INFO L168 Benchmark]: RCFGBuilder took 560.32 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 230.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:49,465 INFO L168 Benchmark]: TraceAbstraction took 7790.90 ms. Allocated memory was 304.6 MB in the beginning and 511.7 MB in the end (delta: 207.1 MB). Free memory was 230.6 MB in the beginning and 349.7 MB in the end (delta: -119.1 MB). Peak memory consumption was 88.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:20:49,470 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.17 ms. Allocated memory is still 304.6 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 302.52 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.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 51.39 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 560.32 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 230.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7790.90 ms. Allocated memory was 304.6 MB in the beginning and 511.7 MB in the end (delta: 207.1 MB). Free memory was 230.6 MB in the beginning and 349.7 MB in the end (delta: -119.1 MB). Peak memory consumption was 88.0 MB. 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(); VAL [__VERIFIER_nondet_int()=1, length=1] [L542] COND FALSE !(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(); VAL [build_nondet_String()={3:0}, s={3:0}] [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) VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [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 ); VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, \result={0:0}, c=1, s={3:0}, s={3: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, 73 locations, 13 error locations. UNSAFE Result, 7.7s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 546 SDtfs, 700 SDslu, 2413 SDs, 0 SdLazy, 1175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 298 ConstructedInterpolants, 11 QuantifiedInterpolants, 53964 SizeOfPredicates, 14 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-20-49-481.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-20-49-481.csv Received shutdown request...