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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:16:34,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:16:34,817 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:16:34,827 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:16:34,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:16:34,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:16:34,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:16:34,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:16:34,832 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:16:34,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:16:34,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:16:34,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:16:34,835 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:16:34,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:16:34,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:16:34,838 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:16:34,840 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:16:34,842 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:16:34,843 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:16:34,844 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:16:34,846 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:16:34,846 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:16:34,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:16:34,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:16:34,848 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:16:34,849 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:16:34,849 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:16:34,849 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:16:34,850 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:16:34,850 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:16:34,850 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:16:34,850 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:16:34,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:16:34,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:16:34,861 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:16:34,861 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:16:34,861 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:16:34,861 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:16:34,861 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:16:34,861 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:16:34,862 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:16:34,862 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:16:34,863 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:16:34,863 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:16:34,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:16:34,907 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:16:34,911 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:16:34,912 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:16:34,913 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:16:34,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-02-04 17:16:35,032 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:16:35,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:16:35,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:35,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:16:35,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:16:35,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c221d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35, skipping insertion in model container [2018-02-04 17:16:35,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,057 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:35,086 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:16:35,177 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:35,191 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:16:35,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35 WrapperNode [2018-02-04 17:16:35,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:16:35,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:16:35,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:16:35,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:16:35,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... [2018-02-04 17:16:35,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:16:35,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:16:35,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:16:35,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:16:35,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:16:35,272 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:16:35,272 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:16:35,272 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-02-04 17:16:35,272 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-04 17:16:35,272 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:16:35,272 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:16:35,272 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-02-04 17:16:35,273 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-04 17:16:35,274 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:16:35,274 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:16:35,274 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:16:35,450 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:16:35,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:35 BoogieIcfgContainer [2018-02-04 17:16:35,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:16:35,451 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:16:35,451 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:16:35,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:16:35,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:16:35" (1/3) ... [2018-02-04 17:16:35,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bcbb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:35, skipping insertion in model container [2018-02-04 17:16:35,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:16:35" (2/3) ... [2018-02-04 17:16:35,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21bcbb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:16:35, skipping insertion in model container [2018-02-04 17:16:35,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:16:35" (3/3) ... [2018-02-04 17:16:35,457 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-02-04 17:16:35,463 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:16:35,468 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 17:16:35,501 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:16:35,501 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:16:35,501 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:16:35,501 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:16:35,501 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:16:35,501 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:16:35,501 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:16:35,501 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:16:35,502 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:16:35,510 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-04 17:16:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:16:35,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:35,520 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:35,520 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:35,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965141, now seen corresponding path program 1 times [2018-02-04 17:16:35,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:35,526 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:35,559 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:35,560 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:35,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:35,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:35,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:35,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:16:35,679 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:16:35,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:16:35,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:16:35,697 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 4 states. [2018-02-04 17:16:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:35,795 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-02-04 17:16:35,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:16:35,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-02-04 17:16:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:35,803 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:16:35,803 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:16:35,805 INFO L554 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-02-04 17:16:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:16:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 17:16:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:16:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-02-04 17:16:35,886 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 11 [2018-02-04 17:16:35,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:35,887 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-02-04 17:16:35,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:16:35,887 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-02-04 17:16:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 17:16:35,887 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:35,887 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:35,887 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1462965140, now seen corresponding path program 1 times [2018-02-04 17:16:35,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:35,888 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:35,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:35,889 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:35,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:35,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:36,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:36,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:16:36,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:16:36,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:16:36,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:16:36,007 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-02-04 17:16:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:36,027 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-02-04 17:16:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:16:36,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-02-04 17:16:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:36,029 INFO L225 Difference]: With dead ends: 45 [2018-02-04 17:16:36,029 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 17:16:36,029 INFO L554 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-02-04 17:16:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 17:16:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 17:16:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 17:16:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-02-04 17:16:36,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-02-04 17:16:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:36,034 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-02-04 17:16:36,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:16:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-02-04 17:16:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:16:36,035 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:36,035 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:36,035 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925183, now seen corresponding path program 1 times [2018-02-04 17:16:36,035 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:36,035 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:36,036 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:36,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:36,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:36,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:36,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:16:36,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:16:36,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:16:36,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:16:36,140 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 8 states. [2018-02-04 17:16:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:36,246 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 17:16:36,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:16:36,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 17:16:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:36,247 INFO L225 Difference]: With dead ends: 41 [2018-02-04 17:16:36,247 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 17:16:36,248 INFO L554 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-02-04 17:16:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 17:16:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 17:16:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 17:16:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-04 17:16:36,255 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 19 [2018-02-04 17:16:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:36,255 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-04 17:16:36,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:16:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-04 17:16:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:16:36,256 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:36,256 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:16:36,256 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1548925182, now seen corresponding path program 1 times [2018-02-04 17:16:36,256 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:36,256 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:36,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,257 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:36,257 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:36,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:36,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:36,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:16:36,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:16:36,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:16:36,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:16:36,387 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-02-04 17:16:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:36,506 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-02-04 17:16:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:16:36,506 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-02-04 17:16:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:36,508 INFO L225 Difference]: With dead ends: 52 [2018-02-04 17:16:36,508 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 17:16:36,509 INFO L554 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-02-04 17:16:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 17:16:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-02-04 17:16:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 17:16:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-04 17:16:36,512 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 19 [2018-02-04 17:16:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:36,512 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-04 17:16:36,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:16:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-04 17:16:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 17:16:36,513 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:36,513 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] [2018-02-04 17:16:36,513 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:36,513 INFO L82 PathProgramCache]: Analyzing trace with hash -908438943, now seen corresponding path program 1 times [2018-02-04 17:16:36,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:36,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:36,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:36,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:36,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:36,544 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:36,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:16:36,545 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:16:36,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:16:36,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:16:36,545 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-02-04 17:16:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:36,552 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-04 17:16:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:16:36,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-04 17:16:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:36,555 INFO L225 Difference]: With dead ends: 50 [2018-02-04 17:16:36,555 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 17:16:36,556 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-02-04 17:16:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 17:16:36,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 17:16:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 17:16:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-04 17:16:36,560 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 24 [2018-02-04 17:16:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:36,560 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-04 17:16:36,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:16:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-04 17:16:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:16:36,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:36,561 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] [2018-02-04 17:16:36,561 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1313023324, now seen corresponding path program 1 times [2018-02-04 17:16:36,562 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:36,562 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:36,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,563 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:36,563 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:36,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:36,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:16:36,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 17:16:36,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:16:36,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:16:36,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:16:36,719 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 13 states. [2018-02-04 17:16:36,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:36,890 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-02-04 17:16:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 17:16:36,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-02-04 17:16:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:36,893 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:16:36,894 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 17:16:36,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:16:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 17:16:36,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2018-02-04 17:16:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 17:16:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2018-02-04 17:16:36,900 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 26 [2018-02-04 17:16:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:36,900 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2018-02-04 17:16:36,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:16:36,900 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2018-02-04 17:16:36,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 17:16:36,901 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:36,901 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] [2018-02-04 17:16:36,901 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:36,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1293000230, now seen corresponding path program 1 times [2018-02-04 17:16:36,901 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:36,901 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:36,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,902 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:36,902 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:36,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:16:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:37,113 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:16:37,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:16:37,114 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:16:37,152 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:16:37,182 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-02-04 17:16:37,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:37,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:37,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:16:37,226 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-02-04 17:16:37,228 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-02-04 17:16:37,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:16:37,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:37,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:16:37,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:23 [2018-02-04 17:16:37,413 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 20 treesize of output 16 [2018-02-04 17:16:37,418 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 16 treesize of output 13 [2018-02-04 17:16:37,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 17:16:37,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:16:37,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 17:16:37,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-02-04 17:16:37,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:16:37,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:16:37,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-04 17:16:37,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 17:16:37,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 17:16:37,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-02-04 17:16:37,537 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 26 states. [2018-02-04 17:16:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:16:38,159 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-02-04 17:16:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:16:38,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-02-04 17:16:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:16:38,160 INFO L225 Difference]: With dead ends: 91 [2018-02-04 17:16:38,160 INFO L226 Difference]: Without dead ends: 91 [2018-02-04 17:16:38,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 17:16:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-04 17:16:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2018-02-04 17:16:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 17:16:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2018-02-04 17:16:38,164 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 26 [2018-02-04 17:16:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:16:38,164 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2018-02-04 17:16:38,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 17:16:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2018-02-04 17:16:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:16:38,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:16:38,165 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] [2018-02-04 17:16:38,165 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 17:16:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1770747854, now seen corresponding path program 1 times [2018-02-04 17:16:38,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:16:38,166 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:16:38,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:38,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:16:38,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:16:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:16:38,199 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:16:38,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:16:38 BoogieIcfgContainer [2018-02-04 17:16:38,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:16:38,221 INFO L168 Benchmark]: Toolchain (without parser) took 3188.98 ms. Allocated memory was 402.7 MB in the beginning and 672.1 MB in the end (delta: 269.5 MB). Free memory was 359.3 MB in the beginning and 562.6 MB in the end (delta: -203.2 MB). Peak memory consumption was 66.2 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:38,222 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:16:38,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.17 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:38,223 INFO L168 Benchmark]: Boogie Preprocessor took 29.10 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:38,223 INFO L168 Benchmark]: RCFGBuilder took 223.17 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 327.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:38,223 INFO L168 Benchmark]: TraceAbstraction took 2769.29 ms. Allocated memory was 402.7 MB in the beginning and 672.1 MB in the end (delta: 269.5 MB). Free memory was 327.5 MB in the beginning and 562.6 MB in the end (delta: -235.1 MB). Peak memory consumption was 34.4 MB. Max. memory is 5.3 GB. [2018-02-04 17:16:38,225 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.20 ms. Allocated memory is still 402.7 MB. Free memory is still 365.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 164.17 ms. Allocated memory is still 402.7 MB. Free memory was 359.3 MB in the beginning and 348.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.10 ms. Allocated memory is still 402.7 MB. Free memory was 348.8 MB in the beginning and 347.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.17 ms. Allocated memory is still 402.7 MB. Free memory was 347.4 MB in the beginning and 327.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2769.29 ms. Allocated memory was 402.7 MB in the beginning and 672.1 MB in the end (delta: 269.5 MB). Free memory was 327.5 MB in the beginning and 562.6 MB in the end (delta: -235.1 MB). Peak memory consumption was 34.4 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(); [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, 2.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 251 SDtfs, 348 SDslu, 1079 SDs, 0 SdLazy, 978 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 154 ConstructedInterpolants, 7 QuantifiedInterpolants, 21955 SizeOfPredicates, 10 NumberOfNonLiveVariables, 107 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 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 /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-16-38-230.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-16-38-230.csv Received shutdown request...