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_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 14:59:46,050 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 14:59:46,051 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 14:59:46,064 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 14:59:46,064 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 14:59:46,064 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 14:59:46,065 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 14:59:46,067 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 14:59:46,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 14:59:46,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 14:59:46,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 14:59:46,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 14:59:46,071 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 14:59:46,072 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 14:59:46,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 14:59:46,075 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 14:59:46,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 14:59:46,078 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 14:59:46,080 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 14:59:46,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 14:59:46,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 14:59:46,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 14:59:46,083 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 14:59:46,084 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 14:59:46,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 14:59:46,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 14:59:46,086 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 14:59:46,086 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 14:59:46,086 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 14:59:46,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 14:59:46,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 14:59:46,087 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_Array.epf [2018-02-04 14:59:46,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 14:59:46,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 14:59:46,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 14:59:46,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 14:59:46,098 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 14:59:46,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 14:59:46,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 14:59:46,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 14:59:46,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 14:59:46,127 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 14:59:46,135 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 14:59:46,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 14:59:46,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 14:59:46,139 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 14:59:46,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:46,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 14:59:46,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 14:59:46,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:46,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 14:59:46,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 14:59:46,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d684dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46, skipping insertion in model container [2018-02-04 14:59:46,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,284 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:46,312 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 14:59:46,403 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:46,416 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 14:59:46,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46 WrapperNode [2018-02-04 14:59:46,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 14:59:46,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 14:59:46,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 14:59:46,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 14:59:46,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,446 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (1/1) ... [2018-02-04 14:59:46,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 14:59:46,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 14:59:46,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 14:59:46,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 14:59:46,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (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 14:59:46,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 14:59:46,485 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 14:59:46,485 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemchr [2018-02-04 14:59:46,485 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 14:59:46,485 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 14:59:46,485 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 14:59:46,485 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 14:59:46,485 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure cmemchr [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 14:59:46,486 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 14:59:46,620 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 14:59:46,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:46 BoogieIcfgContainer [2018-02-04 14:59:46,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 14:59:46,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 14:59:46,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 14:59:46,624 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 14:59:46,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:59:46" (1/3) ... [2018-02-04 14:59:46,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371b6b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:46, skipping insertion in model container [2018-02-04 14:59:46,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:59:46" (2/3) ... [2018-02-04 14:59:46,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371b6b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:59:46, skipping insertion in model container [2018-02-04 14:59:46,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:59:46" (3/3) ... [2018-02-04 14:59:46,627 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 14:59:46,634 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 14:59:46,640 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 14:59:46,672 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 14:59:46,673 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 14:59:46,673 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 14:59:46,673 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 14:59:46,673 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 14:59:46,673 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 14:59:46,673 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 14:59:46,673 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 14:59:46,674 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 14:59:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-02-04 14:59:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:59:46,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:46,694 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:46,695 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:46,700 INFO L82 PathProgramCache]: Analyzing trace with hash -624451344, now seen corresponding path program 1 times [2018-02-04 14:59:46,734 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:46,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:46,892 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 14:59:46,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:46,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:46,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:46,895 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 14:59:46,895 INFO L182 omatonBuilderFactory]: Interpolants [34#true, 35#false, 36#(= 1 (select |#valid| |main_#t~malloc6.base|)), 37#(= 1 (select |#valid| main_~nondetArea~0.base)), 38#(= 1 (select |#valid| |cmemchr_#in~s.base|)), 39#(= 1 (select |#valid| cmemchr_~s.base)), 40#(= 1 (select |#valid| cmemchr_~p~0.base)), 41#(= 1 (select |#valid| |cmemchr_#t~post1.base|))] [2018-02-04 14:59:46,895 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 14:59:46,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 14:59:46,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 14:59:46,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 14:59:46,905 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 8 states. [2018-02-04 14:59:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:47,102 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-02-04 14:59:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 14:59:47,104 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 14:59:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:47,113 INFO L225 Difference]: With dead ends: 33 [2018-02-04 14:59:47,113 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:59:47,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-02-04 14:59:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:59:47,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-02-04 14:59:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 14:59:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-02-04 14:59:47,144 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 15 [2018-02-04 14:59:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:47,144 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-02-04 14:59:47,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 14:59:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-02-04 14:59:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 14:59:47,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:47,145 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:47,145 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:47,146 INFO L82 PathProgramCache]: Analyzing trace with hash -624451343, now seen corresponding path program 1 times [2018-02-04 14:59:47,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:47,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:47,252 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 14:59:47,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:47,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 14:59:47,252 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:47,252 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 14:59:47,252 INFO L182 omatonBuilderFactory]: Interpolants [112#(<= 1 main_~n~0), 113#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 114#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 115#(and (= 0 |cmemchr_#in~s.offset|) (<= 1 (select |#length| |cmemchr_#in~s.base|))), 116#(and (<= 1 (select |#length| cmemchr_~s.base)) (= 0 cmemchr_~s.offset)), 117#(and (<= 1 (select |#length| cmemchr_~p~0.base)) (= 0 cmemchr_~p~0.offset)), 118#(and (= |cmemchr_#t~post1.offset| 0) (<= 1 (select |#length| |cmemchr_#t~post1.base|))), 110#true, 111#false] [2018-02-04 14:59:47,253 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 14:59:47,253 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 14:59:47,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 14:59:47,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 14:59:47,254 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 9 states. [2018-02-04 14:59:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:47,374 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-02-04 14:59:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 14:59:47,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-02-04 14:59:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:47,376 INFO L225 Difference]: With dead ends: 30 [2018-02-04 14:59:47,376 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 14:59:47,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 14:59:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-02-04 14:59:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 14:59:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-02-04 14:59:47,381 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2018-02-04 14:59:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:47,381 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-02-04 14:59:47,381 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 14:59:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-02-04 14:59:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:47,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:47,382 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-04 14:59:47,382 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:47,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1772059431, now seen corresponding path program 1 times [2018-02-04 14:59:47,384 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:47,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:47,511 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 14:59:47,511 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:47,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 14:59:47,511 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:47,511 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 14:59:47,512 INFO L182 omatonBuilderFactory]: Interpolants [192#(<= |cmemchr_#t~pre0| (* 4294967296 (div |cmemchr_#t~pre0| 4294967296))), 186#true, 187#false, 188#(and (<= 1 main_~n~0) (<= main_~n~0 1)), 189#(and (<= 1 |cmemchr_#in~n|) (<= |cmemchr_#in~n| 1)), 190#(and (<= cmemchr_~n 1) (< 0 (+ (div cmemchr_~n 4294967296) 1))), 191#(and (<= (+ (* 4294967296 (div cmemchr_~n 4294967296)) 1) cmemchr_~n) (<= cmemchr_~n 1) (< 0 (+ (div cmemchr_~n 4294967296) 1)))] [2018-02-04 14:59:47,512 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 14:59:47,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 14:59:47,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 14:59:47,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 14:59:47,512 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 7 states. [2018-02-04 14:59:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:47,578 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-02-04 14:59:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 14:59:47,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 14:59:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:47,579 INFO L225 Difference]: With dead ends: 49 [2018-02-04 14:59:47,579 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 14:59:47,580 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 14:59:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 14:59:47,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-04 14:59:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 14:59:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-02-04 14:59:47,587 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 20 [2018-02-04 14:59:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:47,588 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-02-04 14:59:47,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 14:59:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-02-04 14:59:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:47,589 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:47,589 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-04 14:59:47,589 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:47,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1185253417, now seen corresponding path program 1 times [2018-02-04 14:59:47,590 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:47,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:47,828 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 14:59:47,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:47,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-04 14:59:47,829 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:47,829 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 14:59:47,829 INFO L182 omatonBuilderFactory]: Interpolants [290#true, 291#false, 292#(<= 1 main_~n~0), 293#(and (= 0 |main_#t~malloc6.offset|) (<= 1 main_~n~0) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 294#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (<= 1 main_~n~0) (= 0 main_~nondetArea~0.offset)), 295#(and (= 0 |cmemchr_#in~s.offset|) (<= |cmemchr_#in~n| (select |#length| |cmemchr_#in~s.base|)) (<= 1 |cmemchr_#in~n|)), 296#(and (<= cmemchr_~n (select |#length| cmemchr_~s.base)) (<= 1 cmemchr_~n) (= 0 cmemchr_~s.offset)), 297#(and (<= cmemchr_~n (select |#length| cmemchr_~p~0.base)) (<= 1 cmemchr_~n) (= 0 cmemchr_~p~0.offset)), 298#(and (= |cmemchr_#t~post1.offset| 0) (<= 1 cmemchr_~n) (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) |cmemchr_#t~post1.offset| 1)) (<= (+ |cmemchr_#t~post1.offset| 1) cmemchr_~p~0.offset)), 299#(and (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) 1)) (<= 1 cmemchr_~n) (<= 1 cmemchr_~p~0.offset)), 300#(and (or (<= (+ |cmemchr_#t~pre0| cmemchr_~p~0.offset) (select |#length| cmemchr_~p~0.base)) (<= |cmemchr_#t~pre0| (* 4294967296 (div |cmemchr_#t~pre0| 4294967296)))) (<= 1 cmemchr_~p~0.offset) (< 0 (+ (div |cmemchr_#t~pre0| 4294967296) 1))), 301#(and (<= (+ cmemchr_~p~0.offset 1) (select |#length| cmemchr_~p~0.base)) (<= 1 cmemchr_~p~0.offset)), 302#(and (<= 1 |cmemchr_#t~post1.offset|) (<= (+ |cmemchr_#t~post1.offset| 1) (select |#length| |cmemchr_#t~post1.base|)))] [2018-02-04 14:59:47,829 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 14:59:47,833 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 14:59:47,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 14:59:47,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 14:59:47,834 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-02-04 14:59:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:48,080 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-02-04 14:59:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 14:59:48,080 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-04 14:59:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:48,081 INFO L225 Difference]: With dead ends: 55 [2018-02-04 14:59:48,081 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 14:59:48,082 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-02-04 14:59:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 14:59:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-02-04 14:59:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 14:59:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-04 14:59:48,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-04 14:59:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:48,086 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-04 14:59:48,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 14:59:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-04 14:59:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 14:59:48,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:48,088 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] [2018-02-04 14:59:48,089 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 423617884, now seen corresponding path program 1 times [2018-02-04 14:59:48,089 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:48,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:48,146 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 14:59:48,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 14:59:48,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 14:59:48,147 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:48,147 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 14:59:48,148 INFO L182 omatonBuilderFactory]: Interpolants [421#true, 422#false, 423#(= |#valid| |old(#valid)|), 424#(= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|)] [2018-02-04 14:59:48,148 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 14:59:48,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 14:59:48,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 14:59:48,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 14:59:48,149 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-02-04 14:59:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:48,174 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-02-04 14:59:48,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 14:59:48,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 14:59:48,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:48,174 INFO L225 Difference]: With dead ends: 46 [2018-02-04 14:59:48,174 INFO L226 Difference]: Without dead ends: 26 [2018-02-04 14:59:48,175 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 14:59:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-02-04 14:59:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-02-04 14:59:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-02-04 14:59:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-02-04 14:59:48,176 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-02-04 14:59:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:48,176 INFO L432 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-02-04 14:59:48,176 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 14:59:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-02-04 14:59:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 14:59:48,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 14:59:48,177 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 14:59:48,177 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cmemchrErr1RequiresViolation, cmemchrErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 14:59:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1860785903, now seen corresponding path program 2 times [2018-02-04 14:59:48,177 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 14:59:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 14:59:48,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 14:59:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:48,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 14:59:48,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-04 14:59:48,389 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 14:59:48,389 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 14:59:48,389 INFO L182 omatonBuilderFactory]: Interpolants [512#(and (<= 2 cmemchr_~p~0.offset) (<= (+ cmemchr_~p~0.offset 1) (select |#length| cmemchr_~p~0.base))), 513#(and (<= 2 |cmemchr_#t~post1.offset|) (<= (+ |cmemchr_#t~post1.offset| 1) (select |#length| |cmemchr_#t~post1.base|))), 499#true, 500#false, 501#(and (= 0 |main_#t~malloc6.offset|) (= main_~n~0 (select |#length| |main_#t~malloc6.base|))), 502#(and (= main_~n~0 (select |#length| main_~nondetArea~0.base)) (= 0 main_~nondetArea~0.offset)), 503#(and (= 0 |cmemchr_#in~s.offset|) (<= |cmemchr_#in~n| (select |#length| |cmemchr_#in~s.base|)) (<= (select |#length| |cmemchr_#in~s.base|) |cmemchr_#in~n|)), 504#(and (<= (select |#length| cmemchr_~s.base) cmemchr_~n) (<= cmemchr_~n (select |#length| cmemchr_~s.base)) (= 0 cmemchr_~s.offset)), 505#(and (<= cmemchr_~n (select |#length| cmemchr_~p~0.base)) (<= (select |#length| cmemchr_~p~0.base) cmemchr_~n) (= 0 cmemchr_~p~0.offset)), 506#(and (= |cmemchr_#t~post1.offset| 0) (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) |cmemchr_#t~post1.offset| 1)) (<= (+ |cmemchr_#t~post1.offset| 1) cmemchr_~p~0.offset) (<= (+ (select |#length| cmemchr_~p~0.base) |cmemchr_#t~post1.offset| 1) (+ cmemchr_~n cmemchr_~p~0.offset))), 507#(and (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) 1)) (<= 1 cmemchr_~p~0.offset) (<= (+ (select |#length| cmemchr_~p~0.base) 1) (+ cmemchr_~n cmemchr_~p~0.offset))), 508#(and (<= (+ cmemchr_~n cmemchr_~p~0.offset) (select |#length| cmemchr_~p~0.base)) (<= (select |#length| cmemchr_~p~0.base) (+ cmemchr_~n cmemchr_~p~0.offset)) (<= 1 cmemchr_~p~0.offset)), 509#(and (<= (select |#length| |cmemchr_#t~post1.base|) (+ cmemchr_~n |cmemchr_#t~post1.offset|)) (<= 2 cmemchr_~p~0.offset) (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) 1))), 510#(and (<= 2 cmemchr_~p~0.offset) (<= (+ cmemchr_~n cmemchr_~p~0.offset) (+ (select |#length| cmemchr_~p~0.base) 1)) (<= 1 cmemchr_~n)), 511#(and (<= 2 cmemchr_~p~0.offset) (or (<= (+ |cmemchr_#t~pre0| cmemchr_~p~0.offset) (select |#length| cmemchr_~p~0.base)) (<= |cmemchr_#t~pre0| (* 4294967296 (div |cmemchr_#t~pre0| 4294967296)))) (< 0 (+ (div |cmemchr_#t~pre0| 4294967296) 1)))] [2018-02-04 14:59:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 14:59:48,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 14:59:48,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 14:59:48,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-04 14:59:48,389 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 15 states. [2018-02-04 14:59:48,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 14:59:48,703 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-02-04 14:59:48,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 14:59:48,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2018-02-04 14:59:48,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 14:59:48,704 INFO L225 Difference]: With dead ends: 26 [2018-02-04 14:59:48,704 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 14:59:48,705 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2018-02-04 14:59:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 14:59:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 14:59:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 14:59:48,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 14:59:48,705 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 14:59:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 14:59:48,705 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 14:59:48,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 14:59:48,706 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 14:59:48,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 14:59:48,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:59:48 BoogieIcfgContainer [2018-02-04 14:59:48,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 14:59:48,711 INFO L168 Benchmark]: Toolchain (without parser) took 2444.77 ms. Allocated memory was 396.4 MB in the beginning and 627.0 MB in the end (delta: 230.7 MB). Free memory was 354.4 MB in the beginning and 448.8 MB in the end (delta: -94.4 MB). Peak memory consumption was 136.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:48,712 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 14:59:48,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.73 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 343.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:48,712 INFO L168 Benchmark]: Boogie Preprocessor took 26.10 ms. Allocated memory is still 396.4 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-04 14:59:48,712 INFO L168 Benchmark]: RCFGBuilder took 172.22 ms. Allocated memory is still 396.4 MB. Free memory was 341.2 MB in the beginning and 325.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:48,713 INFO L168 Benchmark]: TraceAbstraction took 2088.93 ms. Allocated memory was 396.4 MB in the beginning and 627.0 MB in the end (delta: 230.7 MB). Free memory was 325.2 MB in the beginning and 448.8 MB in the end (delta: -123.5 MB). Peak memory consumption was 107.1 MB. Max. memory is 5.3 GB. [2018-02-04 14:59:48,714 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.14 ms. Allocated memory is still 396.4 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.73 ms. Allocated memory is still 396.4 MB. Free memory was 353.0 MB in the beginning and 343.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.10 ms. Allocated memory is still 396.4 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 172.22 ms. Allocated memory is still 396.4 MB. Free memory was 341.2 MB in the beginning and 325.2 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2088.93 ms. Allocated memory was 396.4 MB in the beginning and 627.0 MB in the end (delta: 230.7 MB). Free memory was 325.2 MB in the beginning and 448.8 MB in the end (delta: -123.5 MB). Peak memory consumption was 107.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 3 error locations. SAFE Result, 2.0s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 174 SDslu, 608 SDs, 0 SdLazy, 513 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 2/13 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, 6 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 15342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 2/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_14-59-48-720.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_14-59-48-720.csv Received shutdown request...