java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:52:53,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:52:53,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:52:53,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:52:53,430 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:52:53,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:52:53,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:52:53,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:52:53,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:52:53,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:52:53,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:52:53,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:52:53,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:52:53,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:52:53,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:52:53,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:52:53,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:52:53,444 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:52:53,445 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:52:53,446 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:52:53,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:52:53,448 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:52:53,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:52:53,449 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:52:53,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:52:53,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:52:53,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:52:53,451 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:52:53,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:52:53,451 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:52:53,452 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:52:53,452 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:52:53,462 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:52:53,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:52:53,463 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:52:53,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:52:53,463 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:52:53,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:52:53,464 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:52:53,465 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:52:53,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:52:53,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:52:53,465 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:52:53,465 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:52:53,465 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:52:53,466 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:52:53,466 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:52:53,466 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:52:53,466 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:52:53,466 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:52:53,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:52:53,502 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:52:53,505 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:52:53,507 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:52:53,507 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:52:53,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i [2018-02-04 17:52:53,644 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:52:53,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:52:53,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:53,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:52:53,650 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:52:53,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7495b65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53, skipping insertion in model container [2018-02-04 17:52:53,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,662 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:53,687 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:52:53,770 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:53,781 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:52:53,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53 WrapperNode [2018-02-04 17:52:53,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:52:53,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:52:53,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:52:53,786 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:52:53,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... [2018-02-04 17:52:53,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:52:53,811 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:52:53,811 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:52:53,811 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:52:53,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:52:53,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:52:53,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:52:53,844 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-04 17:52:53,844 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-04 17:52:53,844 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:52:53,844 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 17:52:53,844 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:52:53,845 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:52:53,983 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:52:53,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:53 BoogieIcfgContainer [2018-02-04 17:52:53,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:52:53,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:52:53,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:52:53,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:52:53,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:52:53" (1/3) ... [2018-02-04 17:52:53,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be6431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:53, skipping insertion in model container [2018-02-04 17:52:53,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:52:53" (2/3) ... [2018-02-04 17:52:53,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62be6431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:52:53, skipping insertion in model container [2018-02-04 17:52:53,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:52:53" (3/3) ... [2018-02-04 17:52:53,988 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2018-02-04 17:52:53,993 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:52:53,998 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 17:52:54,027 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:52:54,027 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:52:54,028 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:52:54,028 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:52:54,028 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:52:54,028 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:52:54,028 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:52:54,028 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:52:54,028 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:52:54,036 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-02-04 17:52:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:52:54,043 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:54,043 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:54,044 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002709, now seen corresponding path program 1 times [2018-02-04 17:52:54,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:54,050 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:54,092 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,093 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,093 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:54,155 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:52:54,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:54,155 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:54,156 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,197 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:54,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:52:54,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:52:54,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 17:52:54,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:52:54,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 17:52:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:54,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:54,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:52:54,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:52:54,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:52:54,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:52:54,356 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-02-04 17:52:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:54,471 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-04 17:52:54,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:52:54,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 17:52:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:54,480 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:52:54,481 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 17:52:54,482 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 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 17:52:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 17:52:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 17:52:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 17:52:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 17:52:54,511 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 10 [2018-02-04 17:52:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:54,511 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 17:52:54,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:52:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 17:52:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 17:52:54,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:54,512 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:54,512 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:54,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002708, now seen corresponding path program 1 times [2018-02-04 17:52:54,513 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:54,513 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:54,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,514 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,514 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:54,534 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:52:54,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:54,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:54,536 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:54,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:52:54,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:52:54,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 17:52:54,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:54,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:54,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 17:52:54,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,628 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:54,629 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:54,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:52:54,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:54,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:52:54,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2018-02-04 17:52:54,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:54,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:54,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 17:52:54,649 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 17:52:54,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 17:52:54,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 17:52:54,650 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 6 states. [2018-02-04 17:52:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:54,781 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 17:52:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 17:52:54,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-04 17:52:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:54,782 INFO L225 Difference]: With dead ends: 44 [2018-02-04 17:52:54,782 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 17:52:54,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:52:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 17:52:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 17:52:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 17:52:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-04 17:52:54,785 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 10 [2018-02-04 17:52:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:54,785 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-04 17:52:54,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 17:52:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-04 17:52:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:52:54,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:54,786 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:54,786 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:54,786 INFO L82 PathProgramCache]: Analyzing trace with hash 500312934, now seen corresponding path program 1 times [2018-02-04 17:52:54,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:54,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:54,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:54,846 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:54,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 17:52:54,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:52:54,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:52:54,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:52:54,847 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 7 states. [2018-02-04 17:52:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:54,947 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-02-04 17:52:54,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:52:54,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-02-04 17:52:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:54,948 INFO L225 Difference]: With dead ends: 49 [2018-02-04 17:52:54,948 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 17:52:54,948 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:52:54,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 17:52:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-02-04 17:52:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 17:52:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-04 17:52:54,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 17 [2018-02-04 17:52:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:54,952 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-04 17:52:54,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:52:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-04 17:52:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 17:52:54,953 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:54,953 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:54,953 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 500312935, now seen corresponding path program 1 times [2018-02-04 17:52:54,953 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:54,954 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:54,954 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,954 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:54,955 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:54,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:55,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:55,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:52:55,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:52:55,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:52:55,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:52:55,063 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 8 states. [2018-02-04 17:52:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:55,145 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-02-04 17:52:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:52:55,146 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 17:52:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:55,146 INFO L225 Difference]: With dead ends: 38 [2018-02-04 17:52:55,146 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 17:52:55,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 17:52:55,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 17:52:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 17:52:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 17:52:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-02-04 17:52:55,151 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 17 [2018-02-04 17:52:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:55,151 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-02-04 17:52:55,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:52:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-02-04 17:52:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:52:55,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:55,152 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] [2018-02-04 17:52:55,152 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623589, now seen corresponding path program 1 times [2018-02-04 17:52:55,152 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:55,152 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:55,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,153 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:55,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:55,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:55,167 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:52:55,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:55,167 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:55,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:55,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:55,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-02-04 17:52:55,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-02-04 17:52:55,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-02-04 17:52:55,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 17:52:55,284 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:52:55,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-04 17:52:55,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-02-04 17:52:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:55,317 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:55,318 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:52:55,318 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:52:55,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:52:55,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:52:55,319 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 13 states. [2018-02-04 17:52:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:55,481 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-02-04 17:52:55,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:52:55,481 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-02-04 17:52:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:55,483 INFO L225 Difference]: With dead ends: 39 [2018-02-04 17:52:55,483 INFO L226 Difference]: Without dead ends: 39 [2018-02-04 17:52:55,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:52:55,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-02-04 17:52:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-02-04 17:52:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 17:52:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 17:52:55,485 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 22 [2018-02-04 17:52:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:55,486 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 17:52:55,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:52:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 17:52:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 17:52:55,486 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:55,486 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] [2018-02-04 17:52:55,486 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:55,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623588, now seen corresponding path program 1 times [2018-02-04 17:52:55,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:55,486 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:55,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:55,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:55,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:52:55,495 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:52:55,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:52:55,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:52:55,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:52:55,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:52:55,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 17:52:55,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:52:55,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 17:52:55,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 17:52:55,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-02-04 17:52:55,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:55,557 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:55,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 17:52:55,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-02-04 17:52:55,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-04 17:52:55,573 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:55,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 17:52:55,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,580 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 17:52:55,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-02-04 17:52:55,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:55,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:52:55,644 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:52:55,644 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:52:55,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2018-02-04 17:52:55,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:52:55,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:4 [2018-02-04 17:52:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:52:55,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:52:55,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 17:52:55,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 17:52:55,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 17:52:55,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-04 17:52:55,668 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 15 states. [2018-02-04 17:52:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:52:55,903 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-04 17:52:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:52:55,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2018-02-04 17:52:55,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:52:55,903 INFO L225 Difference]: With dead ends: 30 [2018-02-04 17:52:55,903 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 17:52:55,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2018-02-04 17:52:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 17:52:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 17:52:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 17:52:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2018-02-04 17:52:55,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 22 [2018-02-04 17:52:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:52:55,906 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2018-02-04 17:52:55,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 17:52:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2018-02-04 17:52:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 17:52:55,907 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:52:55,907 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:52:55,907 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 17:52:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -117517057, now seen corresponding path program 1 times [2018-02-04 17:52:55,908 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:52:55,908 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:52:55,908 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,909 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:52:55,909 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:52:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 17:52:55,947 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 17:52:55,954 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 17:52:55,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:52:55 BoogieIcfgContainer [2018-02-04 17:52:55,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:52:55,967 INFO L168 Benchmark]: Toolchain (without parser) took 2322.71 ms. Allocated memory was 407.4 MB in the beginning and 631.8 MB in the end (delta: 224.4 MB). Free memory was 364.1 MB in the beginning and 467.8 MB in the end (delta: -103.7 MB). Peak memory consumption was 120.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:55,968 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:52:55,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.76 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 354.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:55,968 INFO L168 Benchmark]: Boogie Preprocessor took 24.51 ms. Allocated memory is still 407.4 MB. Free memory was 354.6 MB in the beginning and 352.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:55,968 INFO L168 Benchmark]: RCFGBuilder took 172.71 ms. Allocated memory is still 407.4 MB. Free memory was 352.0 MB in the beginning and 333.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:55,968 INFO L168 Benchmark]: TraceAbstraction took 1982.25 ms. Allocated memory was 407.4 MB in the beginning and 631.8 MB in the end (delta: 224.4 MB). Free memory was 332.0 MB in the beginning and 467.8 MB in the end (delta: -135.7 MB). Peak memory consumption was 88.7 MB. Max. memory is 5.3 GB. [2018-02-04 17:52:55,969 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.13 ms. Allocated memory is still 407.4 MB. Free memory is still 370.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 140.76 ms. Allocated memory is still 407.4 MB. Free memory was 364.1 MB in the beginning and 354.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.51 ms. Allocated memory is still 407.4 MB. Free memory was 354.6 MB in the beginning and 352.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.71 ms. Allocated memory is still 407.4 MB. Free memory was 352.0 MB in the beginning and 333.4 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1982.25 ms. Allocated memory was 407.4 MB in the beginning and 631.8 MB in the end (delta: 224.4 MB). Free memory was 332.0 MB in the beginning and 467.8 MB in the end (delta: -135.7 MB). Peak memory consumption was 88.7 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: 639]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L640] FCALL TData data; VAL [data={26:0}] [L641] CALL alloc_data(&data) VAL [pdata={26:0}] [L625] EXPR, FCALL malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L625] FCALL pdata->lo = malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L626] EXPR, FCALL malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L626] RET, FCALL pdata->hi = malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L641] alloc_data(&data) VAL [data={26:0}] [L642] CALL free_data(&data) VAL [data={26:0}] [L630] EXPR, FCALL data->lo VAL [data={26:0}, data={26:0}, data->lo={27:0}] [L630] void *lo = data->lo; [L631] EXPR, FCALL data->hi VAL [data={26:0}, data={26:0}, data->hi={28:0}, lo={27:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L636] FCALL data->lo = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L637] RET, FCALL data->hi = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L642] free_data(&data) VAL [data={26:0}] [L643] return 0; VAL [\result=0, data={26:0}] [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 17 error locations. UNSAFE Result, 1.9s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 163 SDtfs, 171 SDslu, 560 SDs, 0 SdLazy, 622 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 92 ConstructedInterpolants, 9 QuantifiedInterpolants, 11996 SizeOfPredicates, 28 NumberOfNonLiveVariables, 367 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-52-55-974.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-52-55-974.csv Received shutdown request...