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/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:57:39,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:57:39,773 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:57:39,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:57:39,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:57:39,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:57:39,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:57:39,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:57:39,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:57:39,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:57:39,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:57:39,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:57:39,796 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:57:39,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:57:39,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:57:39,800 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:57:39,802 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:57:39,804 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:57:39,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:57:39,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:57:39,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:57:39,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:57:39,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:57:39,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:57:39,810 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:57:39,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:57:39,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:57:39,812 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:57:39,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:57:39,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:57:39,813 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:57:39,814 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:57:39,823 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:57:39,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:57:39,824 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:57:39,824 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:57:39,825 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:57:39,825 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:57:39,825 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:57:39,825 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:57:39,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:57:39,826 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:57:39,826 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:57:39,826 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:57:39,826 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:57:39,827 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:57:39,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:57:39,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:57:39,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:57:39,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:57:39,828 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:57:39,829 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:57:39,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:57:39,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:57:39,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:57:39,829 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:57:39,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:57:39,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:57:39,830 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:57:39,830 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:57:39,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:57:39,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:57:39,831 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:57:39,831 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:57:39,831 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:57:39,832 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:57:39,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:57:39,873 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:57:39,875 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:57:39,876 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:57:39,877 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:57:39,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-21 00:57:40,054 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:57:40,060 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:57:40,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:57:40,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:57:40,068 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:57:40,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f922628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40, skipping insertion in model container [2018-01-21 00:57:40,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:57:40,132 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:57:40,241 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:57:40,256 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:57:40,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40 WrapperNode [2018-01-21 00:57:40,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:57:40,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:57:40,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:57:40,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:57:40,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... [2018-01-21 00:57:40,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:57:40,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:57:40,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:57:40,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:57:40,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (1/1) ... No working directory specified, using /storage/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-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:57:40,351 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:57:40,352 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-21 00:57:40,353 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:57:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:57:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:57:40,354 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:57:40,561 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:57:40,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:57:40 BoogieIcfgContainer [2018-01-21 00:57:40,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:57:40,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:57:40,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:57:40,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:57:40,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:57:40" (1/3) ... [2018-01-21 00:57:40,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39edc91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:57:40, skipping insertion in model container [2018-01-21 00:57:40,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:57:40" (2/3) ... [2018-01-21 00:57:40,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39edc91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:57:40, skipping insertion in model container [2018-01-21 00:57:40,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:57:40" (3/3) ... [2018-01-21 00:57:40,571 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_true-valid-memsafety_true-termination.i [2018-01-21 00:57:40,580 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:57:40,586 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 00:57:40,625 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:40,626 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:40,626 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:40,626 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:40,626 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:40,626 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:40,626 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:40,627 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 00:57:40,627 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:40,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:57:40,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:40,654 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:40,654 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 00:57:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1099837170, now seen corresponding path program 1 times [2018-01-21 00:57:40,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:40,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:40,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:40,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:40,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:40,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:40,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:40,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:40,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,085 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:41,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:41,137 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:41,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:41,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-21 00:57:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:41,145 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:41,145 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:41,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:41,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 00:57:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:41,170 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:41,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:41,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:41,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:57:41,220 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:57:41,220 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,221 INFO L401 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point L1466(line 1466) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,222 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: true [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,223 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 00:57:41,224 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-21 00:57:41,224 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,225 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,225 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:57:41,225 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,225 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 00:57:41,225 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 00:57:41,225 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 00:57:41,226 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 00:57:41,226 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,227 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 00:57:41,227 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 00:57:41,227 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 00:57:41,227 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,231 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,232 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,232 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,232 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,232 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:57:41,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,235 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:57:41,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,236 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:41,236 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:57:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1453439476, now seen corresponding path program 1 times [2018-01-21 00:57:41,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,238 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:41,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:41,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:41,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:41,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:57:41,338 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,340 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:41,365 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:41,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-21 00:57:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:41,366 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:41,366 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:41,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:41,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 00:57:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:41,368 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:41,368 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:41,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:41,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:57:41,396 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:57:41,396 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,396 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,396 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:57:41,397 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,398 INFO L401 ceAbstractionStarter]: For program point L1466'(line 1466) no Hoare annotation was computed. [2018-01-21 00:57:41,398 INFO L401 ceAbstractionStarter]: For program point L1466(line 1466) no Hoare annotation was computed. [2018-01-21 00:57:41,398 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,398 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:57:41,398 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,398 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-21 00:57:41,398 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-21 00:57:41,399 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-21 00:57:41,399 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 00:57:41,399 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1461 1463) the Hoare annotation is: true [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point L1462''(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point L1462'(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1461 1463) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point L1462(line 1462) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-21 00:57:41,400 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,401 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,402 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:57:41,402 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:57:41,402 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 00:57:41,402 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 00:57:41,402 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 00:57:41,402 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 00:57:41,402 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 00:57:41,402 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,403 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 00:57:41,403 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 00:57:41,404 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 00:57:41,404 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 00:57:41,406 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,406 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,406 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,406 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,406 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,407 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,407 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,407 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:57:41,407 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-21 00:57:41,409 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,409 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-21 00:57:41,410 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:57:41,410 INFO L82 PathProgramCache]: Analyzing trace with hash 97524844, now seen corresponding path program 1 times [2018-01-21 00:57:41,410 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,411 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,412 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,412 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,412 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:57:41,448 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:57:41,454 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:57:41,459 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:57:41,459 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:57:41,460 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:57:41,461 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:57:41,465 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,465 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,465 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,465 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,465 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,465 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,465 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,466 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:57:41,466 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,467 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:57:41,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,469 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:41,469 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:57:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1657025672, now seen corresponding path program 1 times [2018-01-21 00:57:41,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:41,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:41,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:41,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:41,591 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,591 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:41,654 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:41,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:57:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:41,655 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:41,655 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:41,656 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:41,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:57:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:41,657 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:41,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:41,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:41,663 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,663 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,663 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,663 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,664 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,664 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,664 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,664 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:57:41,664 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:57:41,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:41,667 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:57:41,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1530214196, now seen corresponding path program 1 times [2018-01-21 00:57:41,667 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:41,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:41,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:41,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:41,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:41,754 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,755 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:41,785 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:41,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:41,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 00:57:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:41,788 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:41,788 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:41,789 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:41,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 00:57:41,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:41,790 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:41,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:41,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:41,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:41,792 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,792 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,792 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,792 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,793 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,793 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,793 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,793 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-21 00:57:41,793 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:57:41,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,796 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:41,796 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 00:57:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1047246845, now seen corresponding path program 1 times [2018-01-21 00:57:41,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:41,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:41,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:41,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:41,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:41,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,879 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,879 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:41,898 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:41,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:41,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:57:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:41,899 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:41,899 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:41,900 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:41,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:41,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:41,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:57:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:41,900 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:41,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:41,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:41,902 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:41,902 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:41,902 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:41,902 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:41,902 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:41,902 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:41,902 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:41,902 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:57:41,902 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:57:41,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:41,905 INFO L322 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] [2018-01-21 00:57:41,905 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:57:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2018517172, now seen corresponding path program 1 times [2018-01-21 00:57:41,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:41,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,907 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:41,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:41,907 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:41,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:41,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:41,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:41,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:41,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:41,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:41,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:41,973 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:42,002 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:42,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:42,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 00:57:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:42,003 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:42,003 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:42,004 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:42,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 00:57:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:42,004 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:42,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:42,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:42,006 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:42,006 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:42,006 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:42,006 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:42,006 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:42,006 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:42,006 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:42,006 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 00:57:42,006 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:57:42,008 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:42,009 INFO L322 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] [2018-01-21 00:57:42,009 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 00:57:42,009 INFO L82 PathProgramCache]: Analyzing trace with hash 511959407, now seen corresponding path program 1 times [2018-01-21 00:57:42,009 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:42,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:42,011 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:42,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:42,011 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:42,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:42,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:42,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:42,099 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:42,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:42,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:42,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:42,099 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:42,117 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:42,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 00:57:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:42,119 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:42,119 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:42,119 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:42,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:42,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 00:57:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:42,121 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:42,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:42,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:42,122 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:57:42,122 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:57:42,122 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:57:42,122 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:57:42,122 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:57:42,122 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:57:42,123 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:57:42,123 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-21 00:57:42,123 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:57:42,124 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 00:57:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:57:42,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:57:42,125 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:57:42,125 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 00:57:42,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1520695812, now seen corresponding path program 1 times [2018-01-21 00:57:42,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:57:42,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:42,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:57:42,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:57:42,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:57:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:57:42,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:57:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:57:42,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:57:42,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:57:42,217 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:57:42,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:57:42,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:57:42,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:42,218 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 6 states. [2018-01-21 00:57:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:57:42,236 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-01-21 00:57:42,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:57:42,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-21 00:57:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:57:42,237 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:57:42,237 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:57:42,238 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:57:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:57:42,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:57:42,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:57:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:57:42,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 00:57:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:57:42,240 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:57:42,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:57:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:57:42,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:57:42,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:57:42 BoogieIcfgContainer [2018-01-21 00:57:42,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:57:42,243 INFO L168 Benchmark]: Toolchain (without parser) took 2188.75 ms. Allocated memory was 303.6 MB in the beginning and 459.8 MB in the end (delta: 156.2 MB). Free memory was 260.9 MB in the beginning and 315.3 MB in the end (delta: -54.5 MB). Peak memory consumption was 101.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:42,244 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:57:42,245 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.83 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 247.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:42,245 INFO L168 Benchmark]: Boogie Preprocessor took 36.99 ms. Allocated memory is still 303.6 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:42,245 INFO L168 Benchmark]: RCFGBuilder took 259.89 ms. Allocated memory is still 303.6 MB. Free memory was 245.8 MB in the beginning and 227.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:42,246 INFO L168 Benchmark]: TraceAbstraction took 1679.86 ms. Allocated memory was 303.6 MB in the beginning and 459.8 MB in the end (delta: 156.2 MB). Free memory was 227.1 MB in the beginning and 315.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 68.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:57:42,247 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.18 ms. Allocated memory is still 303.6 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.83 ms. Allocated memory is still 303.6 MB. Free memory was 260.9 MB in the beginning and 247.9 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.99 ms. Allocated memory is still 303.6 MB. Free memory was 247.9 MB in the beginning and 245.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 259.89 ms. Allocated memory is still 303.6 MB. Free memory was 245.8 MB in the beginning and 227.1 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1679.86 ms. Allocated memory was 303.6 MB in the beginning and 459.8 MB in the end (delta: 156.2 MB). Free memory was 227.1 MB in the beginning and 315.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 68.0 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1434]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: f6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.6s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1072]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1466] FCALL struct A a6; VAL [\old(a6)=null, \old(a6)=null, a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1476]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 3 SDslu, 0 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1461]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: disconnect_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1468]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1438]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: g6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: probe1_6Err0EnsuresViolation CFG has 9 procedures, 62 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 850 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1452]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_00-57-42-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_00-57-42-259.csv Received shutdown request...