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/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 16:42:30,525 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 16:42:30,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 16:42:30,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 16:42:30,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 16:42:30,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 16:42:30,540 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 16:42:30,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 16:42:30,542 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 16:42:30,543 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 16:42:30,544 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 16:42:30,544 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 16:42:30,545 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 16:42:30,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 16:42:30,546 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 16:42:30,548 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 16:42:30,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 16:42:30,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 16:42:30,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 16:42:30,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 16:42:30,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 16:42:30,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 16:42:30,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 16:42:30,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 16:42:30,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 16:42:30,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 16:42:30,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 16:42:30,558 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 16:42:30,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 16:42:30,558 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 16:42:30,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 16:42:30,559 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 16:42:30,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 16:42:30,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 16:42:30,568 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 16:42:30,568 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 16:42:30,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 16:42:30,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 16:42:30,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 16:42:30,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 16:42:30,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 16:42:30,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 16:42:30,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 16:42:30,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 16:42:30,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 16:42:30,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 16:42:30,606 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 16:42:30,609 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 16:42:30,610 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 16:42:30,610 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 16:42:30,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-02-04 16:42:30,746 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 16:42:30,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 16:42:30,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 16:42:30,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 16:42:30,753 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 16:42:30,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30, skipping insertion in model container [2018-02-04 16:42:30,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,771 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:42:30,797 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 16:42:30,880 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:42:30,891 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 16:42:30,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30 WrapperNode [2018-02-04 16:42:30,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 16:42:30,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 16:42:30,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 16:42:30,897 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 16:42:30,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (1/1) ... [2018-02-04 16:42:30,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 16:42:30,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 16:42:30,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 16:42:30,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 16:42:30,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (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 16:42:30,963 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 16:42:30,963 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 16:42:30,963 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-04 16:42:30,963 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 16:42:30,963 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 16:42:30,963 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 16:42:30,963 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 16:42:30,963 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 16:42:30,964 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 16:42:31,085 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 16:42:31,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:42:31 BoogieIcfgContainer [2018-02-04 16:42:31,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 16:42:31,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 16:42:31,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 16:42:31,088 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 16:42:31,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 04:42:30" (1/3) ... [2018-02-04 16:42:31,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798e0141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:42:31, skipping insertion in model container [2018-02-04 16:42:31,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 04:42:30" (2/3) ... [2018-02-04 16:42:31,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@798e0141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 04:42:31, skipping insertion in model container [2018-02-04 16:42:31,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 04:42:31" (3/3) ... [2018-02-04 16:42:31,090 INFO L107 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-02-04 16:42:31,096 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 16:42:31,101 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-02-04 16:42:31,131 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 16:42:31,131 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 16:42:31,131 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 16:42:31,131 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 16:42:31,132 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 16:42:31,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 16:42:31,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 16:42:31,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 16:42:31,132 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 16:42:31,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-02-04 16:42:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-02-04 16:42:31,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,149 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times [2018-02-04 16:42:31,204 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,255 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 16:42:31,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:42:31,258 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,258 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 16:42:31,258 INFO L182 omatonBuilderFactory]: Interpolants [41#true, 42#false] [2018-02-04 16:42:31,259 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 16:42:31,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 16:42:31,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 16:42:31,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 16:42:31,274 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-02-04 16:42:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,286 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-02-04 16:42:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 16:42:31,287 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-02-04 16:42:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,292 INFO L225 Difference]: With dead ends: 38 [2018-02-04 16:42:31,293 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 16:42:31,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 16:42:31,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 16:42:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 16:42:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 16:42:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 16:42:31,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9 [2018-02-04 16:42:31,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,374 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 16:42:31,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 16:42:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 16:42:31,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 16:42:31,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,375 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times [2018-02-04 16:42:31,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,403 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 16:42:31,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 16:42:31,403 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,403 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 16:42:31,403 INFO L182 omatonBuilderFactory]: Interpolants [112#true, 113#false, 114#(= |#valid| |old(#valid)|)] [2018-02-04 16:42:31,403 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 16:42:31,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:42:31,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:42:31,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:42:31,405 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2018-02-04 16:42:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,447 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-04 16:42:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:42:31,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 16:42:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,448 INFO L225 Difference]: With dead ends: 46 [2018-02-04 16:42:31,448 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 16:42:31,449 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:42:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 16:42:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-02-04 16:42:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 16:42:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-02-04 16:42:31,452 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12 [2018-02-04 16:42:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,452 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-02-04 16:42:31,452 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:42:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-02-04 16:42:31,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 16:42:31,453 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,453 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,453 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times [2018-02-04 16:42:31,454 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,483 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 16:42:31,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:42:31,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,484 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 16:42:31,484 INFO L182 omatonBuilderFactory]: Interpolants [201#true, 202#false, 203#(and (= main_~p~0.base 0) (= main_~p~0.offset 0))] [2018-02-04 16:42:31,484 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 16:42:31,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 16:42:31,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 16:42:31,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:42:31,484 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2018-02-04 16:42:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,501 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-02-04 16:42:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 16:42:31,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-02-04 16:42:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,502 INFO L225 Difference]: With dead ends: 46 [2018-02-04 16:42:31,502 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 16:42:31,502 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 16:42:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 16:42:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-02-04 16:42:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 16:42:31,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-02-04 16:42:31,504 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2018-02-04 16:42:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,505 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-02-04 16:42:31,505 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 16:42:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-02-04 16:42:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 16:42:31,505 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,505 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,505 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times [2018-02-04 16:42:31,506 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,547 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 16:42:31,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:42:31,547 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,547 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 16:42:31,548 INFO L182 omatonBuilderFactory]: Interpolants [284#true, 285#false, 286#(= 1 (select |#valid| |main_#t~malloc1.base|)), 287#(= 1 (select |#valid| main_~t~0.base))] [2018-02-04 16:42:31,548 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 16:42:31,548 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:42:31,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:42:31,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:42:31,549 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-02-04 16:42:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,601 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-02-04 16:42:31,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:42:31,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 16:42:31,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,603 INFO L225 Difference]: With dead ends: 34 [2018-02-04 16:42:31,603 INFO L226 Difference]: Without dead ends: 34 [2018-02-04 16:42:31,603 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 16:42:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-02-04 16:42:31,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-02-04 16:42:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 16:42:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-02-04 16:42:31,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13 [2018-02-04 16:42:31,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,606 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-02-04 16:42:31,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:42:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-02-04 16:42:31,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 16:42:31,607 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,607 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,607 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times [2018-02-04 16:42:31,608 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,681 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 16:42:31,682 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:42:31,682 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,682 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 16:42:31,682 INFO L182 omatonBuilderFactory]: Interpolants [357#true, 358#false, 359#(and (= 0 |main_#t~malloc1.offset|) (= 8 (select |#length| |main_#t~malloc1.base|))), 360#(and (= (select |#length| main_~t~0.base) 8) (= main_~t~0.offset 0))] [2018-02-04 16:42:31,683 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 16:42:31,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:42:31,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:42:31,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:42:31,683 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-02-04 16:42:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,716 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-02-04 16:42:31,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 16:42:31,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 16:42:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,717 INFO L225 Difference]: With dead ends: 32 [2018-02-04 16:42:31,717 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 16:42:31,718 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 16:42:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 16:42:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-02-04 16:42:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 16:42:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 16:42:31,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13 [2018-02-04 16:42:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,721 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 16:42:31,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:42:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 16:42:31,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:42:31,721 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,722 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,722 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,722 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times [2018-02-04 16:42:31,723 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,735 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:31,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 16:42:31,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,770 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 16:42:31,770 INFO L182 omatonBuilderFactory]: Interpolants [426#true, 427#false, 428#(not (= 0 |main_#t~malloc1.base|)), 429#(not (= 0 main_~t~0.base)), 430#(not (= 0 main_~p~0.base))] [2018-02-04 16:42:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:31,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:42:31,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:42:31,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:42:31,771 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-02-04 16:42:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,824 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-02-04 16:42:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:31,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 16:42:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,825 INFO L225 Difference]: With dead ends: 46 [2018-02-04 16:42:31,825 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 16:42:31,825 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:42:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 16:42:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-02-04 16:42:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 16:42:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-02-04 16:42:31,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2018-02-04 16:42:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,827 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-02-04 16:42:31,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:42:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-02-04 16:42:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:42:31,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,828 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,828 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times [2018-02-04 16:42:31,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:31,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:31,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 16:42:31,869 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:31,870 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 16:42:31,870 INFO L182 omatonBuilderFactory]: Interpolants [514#true, 515#false, 516#(= 1 (select |#valid| main_~t~0.base)), 517#(= 1 (select |#valid| main_~p~0.base))] [2018-02-04 16:42:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:31,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 16:42:31,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 16:42:31,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 16:42:31,871 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-02-04 16:42:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:31,919 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 16:42:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:31,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-02-04 16:42:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:31,920 INFO L225 Difference]: With dead ends: 39 [2018-02-04 16:42:31,920 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 16:42:31,920 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 16:42:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 16:42:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-02-04 16:42:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-04 16:42:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-04 16:42:31,923 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-02-04 16:42:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:31,923 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-04 16:42:31,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 16:42:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-04 16:42:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 16:42:31,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:31,924 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:31,924 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times [2018-02-04 16:42:31,925 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 16:42:31,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 16:42:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:32,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 16:42:32,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 16:42:32,007 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 16:42:32,007 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 16:42:32,007 INFO L182 omatonBuilderFactory]: Interpolants [592#true, 593#false, 594#(and (= 0 |main_#t~malloc1.offset|) (= 8 (select |#length| |main_#t~malloc1.base|))), 595#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 596#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0))] [2018-02-04 16:42:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 16:42:32,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 16:42:32,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 16:42:32,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 16:42:32,008 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2018-02-04 16:42:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 16:42:32,052 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-02-04 16:42:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 16:42:32,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-04 16:42:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 16:42:32,053 INFO L225 Difference]: With dead ends: 41 [2018-02-04 16:42:32,053 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 16:42:32,054 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 16:42:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 16:42:32,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-02-04 16:42:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-02-04 16:42:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-02-04 16:42:32,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2018-02-04 16:42:32,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 16:42:32,056 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-02-04 16:42:32,056 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 16:42:32,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-02-04 16:42:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 16:42:32,056 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 16:42:32,056 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 16:42:32,056 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-02-04 16:42:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times [2018-02-04 16:42:32,057 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 16:42:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:42:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 16:42:32,093 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 16:42:32,103 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 16:42:32,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 04:42:32 BoogieIcfgContainer [2018-02-04 16:42:32,114 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 16:42:32,115 INFO L168 Benchmark]: Toolchain (without parser) took 1368.83 ms. Allocated memory was 400.0 MB in the beginning and 611.3 MB in the end (delta: 211.3 MB). Free memory was 355.4 MB in the beginning and 478.1 MB in the end (delta: -122.7 MB). Peak memory consumption was 88.6 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:32,116 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 16:42:32,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 148.28 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 343.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:32,117 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 ms. Allocated memory is still 400.0 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:32,117 INFO L168 Benchmark]: RCFGBuilder took 160.49 ms. Allocated memory is still 400.0 MB. Free memory was 342.1 MB in the beginning and 324.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:32,117 INFO L168 Benchmark]: TraceAbstraction took 1028.25 ms. Allocated memory was 400.0 MB in the beginning and 611.3 MB in the end (delta: 211.3 MB). Free memory was 323.6 MB in the beginning and 478.1 MB in the end (delta: -154.5 MB). Peak memory consumption was 56.8 MB. Max. memory is 5.3 GB. [2018-02-04 16:42:32,118 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.09 ms. Allocated memory is still 400.0 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 148.28 ms. Allocated memory is still 400.0 MB. Free memory was 354.1 MB in the beginning and 343.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.62 ms. Allocated memory is still 400.0 MB. Free memory was 343.4 MB in the beginning and 342.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 160.49 ms. Allocated memory is still 400.0 MB. Free memory was 342.1 MB in the beginning and 324.9 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1028.25 ms. Allocated memory was 400.0 MB in the beginning and 611.3 MB in the end (delta: 211.3 MB). Free memory was 323.6 MB in the beginning and 478.1 MB in the end (delta: -154.5 MB). Peak memory consumption was 56.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 626]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] [L634] p = t VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, t={13:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1, t={13:0}] [L637] COND FALSE !(p->h != 1) [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}, t={13:0}] [L640] p = p->n [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={13:0}, p={0:0}, t={13:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. UNSAFE Result, 0.9s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 262 SDslu, 144 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 9/9 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, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_16-42-32-124.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_16-42-32-124.csv Received shutdown request...