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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:36:14,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:36:14,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:36:15,003 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:36:15,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:36:15,004 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:36:15,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:36:15,006 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:36:15,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:36:15,009 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:36:15,009 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:36:15,010 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:36:15,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:36:15,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:36:15,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:36:15,017 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:36:15,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:36:15,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:36:15,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:36:15,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:36:15,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:36:15,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:36:15,024 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:36:15,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:36:15,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:36:15,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:36:15,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:36:15,027 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:36:15,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:36:15,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:36:15,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:36:15,028 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:36:15,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:36:15,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:36:15,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:36:15,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:36:15,039 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:36:15,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:36:15,040 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:36:15,041 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:36:15,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:36:15,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:36:15,041 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:36:15,041 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:36:15,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:36:15,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:36:15,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:36:15,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:36:15,042 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:36:15,042 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:36:15,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:36:15,084 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:36:15,086 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:36:15,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:36:15,087 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:36:15,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:15,208 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:36:15,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:36:15,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:15,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:36:15,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:36:15,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d1816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15, skipping insertion in model container [2018-02-02 10:36:15,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,230 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:15,256 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:36:15,346 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:15,359 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:36:15,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15 WrapperNode [2018-02-02 10:36:15,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:36:15,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:36:15,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:36:15,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:36:15,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (1/1) ... [2018-02-02 10:36:15,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:36:15,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:36:15,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:36:15,390 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:36:15,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (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-02 10:36:15,429 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:36:15,429 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:36:15,430 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-02-02 10:36:15,430 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:36:15,430 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:36:15,430 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:36:15,430 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:36:15,430 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:36:15,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:36:15,583 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:36:15,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:15 BoogieIcfgContainer [2018-02-02 10:36:15,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:36:15,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:36:15,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:36:15,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:36:15,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:36:15" (1/3) ... [2018-02-02 10:36:15,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:15, skipping insertion in model container [2018-02-02 10:36:15,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:36:15" (2/3) ... [2018-02-02 10:36:15,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4f66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:36:15, skipping insertion in model container [2018-02-02 10:36:15,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:36:15" (3/3) ... [2018-02-02 10:36:15,588 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:36:15,593 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:36:15,598 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-02 10:36:15,629 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:36:15,629 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:36:15,629 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:36:15,629 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:36:15,629 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:36:15,630 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:36:15,630 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:36:15,630 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:36:15,630 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:36:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-02-02 10:36:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:15,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:15,647 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:15,647 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash 797989968, now seen corresponding path program 1 times [2018-02-02 10:36:15,699 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:15,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:15,783 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-02 10:36:15,785 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:15,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:15,785 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:15,786 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-02 10:36:15,786 INFO L182 omatonBuilderFactory]: Interpolants [44#true, 45#false, 46#(= 1 (select |#valid| |main_#t~malloc7.base|)), 47#(= 1 (select |#valid| main_~nondetString~0.base))] [2018-02-02 10:36:15,786 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-02 10:36:15,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 10:36:15,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 10:36:15,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 10:36:15,798 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 4 states. [2018-02-02 10:36:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:15,875 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 10:36:15,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 10:36:15,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-02-02 10:36:15,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:15,935 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:36:15,935 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 10:36:15,940 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-02 10:36:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 10:36:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-02 10:36:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-02 10:36:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-02-02 10:36:15,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 10 [2018-02-02 10:36:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:15,961 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-02-02 10:36:15,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 10:36:15,962 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-02-02 10:36:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-02 10:36:15,962 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:15,962 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:15,962 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 797989969, now seen corresponding path program 1 times [2018-02-02 10:36:15,963 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:15,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,036 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-02 10:36:16,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:16,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:16,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:16,036 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-02 10:36:16,037 INFO L182 omatonBuilderFactory]: Interpolants [128#false, 129#(<= 1 main_~length~0), 130#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 131#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= main_~nondetString~0.offset 0) (<= 1 main_~length~0)), 127#true] [2018-02-02 10:36:16,037 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-02 10:36:16,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:16,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:16,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:16,038 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 5 states. [2018-02-02 10:36:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:16,061 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-02-02 10:36:16,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 10:36:16,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-02 10:36:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:16,062 INFO L225 Difference]: With dead ends: 36 [2018-02-02 10:36:16,062 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 10:36:16,063 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-02 10:36:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 10:36:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-02 10:36:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-02 10:36:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-02-02 10:36:16,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2018-02-02 10:36:16,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:16,067 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-02-02 10:36:16,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:16,067 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-02-02 10:36:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:36:16,067 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:16,068 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:16,068 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539991, now seen corresponding path program 1 times [2018-02-02 10:36:16,069 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:16,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,111 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-02 10:36:16,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:16,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:36:16,112 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:16,112 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-02 10:36:16,112 INFO L182 omatonBuilderFactory]: Interpolants [208#(= 1 (select |#valid| main_~nondetString~0.base)), 209#(= 1 (select |#valid| |cstrchr_#in~s.base|)), 210#(= 1 (select |#valid| cstrchr_~s.base)), 206#true, 207#false] [2018-02-02 10:36:16,112 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-02 10:36:16,112 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:36:16,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:36:16,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:36:16,113 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 5 states. [2018-02-02 10:36:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:16,176 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-02-02 10:36:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:36:16,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-02 10:36:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:16,178 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:36:16,178 INFO L226 Difference]: Without dead ends: 33 [2018-02-02 10:36:16,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:36:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-02 10:36:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-02-02 10:36:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-02-02 10:36:16,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-02-02 10:36:16,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 15 [2018-02-02 10:36:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:16,181 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-02-02 10:36:16,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:36:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-02-02 10:36:16,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:36:16,182 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:16,182 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:16,182 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:16,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1840539990, now seen corresponding path program 1 times [2018-02-02 10:36:16,183 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:16,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,267 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-02 10:36:16,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:16,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 10:36:16,267 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:16,267 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-02 10:36:16,268 INFO L182 omatonBuilderFactory]: Interpolants [279#true, 280#false, 281#(<= 1 main_~length~0), 282#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 283#(and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset) (<= 1 main_~length~0)), 284#(and (<= 1 (select |#length| main_~nondetString~0.base)) (= 0 main_~nondetString~0.offset)), 285#(and (= 0 |cstrchr_#in~s.offset|) (<= 1 (select |#length| |cstrchr_#in~s.base|))), 286#(and (<= 1 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0))] [2018-02-02 10:36:16,268 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-02 10:36:16,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 10:36:16,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 10:36:16,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:36:16,268 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 8 states. [2018-02-02 10:36:16,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:16,342 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-02-02 10:36:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:36:16,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-02 10:36:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:16,348 INFO L225 Difference]: With dead ends: 45 [2018-02-02 10:36:16,348 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 10:36:16,348 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:36:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 10:36:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-02-02 10:36:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:36:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-02 10:36:16,351 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 15 [2018-02-02 10:36:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:16,351 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-02 10:36:16,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 10:36:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-02 10:36:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:36:16,352 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:16,352 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:36:16,352 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 985116459, now seen corresponding path program 1 times [2018-02-02 10:36:16,353 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:16,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,370 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-02 10:36:16,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:36:16,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 10:36:16,370 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:16,371 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-02 10:36:16,371 INFO L182 omatonBuilderFactory]: Interpolants [377#true, 378#false, 379#(not |cstrchr_#t~short2|)] [2018-02-02 10:36:16,371 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-02 10:36:16,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 10:36:16,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 10:36:16,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 10:36:16,371 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 3 states. [2018-02-02 10:36:16,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:16,378 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-02-02 10:36:16,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 10:36:16,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-02-02 10:36:16,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:16,379 INFO L225 Difference]: With dead ends: 43 [2018-02-02 10:36:16,379 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:36:16,379 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-02 10:36:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:36:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 10:36:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 10:36:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-02-02 10:36:16,382 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2018-02-02 10:36:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:16,382 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-02-02 10:36:16,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 10:36:16,382 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-02-02 10:36:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 10:36:16,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:16,383 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] [2018-02-02 10:36:16,383 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:16,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1622551342, now seen corresponding path program 1 times [2018-02-02 10:36:16,383 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:16,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,598 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-02 10:36:16,598 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:36:16,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 10:36:16,599 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:36:16,599 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-02 10:36:16,599 INFO L182 omatonBuilderFactory]: Interpolants [466#true, 467#false, 468#(<= 1 main_~length~0), 469#(and (= 0 |main_#t~malloc7.offset|) (= main_~length~0 (select |#length| |main_#t~malloc7.base|)) (<= 1 main_~length~0)), 470#(and (or (and (= main_~length~0 (select |#length| main_~nondetString~0.base)) (<= 1 main_~length~0)) (= (+ main_~nondetString~0.offset main_~length~0) 1)) (= main_~nondetString~0.offset 0)), 471#(and (or (<= 2 (+ main_~nondetString~0.offset (select |#length| main_~nondetString~0.base))) (= 0 (select (select |#memory_int| main_~nondetString~0.base) main_~nondetString~0.offset))) (= main_~nondetString~0.offset 0)), 472#(and (or (= 0 (select (select |#memory_int| |cstrchr_#in~s.base|) |cstrchr_#in~s.offset|)) (<= 2 (select |#length| |cstrchr_#in~s.base|))) (= 0 |cstrchr_#in~s.offset|)), 473#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset))) (= cstrchr_~s.offset 0)), 474#(and (or (<= 2 (select |#length| cstrchr_~s.base)) (and (= |cstrchr_#t~mem0| (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)) (= 0 (select (select |#memory_int| cstrchr_~s.base) cstrchr_~s.offset)))) (= cstrchr_~s.offset 0)), 475#(and (or (not |cstrchr_#t~short2|) (<= 2 (select |#length| cstrchr_~s.base))) (= cstrchr_~s.offset 0)), 476#(and (<= 2 (select |#length| cstrchr_~s.base)) (= cstrchr_~s.offset 0)), 477#(and (<= 1 cstrchr_~s.offset) (<= (+ cstrchr_~s.offset 1) (select |#length| cstrchr_~s.base)))] [2018-02-02 10:36:16,599 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-02 10:36:16,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 10:36:16,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 10:36:16,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:36:16,600 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 12 states. [2018-02-02 10:36:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:36:16,860 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-02-02 10:36:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 10:36:16,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-02-02 10:36:16,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:36:16,861 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:36:16,861 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:36:16,862 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-02-02 10:36:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:36:16,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2018-02-02 10:36:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:36:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-02 10:36:16,865 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 22 [2018-02-02 10:36:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:36:16,865 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-02 10:36:16,865 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 10:36:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-02 10:36:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:36:16,865 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:36:16,865 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] [2018-02-02 10:36:16,865 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-02-02 10:36:16,866 INFO L82 PathProgramCache]: Analyzing trace with hash 112532188, now seen corresponding path program 1 times [2018-02-02 10:36:16,866 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:36:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:36:16,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:36:16,881 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:36:16,885 INFO L168 Benchmark]: Toolchain (without parser) took 1676.53 ms. Allocated memory was 397.9 MB in the beginning and 590.9 MB in the end (delta: 192.9 MB). Free memory was 354.4 MB in the beginning and 403.5 MB in the end (delta: -49.1 MB). Peak memory consumption was 143.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:16,886 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:36:16,886 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.88 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 343.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:16,887 INFO L168 Benchmark]: Boogie Preprocessor took 24.04 ms. Allocated memory is still 397.9 MB. Free memory was 343.8 MB in the beginning and 341.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:16,887 INFO L168 Benchmark]: RCFGBuilder took 193.82 ms. Allocated memory is still 397.9 MB. Free memory was 341.2 MB in the beginning and 324.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:16,887 INFO L168 Benchmark]: TraceAbstraction took 1300.19 ms. Allocated memory was 397.9 MB in the beginning and 590.9 MB in the end (delta: 192.9 MB). Free memory was 324.0 MB in the beginning and 403.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 113.4 MB. Max. memory is 5.3 GB. [2018-02-02 10:36:16,888 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.10 ms. Allocated memory is still 397.9 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.88 ms. Allocated memory is still 397.9 MB. Free memory was 354.4 MB in the beginning and 343.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 24.04 ms. Allocated memory is still 397.9 MB. Free memory was 343.8 MB in the beginning and 341.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 193.82 ms. Allocated memory is still 397.9 MB. Free memory was 341.2 MB in the beginning and 324.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1300.19 ms. Allocated memory was 397.9 MB in the beginning and 590.9 MB in the end (delta: 192.9 MB). Free memory was 324.0 MB in the beginning and 403.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 113.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-36-16-894.csv Received shutdown request...