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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:40:56,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:40:56,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:40:56,832 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:40:56,832 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:40:56,833 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:40:56,834 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:40:56,836 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:40:56,838 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:40:56,839 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:40:56,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:40:56,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:40:56,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:40:56,841 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:40:56,842 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:40:56,844 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:40:56,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:40:56,849 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:40:56,850 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:40:56,851 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:40:56,854 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:40:56,854 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:40:56,854 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:40:56,855 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:40:56,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:40:56,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:40:56,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:40:56,858 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:40:56,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:40:56,859 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:40:56,859 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:40:56,860 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_smtcomp.epf [2018-01-21 10:40:56,870 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:40:56,870 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:40:56,871 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:40:56,871 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:40:56,871 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:40:56,872 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:40:56,872 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:40:56,872 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:40:56,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:40:56,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:40:56,873 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:40:56,873 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:40:56,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:40:56,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:40:56,875 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:40:56,875 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:40:56,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:40:56,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:40:56,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:40:56,876 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:40:56,876 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:40:56,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:40:56,876 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:40:56,876 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:40:56,877 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:40:56,877 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:40:56,877 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:40:56,877 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:40:56,877 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:40:56,878 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:40:56,878 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:40:56,878 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:40:56,879 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:40:56,879 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:40:56,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:40:56,927 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:40:56,931 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:40:56,933 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:40:56,933 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:40:56,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-21 10:40:57,123 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:40:57,128 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:40:57,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:40:57,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:40:57,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:40:57,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fcb04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57, skipping insertion in model container [2018-01-21 10:40:57,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,160 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:40:57,211 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:40:57,335 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:40:57,354 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:40:57,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57 WrapperNode [2018-01-21 10:40:57,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:40:57,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:40:57,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:40:57,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:40:57,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,391 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (1/1) ... [2018-01-21 10:40:57,394 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:40:57,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:40:57,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:40:57,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:40:57,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (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 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 10:40:57,444 INFO L136 BoogieDeclarations]: Found implementation of procedure probe1_6 [2018-01-21 10:40:57,445 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_2_6 [2018-01-21 10:40:57,445 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:40:57,445 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:40:57,445 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure probe1_6 [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_2_6 [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:40:57,446 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:40:57,667 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:40:57,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:40:57 BoogieIcfgContainer [2018-01-21 10:40:57,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:40:57,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:40:57,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:40:57,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:40:57,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:40:57" (1/3) ... [2018-01-21 10:40:57,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7857ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:40:57, skipping insertion in model container [2018-01-21 10:40:57,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:40:57" (2/3) ... [2018-01-21 10:40:57,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7857ee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:40:57, skipping insertion in model container [2018-01-21 10:40:57,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:40:57" (3/3) ... [2018-01-21 10:40:57,676 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3_false-valid-memtrack_true-termination.i [2018-01-21 10:40:57,685 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:40:57,691 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 10:40:57,738 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:57,739 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:57,739 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:57,739 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:57,739 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:57,739 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:57,739 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:57,739 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 10:40:57,740 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:40:57,768 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:57,769 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 10:40:57,770 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 10:40:57,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1409968181, now seen corresponding path program 1 times [2018-01-21 10:40:57,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:57,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:57,827 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:57,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:57,827 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:57,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:58,093 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 10:40:58,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:58,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:58,096 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:58,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:58,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:58,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,178 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:58,242 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:58,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:58,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-21 10:40:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:58,252 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:58,252 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:58,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:58,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 10:40:58,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:58,285 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:58,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:58,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:58,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:40:58,329 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 10:40:58,329 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,329 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,329 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,329 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 10:40:58,329 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,330 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,331 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-21 10:40:58,332 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 10:40:58,333 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 10:40:58,333 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 10:40:58,334 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 10:40:58,334 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,335 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 10:40:58,335 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 10:40:58,335 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 10:40:58,335 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,337 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,338 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,338 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,338 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,338 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,338 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,338 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,338 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:40:58,338 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 10:40:58,340 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,341 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:40:58,341 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:40:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash 412789303, now seen corresponding path program 1 times [2018-01-21 10:40:58,341 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,342 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:58,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:58,457 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 10:40:58,458 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:58,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:40:58,458 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:58,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:58,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:58,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,459 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:58,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:58,484 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:58,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:58,485 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-21 10:40:58,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:58,485 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:58,485 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:58,486 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 10:40:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:58,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 10:40:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:58,487 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:58,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:58,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:58,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:40:58,507 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 10:40:58,507 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,507 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,507 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 10:40:58,507 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 10:40:58,507 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 10:40:58,507 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point L1465(line 1465) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,508 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1478) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:40:58,508 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L404 ceAbstractionStarter]: At program point disconnect_2_6ENTRY(lines 1461 1462) the Hoare annotation is: true [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6EXIT(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6FINAL(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point disconnect_2_6Err0EnsuresViolation(lines 1461 1462) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1478) the Hoare annotation is: true [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1478) the Hoare annotation is: false [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,509 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1476 1478) the Hoare annotation is: true [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1476 1478) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1468 1474) the Hoare annotation is: true [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point L1469(line 1469) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point L1470'(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 10:40:58,510 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1468 1474) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point L1470(lines 1470 1472) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L404 ceAbstractionStarter]: At program point L1471(line 1471) the Hoare annotation is: true [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point L1453'(line 1453) no Hoare annotation was computed. [2018-01-21 10:40:58,511 INFO L404 ceAbstractionStarter]: At program point L1452(line 1452) the Hoare annotation is: true [2018-01-21 10:40:58,511 INFO L401 ceAbstractionStarter]: For program point L1453(line 1453) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L404 ceAbstractionStarter]: At program point L1450(line 1450) the Hoare annotation is: true [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point L1451(lines 1451 1452) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point L1447'(line 1447) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L404 ceAbstractionStarter]: At program point probe1_6ENTRY(lines 1442 1459) the Hoare annotation is: true [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point L1457(line 1457) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point probe1_6Err0EnsuresViolation(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point L1444'(line 1444) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L401 ceAbstractionStarter]: For program point L1450'(line 1450) no Hoare annotation was computed. [2018-01-21 10:40:58,512 INFO L404 ceAbstractionStarter]: At program point L1444(line 1444) the Hoare annotation is: true [2018-01-21 10:40:58,513 INFO L401 ceAbstractionStarter]: For program point probe1_6EXIT(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,513 INFO L404 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: true [2018-01-21 10:40:58,513 INFO L401 ceAbstractionStarter]: For program point L1448(lines 1448 1449) no Hoare annotation was computed. [2018-01-21 10:40:58,513 INFO L401 ceAbstractionStarter]: For program point L1445(lines 1445 1446) no Hoare annotation was computed. [2018-01-21 10:40:58,513 INFO L401 ceAbstractionStarter]: For program point probe1_6FINAL(lines 1442 1459) no Hoare annotation was computed. [2018-01-21 10:40:58,515 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,516 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,516 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,516 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,516 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,516 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,516 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,516 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:40:58,516 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-21 10:40:58,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,519 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-21 10:40:58,519 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:40:58,520 INFO L82 PathProgramCache]: Analyzing trace with hash 94754281, now seen corresponding path program 1 times [2018-01-21 10:40:58,520 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:40:58,557 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:40:58,563 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:40:58,568 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 10:40:58,569 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 10:40:58,570 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 10:40:58,570 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 10:40:58,574 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,574 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,574 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,574 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,574 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,574 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,574 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,575 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_2_6Err0EnsuresViolation======== [2018-01-21 10:40:58,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 10:40:58,578 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,578 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] [2018-01-21 10:40:58,578 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_2_6Err0EnsuresViolation]=== [2018-01-21 10:40:58,578 INFO L82 PathProgramCache]: Analyzing trace with hash 667995110, now seen corresponding path program 1 times [2018-01-21 10:40:58,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,580 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,580 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:58,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:58,711 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 10:40:58,711 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:58,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:58,711 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:58,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:58,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:58,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,712 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:58,731 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:58,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-21 10:40:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:58,732 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:58,732 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:58,733 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 10:40:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:58,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:58,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 10:40:58,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:58,733 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:58,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:58,733 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:58,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:58,735 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,735 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,736 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,736 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,736 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,736 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,736 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,736 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:40:58,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 10:40:58,739 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,740 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 10:40:58,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:40:58,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1044480613, now seen corresponding path program 1 times [2018-01-21 10:40:58,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,742 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:58,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:58,837 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 10:40:58,838 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:58,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:58,838 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:58,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:58,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:58,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,839 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:58,859 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:58,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:58,860 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 10:40:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:58,860 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:58,860 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:58,861 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 10:40:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:58,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 10:40:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:58,861 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:58,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:58,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:58,863 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,863 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,863 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,863 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,863 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,863 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,863 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,863 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:40:58,863 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:40:58,865 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,866 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 10:40:58,866 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:40:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -765331831, now seen corresponding path program 1 times [2018-01-21 10:40:58,866 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,867 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,867 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,867 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:58,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:58,946 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 10:40:58,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:58,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:58,947 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:58,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:58,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:58,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:58,948 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:58,968 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:58,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 10:40:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:58,968 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:58,968 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:58,969 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 10:40:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:58,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:58,969 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 10:40:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:58,970 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:58,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:58,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:58,971 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:58,971 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:58,971 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:58,971 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:58,971 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:58,971 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:58,971 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:58,972 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:40:58,972 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:40:58,973 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:58,974 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 10:40:58,974 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:40:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1641018034, now seen corresponding path program 1 times [2018-01-21 10:40:58,974 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:58,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:58,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:58,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:58,984 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:59,032 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 10:40:59,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:59,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:59,032 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:59,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:59,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:59,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:59,033 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:59,064 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:59,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 10:40:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:59,065 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:59,065 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:59,066 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 10:40:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:59,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:59,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 10:40:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:59,067 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:59,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:59,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:59,068 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:59,068 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:59,068 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:59,069 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:59,069 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:59,069 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:59,069 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:59,069 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 10:40:59,069 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 10:40:59,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:59,072 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 10:40:59,072 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 10:40:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 2049483698, now seen corresponding path program 1 times [2018-01-21 10:40:59,072 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:59,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:59,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:59,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:59,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:59,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:59,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:40:59,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:59,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:59,147 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:59,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:59,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:59,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:59,148 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:59,162 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:59,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 10:40:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:59,163 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:59,163 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:59,164 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 10:40:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:59,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:59,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:59,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 10:40:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:59,165 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:59,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:59,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:59,166 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:40:59,167 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:40:59,167 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:40:59,167 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:40:59,167 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:40:59,167 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:40:59,167 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:40:59,167 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe1_6Err0EnsuresViolation======== [2018-01-21 10:40:59,167 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:40:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 10:40:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:40:59,168 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:40:59,169 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 10:40:59,169 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe1_6Err0EnsuresViolation]=== [2018-01-21 10:40:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1705793529, now seen corresponding path program 1 times [2018-01-21 10:40:59,169 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:40:59,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:59,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:40:59,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:40:59,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:40:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:40:59,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:40:59,218 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 10:40:59,218 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:40:59,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 10:40:59,219 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:40:59,219 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:40:59,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:40:59,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:40:59,220 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 6 states. [2018-01-21 10:40:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:40:59,237 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-01-21 10:40:59,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:40:59,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-21 10:40:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:40:59,238 INFO L225 Difference]: With dead ends: 59 [2018-01-21 10:40:59,239 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:40:59,239 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 10:40:59,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:40:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:40:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:40:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:40:59,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 10:40:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:40:59,241 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:40:59,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:40:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:40:59,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:40:59,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:40:59 BoogieIcfgContainer [2018-01-21 10:40:59,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:40:59,245 INFO L168 Benchmark]: Toolchain (without parser) took 2121.21 ms. Allocated memory was 302.5 MB in the beginning and 459.3 MB in the end (delta: 156.8 MB). Free memory was 259.8 MB in the beginning and 316.4 MB in the end (delta: -56.6 MB). Peak memory consumption was 100.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:59,246 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:40:59,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.20 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 246.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:59,247 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 ms. Allocated memory is still 302.5 MB. Free memory was 246.7 MB in the beginning and 244.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:59,248 INFO L168 Benchmark]: RCFGBuilder took 274.12 ms. Allocated memory is still 302.5 MB. Free memory was 244.7 MB in the beginning and 226.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:59,248 INFO L168 Benchmark]: TraceAbstraction took 1574.87 ms. Allocated memory was 302.5 MB in the beginning and 459.3 MB in the end (delta: 156.8 MB). Free memory was 226.0 MB in the beginning and 316.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 66.4 MB. Max. memory is 5.3 GB. [2018-01-21 10:40:59,250 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.22 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.20 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 246.7 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.95 ms. Allocated memory is still 302.5 MB. Free memory was 246.7 MB in the beginning and 244.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.12 ms. Allocated memory is still 302.5 MB. Free memory was 244.7 MB in the beginning and 226.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1574.87 ms. Allocated memory was 302.5 MB in the beginning and 459.3 MB in the end (delta: 156.8 MB). Free memory was 226.0 MB in the beginning and 316.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 66.4 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, 59 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.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.2s 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, 59 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=59occurred 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, 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}] [L1465] 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, 59 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=59occurred 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: 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_2_6Err0EnsuresViolation CFG has 9 procedures, 59 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=59occurred 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, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 1288 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: 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, 59 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=59occurred 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: 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, 59 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=59occurred 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: 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, 59 locations, 9 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 12 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=59occurred 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, 59 locations, 9 error locations. SAFE Result, 0.0s 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=59occurred 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, 59 locations, 9 error locations. SAFE Result, 0.0s 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=59occurred 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_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_10-40-59-264.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_3_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_10-40-59-264.csv Received shutdown request...