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/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 02:07:38,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 02:07:38,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 02:07:38,584 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 02:07:38,584 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 02:07:38,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 02:07:38,585 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 02:07:38,587 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 02:07:38,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 02:07:38,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 02:07:38,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 02:07:38,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 02:07:38,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 02:07:38,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 02:07:38,593 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 02:07:38,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 02:07:38,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 02:07:38,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 02:07:38,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 02:07:38,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 02:07:38,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 02:07:38,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 02:07:38,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 02:07:38,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 02:07:38,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 02:07:38,605 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 02:07:38,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 02:07:38,606 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 02:07:38,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 02:07:38,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 02:07:38,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 02:07:38,606 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 02:07:38,615 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 02:07:38,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 02:07:38,617 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 02:07:38,617 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 02:07:38,617 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 02:07:38,618 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 02:07:38,618 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 02:07:38,619 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 02:07:38,619 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 02:07:38,619 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 02:07:38,619 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 02:07:38,646 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 02:07:38,655 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 02:07:38,657 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 02:07:38,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 02:07:38,659 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 02:07:38,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-02-04 02:07:38,784 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 02:07:38,785 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 02:07:38,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 02:07:38,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 02:07:38,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 02:07:38,790 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c73cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38, skipping insertion in model container [2018-02-04 02:07:38,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,802 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:07:38,829 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 02:07:38,913 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:07:38,927 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 02:07:38,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38 WrapperNode [2018-02-04 02:07:38,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 02:07:38,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 02:07:38,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 02:07:38,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 02:07:38,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (1/1) ... [2018-02-04 02:07:38,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 02:07:38,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 02:07:38,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 02:07:38,961 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 02:07:38,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (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 02:07:38,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 02:07:38,996 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 02:07:38,996 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-04 02:07:38,997 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-04 02:07:38,997 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 02:07:38,997 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 02:07:38,998 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 02:07:39,146 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 02:07:39,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:07:39 BoogieIcfgContainer [2018-02-04 02:07:39,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 02:07:39,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 02:07:39,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 02:07:39,150 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 02:07:39,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 02:07:38" (1/3) ... [2018-02-04 02:07:39,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a641b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:07:39, skipping insertion in model container [2018-02-04 02:07:39,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 02:07:38" (2/3) ... [2018-02-04 02:07:39,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a641b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 02:07:39, skipping insertion in model container [2018-02-04 02:07:39,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 02:07:39" (3/3) ... [2018-02-04 02:07:39,153 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-02-04 02:07:39,160 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 02:07:39,166 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 02:07:39,201 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 02:07:39,201 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 02:07:39,201 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 02:07:39,201 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 02:07:39,201 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 02:07:39,201 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 02:07:39,201 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 02:07:39,202 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 02:07:39,202 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 02:07:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-02-04 02:07:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 02:07:39,222 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:39,223 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:39,223 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:39,227 INFO L82 PathProgramCache]: Analyzing trace with hash 345440703, now seen corresponding path program 1 times [2018-02-04 02:07:39,268 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:39,303 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:39,411 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 02:07:39,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:39,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 02:07:39,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:39,414 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 02:07:39,414 INFO L182 omatonBuilderFactory]: Interpolants [48#(= (select |#valid| |main_~#data~0.base|) 1), 49#(= (select |#valid| |alloc_data_#in~pdata.base|) 1), 50#(= 1 (select |#valid| alloc_data_~pdata.base)), 46#true, 47#false] [2018-02-04 02:07:39,414 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 02:07:39,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 02:07:39,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 02:07:39,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 02:07:39,424 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2018-02-04 02:07:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:39,615 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-04 02:07:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:07:39,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 02:07:39,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:39,624 INFO L225 Difference]: With dead ends: 39 [2018-02-04 02:07:39,624 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 02:07:39,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-04 02:07:39,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 02:07:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 02:07:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 02:07:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 02:07:39,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 10 [2018-02-04 02:07:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:39,648 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 02:07:39,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 02:07:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 02:07:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 02:07:39,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:39,649 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:39,649 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 345440704, now seen corresponding path program 1 times [2018-02-04 02:07:39,650 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:39,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:39,731 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 02:07:39,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:39,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 02:07:39,732 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:39,732 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 02:07:39,732 INFO L182 omatonBuilderFactory]: Interpolants [128#true, 129#false, 130#(and (= 0 |main_~#data~0.offset|) (= (select |#valid| |main_~#data~0.base|) 1) (= 8 (select |#length| |main_~#data~0.base|))), 131#(and (= 0 |alloc_data_#in~pdata.offset|) (= 8 (select |#length| |alloc_data_#in~pdata.base|)) (= (select |#valid| |alloc_data_#in~pdata.base|) 1)), 132#(and (= (select |#valid| alloc_data_~pdata.base) 1) (= 8 (select |#length| alloc_data_~pdata.base)) (= alloc_data_~pdata.offset 0)), 133#(and (= (select |#length| alloc_data_~pdata.base) 8) (= alloc_data_~pdata.offset 0))] [2018-02-04 02:07:39,733 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 02:07:39,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 02:07:39,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 02:07:39,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 02:07:39,735 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 6 states. [2018-02-04 02:07:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:39,842 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-02-04 02:07:39,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 02:07:39,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-04 02:07:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:39,844 INFO L225 Difference]: With dead ends: 32 [2018-02-04 02:07:39,844 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 02:07:39,844 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 02:07:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 02:07:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-02-04 02:07:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 02:07:39,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-02-04 02:07:39,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 10 [2018-02-04 02:07:39,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:39,847 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-02-04 02:07:39,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 02:07:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-02-04 02:07:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:07:39,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:39,848 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 02:07:39,848 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash 569818482, now seen corresponding path program 1 times [2018-02-04 02:07:39,848 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:39,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:39,960 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 02:07:39,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:39,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 02:07:39,961 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:39,961 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 02:07:39,961 INFO L182 omatonBuilderFactory]: Interpolants [208#(= 0 |free_data_#in~data.lo.offset|), 209#(= 0 free_data_~lo~0.offset), 200#true, 201#false, 202#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 203#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 0 |alloc_data_#t~malloc0.offset|)), 204#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select (select |#memory_$Pointer$.offset| alloc_data_~pdata.base) alloc_data_~pdata.offset)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 205#(= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|)), 206#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) |main_~#data~0.offset|)), 207#(= 0 |main_#t~mem4.offset|)] [2018-02-04 02:07:39,961 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 02:07:39,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:39,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:39,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:39,962 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 10 states. [2018-02-04 02:07:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:40,046 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 02:07:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 02:07:40,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 02:07:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:40,048 INFO L225 Difference]: With dead ends: 31 [2018-02-04 02:07:40,048 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 02:07:40,048 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:07:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 02:07:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 02:07:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 02:07:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-02-04 02:07:40,055 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 20 [2018-02-04 02:07:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:40,056 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-02-04 02:07:40,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-02-04 02:07:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 02:07:40,057 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:40,057 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 02:07:40,057 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 569818483, now seen corresponding path program 1 times [2018-02-04 02:07:40,058 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:40,076 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:40,220 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 02:07:40,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:40,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 02:07:40,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:40,221 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 02:07:40,221 INFO L182 omatonBuilderFactory]: Interpolants [278#true, 279#false, 280#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 281#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= 1 (select |#valid| |alloc_data_#t~malloc0.base|))), 282#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1)), 283#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))), 284#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))), 285#(= 1 (select |#valid| |main_#t~mem4.base|)), 286#(= 1 (select |#valid| |free_data_#in~data.lo.base|)), 287#(= 1 (select |#valid| free_data_~lo~0.base))] [2018-02-04 02:07:40,221 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 02:07:40,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:40,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:40,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:40,223 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2018-02-04 02:07:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:40,354 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-02-04 02:07:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:07:40,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-02-04 02:07:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:40,355 INFO L225 Difference]: With dead ends: 33 [2018-02-04 02:07:40,355 INFO L226 Difference]: Without dead ends: 33 [2018-02-04 02:07:40,355 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:07:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-02-04 02:07:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-02-04 02:07:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 02:07:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-02-04 02:07:40,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 20 [2018-02-04 02:07:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:40,360 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-02-04 02:07:40,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-02-04 02:07:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 02:07:40,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:40,360 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] [2018-02-04 02:07:40,360 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:40,361 INFO L82 PathProgramCache]: Analyzing trace with hash 484503765, now seen corresponding path program 1 times [2018-02-04 02:07:40,364 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:40,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:40,472 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 02:07:40,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:40,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 02:07:40,473 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:40,473 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 02:07:40,473 INFO L182 omatonBuilderFactory]: Interpolants [357#true, 358#false, 359#(= |main_~#data~0.offset| 0), 360#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 361#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 |alloc_data_#t~malloc2.offset|) (or (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= alloc_data_~pdata.offset 0))), 362#(or (= 0 (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) (+ 0 4))) (not (= 0 |alloc_data_#in~pdata.offset|))), 363#(= 0 (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))), 364#(= 0 |main_#t~mem5.offset|), 365#(= 0 |free_data_#in~data.hi.offset|), 366#(= 0 free_data_~hi~0.offset)] [2018-02-04 02:07:40,473 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 02:07:40,474 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 02:07:40,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 02:07:40,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 02:07:40,474 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2018-02-04 02:07:40,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:40,567 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-02-04 02:07:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 02:07:40,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-04 02:07:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:40,568 INFO L225 Difference]: With dead ends: 29 [2018-02-04 02:07:40,568 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 02:07:40,568 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-02-04 02:07:40,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 02:07:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 02:07:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 02:07:40,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-02-04 02:07:40,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2018-02-04 02:07:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:40,570 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-02-04 02:07:40,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 02:07:40,571 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-02-04 02:07:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 02:07:40,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:40,571 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] [2018-02-04 02:07:40,571 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 484503766, now seen corresponding path program 1 times [2018-02-04 02:07:40,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:40,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:40,992 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 02:07:40,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:40,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-04 02:07:40,992 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:40,992 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 02:07:40,993 INFO L182 omatonBuilderFactory]: Interpolants [433#true, 434#false, 435#(= |main_~#data~0.offset| 0), 436#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= alloc_data_~pdata.offset 0)))), 437#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (not (= alloc_data_~pdata.offset 0)) (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= 0 |alloc_data_#t~malloc0.base|))))), 438#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))) (not (= alloc_data_~pdata.offset 0)))), 439#(and (or (not (= alloc_data_~pdata.offset 0)) (and (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |alloc_data_#t~malloc2.offset| 0) (= 1 (select |#valid| |alloc_data_#t~malloc2.base|)))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 440#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (= (select (select |#memory_$Pointer$.offset| |alloc_data_#in~pdata.base|) (+ 0 4)) 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))))), 441#(or (<= (+ |main_~#data~0.offset| 1) 0) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0))), 442#(and (not (= 0 |main_#t~mem4.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0)), 443#(and (= 1 (select |#valid| |main_#t~mem5.base|)) (not (= 0 |main_#t~mem4.base|)) (= |main_#t~mem5.offset| 0)), 444#(and (= 1 (select |#valid| |free_data_#in~data.hi.base|)) (not (= 0 |free_data_#in~data.lo.base|)) (= |free_data_#in~data.hi.offset| 0)), 445#(and (or (= free_data_~hi~0.base free_data_~lo~0.base) (= 1 (select (store |#valid| free_data_~lo~0.base 0) free_data_~hi~0.base))) (= free_data_~hi~0.offset 0) (not (= 0 free_data_~lo~0.base))), 446#(or (not (= free_data_~lo~0.offset 0)) (and (= 1 (select (store |#valid| free_data_~lo~0.base 0) free_data_~hi~0.base)) (not (= 0 free_data_~lo~0.base)))), 447#(= 1 (select |#valid| free_data_~hi~0.base))] [2018-02-04 02:07:40,993 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 02:07:40,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 02:07:40,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 02:07:40,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-02-04 02:07:40,994 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-02-04 02:07:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:41,268 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 02:07:41,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 02:07:41,268 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-02-04 02:07:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:41,268 INFO L225 Difference]: With dead ends: 31 [2018-02-04 02:07:41,268 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 02:07:41,269 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2018-02-04 02:07:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 02:07:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-02-04 02:07:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 02:07:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-04 02:07:41,270 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2018-02-04 02:07:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:41,271 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-04 02:07:41,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 02:07:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-04 02:07:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 02:07:41,271 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:41,271 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 02:07:41,271 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash -997094437, now seen corresponding path program 1 times [2018-02-04 02:07:41,272 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:41,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:41,432 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 02:07:41,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:41,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 02:07:41,433 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:41,433 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 02:07:41,433 INFO L182 omatonBuilderFactory]: Interpolants [527#true, 528#false, 529#(= |main_~#data~0.offset| 0), 530#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 531#(and (= (select |#valid| |alloc_data_#t~malloc0.base|) 1) (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 532#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)) 1)), 533#(and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (not (= (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset) |alloc_data_#t~malloc2.base|)) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 534#(or (not (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)))) (not (= 0 |alloc_data_#in~pdata.offset|))), 535#(not (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))), 536#(not (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))), 537#(not (= |main_#t~mem4.base| |main_#t~mem5.base|)), 538#(and (= |free_data_#in~data.hi.base| free_data_~hi~0.base) (= free_data_~lo~0.base |free_data_#in~data.lo.base|)), 539#(= |free_data_#in~data.hi.base| |free_data_#in~data.lo.base|)] [2018-02-04 02:07:41,433 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 02:07:41,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 02:07:41,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 02:07:41,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 02:07:41,434 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 13 states. [2018-02-04 02:07:41,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:41,641 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-04 02:07:41,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 02:07:41,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-02-04 02:07:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:41,642 INFO L225 Difference]: With dead ends: 30 [2018-02-04 02:07:41,642 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 02:07:41,642 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-02-04 02:07:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 02:07:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 02:07:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 02:07:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-02-04 02:07:41,652 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 25 [2018-02-04 02:07:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:41,653 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-02-04 02:07:41,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 02:07:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-02-04 02:07:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 02:07:41,654 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 02:07:41,654 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-04 02:07:41,654 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-02-04 02:07:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -502821665, now seen corresponding path program 1 times [2018-02-04 02:07:41,655 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 02:07:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 02:07:41,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 02:07:42,289 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 02:07:42,289 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 02:07:42,289 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 02:07:42,290 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 02:07:42,290 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 02:07:42,290 INFO L182 omatonBuilderFactory]: Interpolants [612#true, 613#false, 614#(= |#valid| |old(#valid)|), 615#(and (= |main_~#data~0.offset| 0) (= |old(#valid)| (store |#valid| |main_~#data~0.base| 0)) (= (select |#valid| |main_~#data~0.base|) 1)), 616#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= |#valid| |old(#valid)|)) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 617#(and (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|) (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= 0 (select |old(#valid)| |alloc_data_#t~malloc0.base|)) (= |old(#valid)| (store |#valid| |alloc_data_#t~malloc0.base| (select |old(#valid)| |alloc_data_#t~malloc0.base|))) (not (= 0 |alloc_data_#t~malloc0.base|))) (not (= alloc_data_~pdata.offset 0)))), 618#(and (or (and (= alloc_data_~pdata.base |alloc_data_#in~pdata.base|) (= (select |#valid| alloc_data_~pdata.base) 1) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) (= (store |#valid| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset) (select |old(#valid)| (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset))) |old(#valid)|) (not (= 0 (select (select |#memory_$Pointer$.base| alloc_data_~pdata.base) alloc_data_~pdata.offset)))) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 619#(and (or (and (= 0 (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (not (= 0 (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) (not (= 0 |alloc_data_#t~malloc2.base|)) (or (= (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset) |alloc_data_#t~malloc2.base|) (and (= |old(#valid)| (store (store |#valid| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset) (select |old(#valid)| (select (store (select |#memory_$Pointer$.base| alloc_data_~pdata.base) (+ alloc_data_~pdata.offset 4) |alloc_data_#t~malloc2.base|) alloc_data_~pdata.offset))) |alloc_data_#t~malloc2.base| (select |old(#valid)| |alloc_data_#t~malloc2.base|))) (= 0 (select |old(#valid)| |alloc_data_#t~malloc2.base|)))) (= |alloc_data_#in~pdata.base| alloc_data_~pdata.base) (not (= alloc_data_~pdata.base |alloc_data_#t~malloc2.base|))) (not (= alloc_data_~pdata.offset 0))) (= alloc_data_~pdata.offset |alloc_data_#in~pdata.offset|)), 620#(or (not (= 0 |alloc_data_#in~pdata.offset|)) (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (or (and (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)))) (= (store (store |#valid| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) 4))) |old(#valid)|) (not (= |alloc_data_#in~pdata.base| (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4))))) (= (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|) (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) (+ 0 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| |alloc_data_#in~pdata.base|) |alloc_data_#in~pdata.offset|))))), 621#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (or (= (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))) (and (= (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0) |main_~#data~0.base| 0) (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|) 0) |old(#valid)|) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))))) (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|))) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) |main_~#data~0.offset|)))) (<= (+ |main_~#data~0.offset| 1) 0)), 622#(and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (not (= |main_~#data~0.base| |main_#t~mem4.base|)) (or (and (= |old(#valid)| (store (store (store |#valid| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)) 0) |main_~#data~0.base| 0) |main_#t~mem4.base| 0)) (not (= |main_~#data~0.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4))))) (= |main_#t~mem4.base| (select (select |#memory_$Pointer$.base| |main_~#data~0.base|) (+ |main_~#data~0.offset| 4)))) (not (= 0 |main_#t~mem4.base|))), 623#(and (or (= |main_#t~mem4.base| |main_#t~mem5.base|) (= |old(#valid)| (store (store (store |#valid| |main_#t~mem5.base| 0) |main_~#data~0.base| 0) |main_#t~mem4.base| 0))) (not (= |main_~#data~0.base| |main_#t~mem4.base|)) (not (= |main_~#data~0.base| |main_#t~mem5.base|)) (not (= 0 |main_#t~mem4.base|)) (not (= 0 |main_#t~mem5.base|))), 624#(and (= |#valid| |old(#valid)|) (= free_data_~lo~0.base |free_data_#in~data.lo.base|) (= free_data_~hi~0.base |free_data_#in~data.hi.base|)), 625#(and (= |free_data_#in~data.hi.base| free_data_~hi~0.base) (or (and (not (= free_data_~hi~0.base |free_data_#in~data.lo.base|)) (= |#valid| |old(#valid)|) (= free_data_~lo~0.base |free_data_#in~data.lo.base|)) (not (= free_data_~lo~0.offset free_data_~hi~0.offset)))), 626#(and (= |free_data_#in~data.hi.base| free_data_~hi~0.base) (or (= 0 |free_data_#in~data.lo.base|) (and (not (= free_data_~hi~0.base |free_data_#in~data.lo.base|)) (= (select (store |#valid| free_data_~hi~0.base 0) |free_data_#in~data.lo.base|) 0) (= |old(#valid)| (store |#valid| |free_data_#in~data.lo.base| (select |old(#valid)| |free_data_#in~data.lo.base|)))) (not (= 0 free_data_~hi~0.offset)))), 627#(or (= 0 |free_data_#in~data.lo.base|) (and (= (select |#valid| |free_data_#in~data.lo.base|) 0) (not (= |free_data_#in~data.hi.base| |free_data_#in~data.lo.base|)) (= (store (store |#valid| |free_data_#in~data.lo.base| (select |old(#valid)| |free_data_#in~data.lo.base|)) |free_data_#in~data.hi.base| (select |old(#valid)| |free_data_#in~data.hi.base|)) |old(#valid)|) (= (select |#valid| |free_data_#in~data.hi.base|) 0)) (= 0 |free_data_#in~data.hi.base|)), 628#(= |old(#valid)| (store |#valid| |main_~#data~0.base| 0))] [2018-02-04 02:07:42,290 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 02:07:42,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 02:07:42,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 02:07:42,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 02:07:42,291 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 17 states. [2018-02-04 02:07:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 02:07:42,806 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-04 02:07:42,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 02:07:42,806 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-02-04 02:07:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 02:07:42,807 INFO L225 Difference]: With dead ends: 27 [2018-02-04 02:07:42,807 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 02:07:42,807 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2018-02-04 02:07:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 02:07:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 02:07:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 02:07:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 02:07:42,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 02:07:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 02:07:42,808 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 02:07:42,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 02:07:42,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 02:07:42,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 02:07:42,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 02:07:42 BoogieIcfgContainer [2018-02-04 02:07:42,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 02:07:42,814 INFO L168 Benchmark]: Toolchain (without parser) took 4029.02 ms. Allocated memory was 385.9 MB in the beginning and 632.8 MB in the end (delta: 246.9 MB). Free memory was 342.8 MB in the beginning and 568.2 MB in the end (delta: -225.4 MB). Peak memory consumption was 21.5 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:42,815 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:07:42,815 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.35 ms. Allocated memory is still 385.9 MB. Free memory was 342.8 MB in the beginning and 332.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:42,815 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 385.9 MB. Free memory was 332.2 MB in the beginning and 330.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:42,815 INFO L168 Benchmark]: RCFGBuilder took 185.51 ms. Allocated memory is still 385.9 MB. Free memory was 330.9 MB in the beginning and 312.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 02:07:42,816 INFO L168 Benchmark]: TraceAbstraction took 3665.87 ms. Allocated memory was 385.9 MB in the beginning and 632.8 MB in the end (delta: 246.9 MB). Free memory was 312.9 MB in the beginning and 568.2 MB in the end (delta: -255.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 02:07:42,817 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.12 ms. Allocated memory is still 385.9 MB. Free memory is still 349.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.35 ms. Allocated memory is still 385.9 MB. Free memory was 342.8 MB in the beginning and 332.2 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.46 ms. Allocated memory is still 385.9 MB. Free memory was 332.2 MB in the beginning and 330.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 185.51 ms. Allocated memory is still 385.9 MB. Free memory was 330.9 MB in the beginning and 312.9 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3665.87 ms. Allocated memory was 385.9 MB in the beginning and 632.8 MB in the end (delta: 246.9 MB). Free memory was 312.9 MB in the beginning and 568.2 MB in the end (delta: -255.3 MB). There was no memory consumed. 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: 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: 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: 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: 637]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 13 error locations. SAFE Result, 3.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 153 SDtfs, 150 SDslu, 656 SDs, 0 SdLazy, 892 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 35449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_02-07-42-823.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_02-07-42-823.csv Received shutdown request...