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/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:20:43,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:20:43,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:20:43,192 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:20:43,192 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:20:43,193 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:20:43,194 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:20:43,196 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:20:43,198 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:20:43,198 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:20:43,199 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:20:43,199 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:20:43,200 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:20:43,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:20:43,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:20:43,205 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:20:43,207 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:20:43,209 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:20:43,210 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:20:43,211 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:20:43,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:20:43,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:20:43,213 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:20:43,214 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:20:43,215 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:20:43,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:20:43,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:20:43,217 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:20:43,217 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:20:43,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:20:43,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:20:43,218 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:20:43,227 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:20:43,227 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:20:43,228 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:20:43,228 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:20:43,229 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:20:43,229 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:20:43,229 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:20:43,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:20:43,230 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:20:43,231 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:20:43,231 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:20:43,231 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:20:43,231 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:20:43,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:20:43,232 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:20:43,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:20:43,232 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:20:43,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:20:43,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:20:43,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:20:43,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:20:43,234 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:20:43,234 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:20:43,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:20:43,277 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:20:43,280 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:20:43,282 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:20:43,283 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:20:43,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-30 00:20:43,438 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:20:43,446 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:20:43,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:43,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:20:43,454 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:20:43,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715ee194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43, skipping insertion in model container [2018-01-30 00:20:43,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,470 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:43,516 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:43,622 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:43,635 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:43,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43 WrapperNode [2018-01-30 00:20:43,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:43,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:20:43,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:20:43,641 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:20:43,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (1/1) ... [2018-01-30 00:20:43,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:20:43,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:20:43,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:20:43,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:20:43,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (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-30 00:20:43,716 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:20:43,716 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:20:43,716 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:20:43,716 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-01-30 00:20:43,716 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-01-30 00:20:43,717 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:20:43,717 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:20:43,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:20:43,717 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:20:43,717 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:20:43,717 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-01-30 00:20:43,718 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:20:43,719 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:20:43,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:20:43,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:20:43,857 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:20:43,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:43 BoogieIcfgContainer [2018-01-30 00:20:43,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:20:43,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:20:43,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:20:43,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:20:43,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:20:43" (1/3) ... [2018-01-30 00:20:43,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17144e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:43, skipping insertion in model container [2018-01-30 00:20:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:43" (2/3) ... [2018-01-30 00:20:43,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c17144e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:43, skipping insertion in model container [2018-01-30 00:20:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:43" (3/3) ... [2018-01-30 00:20:43,864 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-30 00:20:43,870 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:20:43,875 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-30 00:20:43,914 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:20:43,914 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:20:43,914 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:20:43,914 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:20:43,914 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:20:43,914 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:20:43,914 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:20:43,914 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:20:43,915 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:20:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-01-30 00:20:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 00:20:43,939 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:43,940 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:43,940 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:43,945 INFO L82 PathProgramCache]: Analyzing trace with hash -356237435, now seen corresponding path program 1 times [2018-01-30 00:20:43,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:43,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:44,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:44,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:44,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:44,234 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-30 00:20:44,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:44,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:44,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:44,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:44,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:44,258 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 5 states. [2018-01-30 00:20:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:44,405 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-01-30 00:20:44,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:20:44,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-30 00:20:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:44,414 INFO L225 Difference]: With dead ends: 82 [2018-01-30 00:20:44,414 INFO L226 Difference]: Without dead ends: 58 [2018-01-30 00:20:44,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-30 00:20:44,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-01-30 00:20:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-30 00:20:44,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-30 00:20:44,449 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 29 [2018-01-30 00:20:44,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:44,449 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-30 00:20:44,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-30 00:20:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:20:44,450 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:44,451 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:44,451 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1328254661, now seen corresponding path program 1 times [2018-01-30 00:20:44,451 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:44,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:44,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:44,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:44,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:44,547 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:44,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:44,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:44,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:44,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:44,550 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 6 states. [2018-01-30 00:20:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:44,634 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-30 00:20:44,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:44,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 00:20:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:44,638 INFO L225 Difference]: With dead ends: 57 [2018-01-30 00:20:44,638 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 00:20:44,639 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:20:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 00:20:44,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-30 00:20:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-30 00:20:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-01-30 00:20:44,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 30 [2018-01-30 00:20:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:44,649 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-01-30 00:20:44,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-01-30 00:20:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-30 00:20:44,651 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:44,651 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:44,651 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:44,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1328254660, now seen corresponding path program 1 times [2018-01-30 00:20:44,652 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:44,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:44,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,653 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:44,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:44,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:44,741 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-30 00:20:44,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:44,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:44,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:44,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:44,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:44,743 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-01-30 00:20:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:44,842 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-01-30 00:20:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:44,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-30 00:20:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:44,845 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:20:44,845 INFO L226 Difference]: Without dead ends: 65 [2018-01-30 00:20:44,845 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-30 00:20:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2018-01-30 00:20:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 00:20:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-01-30 00:20:44,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 30 [2018-01-30 00:20:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:44,859 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-01-30 00:20:44,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-01-30 00:20:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-30 00:20:44,860 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:44,860 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:44,860 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash -2080235026, now seen corresponding path program 1 times [2018-01-30 00:20:44,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:44,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:44,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:44,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:44,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:44,924 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-30 00:20:44,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:44,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:20:44,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:20:44,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:20:44,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:44,925 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 3 states. [2018-01-30 00:20:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:44,962 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-01-30 00:20:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:20:44,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-01-30 00:20:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:44,964 INFO L225 Difference]: With dead ends: 58 [2018-01-30 00:20:44,964 INFO L226 Difference]: Without dead ends: 53 [2018-01-30 00:20:44,964 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-30 00:20:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-01-30 00:20:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-30 00:20:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-30 00:20:44,972 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 31 [2018-01-30 00:20:44,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:44,972 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-30 00:20:44,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:20:44,972 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-30 00:20:44,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:20:44,973 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:44,973 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:44,973 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:44,973 INFO L82 PathProgramCache]: Analyzing trace with hash -845148700, now seen corresponding path program 1 times [2018-01-30 00:20:44,973 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:44,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:44,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:44,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:44,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:45,039 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-30 00:20:45,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:45,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:20:45,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:20:45,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:20:45,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:20:45,040 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 5 states. [2018-01-30 00:20:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:45,066 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-01-30 00:20:45,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:20:45,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-30 00:20:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:45,068 INFO L225 Difference]: With dead ends: 66 [2018-01-30 00:20:45,068 INFO L226 Difference]: Without dead ends: 61 [2018-01-30 00:20:45,069 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:45,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-30 00:20:45,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2018-01-30 00:20:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-30 00:20:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-01-30 00:20:45,077 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 32 [2018-01-30 00:20:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:45,077 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-01-30 00:20:45,077 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:20:45,078 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-01-30 00:20:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:20:45,079 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:45,079 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:45,079 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 114081316, now seen corresponding path program 1 times [2018-01-30 00:20:45,080 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:45,080 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:45,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,081 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:45,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:45,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:45,133 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-30 00:20:45,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:45,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:45,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:20:45,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:20:45,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:20:45,134 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 6 states. [2018-01-30 00:20:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:45,213 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-01-30 00:20:45,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:20:45,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-30 00:20:45,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:45,215 INFO L225 Difference]: With dead ends: 72 [2018-01-30 00:20:45,215 INFO L226 Difference]: Without dead ends: 56 [2018-01-30 00:20:45,215 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:45,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-30 00:20:45,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2018-01-30 00:20:45,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-30 00:20:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-30 00:20:45,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 32 [2018-01-30 00:20:45,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:45,223 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-30 00:20:45,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:20:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-30 00:20:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-30 00:20:45,224 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:45,225 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:45,225 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:45,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2093714359, now seen corresponding path program 1 times [2018-01-30 00:20:45,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:45,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:45,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:45,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:45,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:45,312 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-30 00:20:45,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:45,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:45,313 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:45,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:45,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:45,314 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 7 states. [2018-01-30 00:20:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:45,424 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2018-01-30 00:20:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:20:45,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-01-30 00:20:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:45,429 INFO L225 Difference]: With dead ends: 60 [2018-01-30 00:20:45,429 INFO L226 Difference]: Without dead ends: 37 [2018-01-30 00:20:45,430 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:45,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-30 00:20:45,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-30 00:20:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-30 00:20:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2018-01-30 00:20:45,434 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 35 [2018-01-30 00:20:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:45,434 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2018-01-30 00:20:45,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2018-01-30 00:20:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-30 00:20:45,435 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:45,435 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:45,435 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-30 00:20:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1284541121, now seen corresponding path program 1 times [2018-01-30 00:20:45,436 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:45,436 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:45,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,437 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:45,437 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:45,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:45,633 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-30 00:20:45,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:45,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:45,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:45,634 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:45,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:45,634 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 8 states. [2018-01-30 00:20:45,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:45,884 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2018-01-30 00:20:45,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:20:45,885 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-01-30 00:20:45,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:45,885 INFO L225 Difference]: With dead ends: 37 [2018-01-30 00:20:45,885 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:20:45,886 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:20:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:20:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:20:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:20:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:20:45,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2018-01-30 00:20:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:45,886 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:20:45,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:20:45,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:20:45,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:20:45,922 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 00:20:46,128 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= ~a9.offset 0)) (not (= 0 ~a9.base)) (= |#valid| |old(#valid)|)) [2018-01-30 00:20:46,128 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:46,128 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:46,128 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:46,128 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1458) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,129 INFO L399 ceAbstractionStarter]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L395 ceAbstractionStarter]: At program point probe_9ENTRY(lines 1436 1442) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point probe_9FINAL(lines 1436 1442) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point L1437'(line 1437) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point probe_9EXIT(lines 1436 1442) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1458) the Hoare annotation is: true [2018-01-30 00:20:46,130 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,130 INFO L395 ceAbstractionStarter]: At program point L1(lines 1 1458) the Hoare annotation is: (and (= ~a9.base 0) (= ~a9.offset 0)) [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1456 1458) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1456 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1456 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1456 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point L1450'(lines 1450 1452) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point L1449'(line 1449) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1448 1454) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point L1450(lines 1450 1452) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L395 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: (let ((.cse1 (select |#valid| ~a9.base)) (.cse2 (= ~a9.base 0))) (let ((.cse0 (and (= entry_point_~ret~9 0) (let ((.cse3 (= ~a9.offset 0))) (or (and (= 1 .cse1) .cse3) (and .cse2 .cse3)))))) (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (not (= 0 ~a9.base)) .cse0 (= |#valid| (store |old(#valid)| ~a9.base .cse1)) (= (select |old(#valid)| ~a9.base) 0)) (and .cse0 (= |#valid| |old(#valid)|) .cse2)))) [2018-01-30 00:20:46,131 INFO L399 ceAbstractionStarter]: For program point L1449(line 1449) no Hoare annotation was computed. [2018-01-30 00:20:46,131 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1448 1454) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1448 1454) no Hoare annotation was computed. [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point L1449''(line 1449) no Hoare annotation was computed. [2018-01-30 00:20:46,132 INFO L395 ceAbstractionStarter]: At program point disconnect_9ENTRY(lines 1444 1446) the Hoare annotation is: (or (let ((.cse0 (not (= ~a9.offset 0)))) (and (or .cse0 (not (= 0 ~a9.base))) (or .cse0 (not (= 1 (select |old(#valid)| ~a9.base)))))) (= |#valid| |old(#valid)|)) [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point disconnect_9EXIT(lines 1444 1446) no Hoare annotation was computed. [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point disconnect_9FINAL(lines 1444 1446) no Hoare annotation was computed. [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point disconnect_9Err0RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,132 INFO L399 ceAbstractionStarter]: For program point disconnect_9Err1RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-30 00:20:46,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:20:46 BoogieIcfgContainer [2018-01-30 00:20:46,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:20:46,135 INFO L168 Benchmark]: Toolchain (without parser) took 2696.37 ms. Allocated memory was 305.1 MB in the beginning and 474.5 MB in the end (delta: 169.3 MB). Free memory was 264.2 MB in the beginning and 352.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 81.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:46,136 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:46,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.11 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:46,137 INFO L168 Benchmark]: Boogie Preprocessor took 28.34 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 250.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-30 00:20:46,137 INFO L168 Benchmark]: RCFGBuilder took 188.81 ms. Allocated memory is still 305.1 MB. Free memory was 249.2 MB in the beginning and 234.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:46,137 INFO L168 Benchmark]: TraceAbstraction took 2276.04 ms. Allocated memory was 305.1 MB in the beginning and 474.5 MB in the end (delta: 169.3 MB). Free memory was 234.6 MB in the beginning and 352.2 MB in the end (delta: -117.6 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:46,139 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.11 ms. Allocated memory is still 305.1 MB. Free memory is still 271.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 193.11 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.2 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.34 ms. Allocated memory is still 305.1 MB. Free memory was 251.2 MB in the beginning and 250.2 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 188.81 ms. Allocated memory is still 305.1 MB. Free memory was 249.2 MB in the beginning and 234.6 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2276.04 ms. Allocated memory was 305.1 MB in the beginning and 474.5 MB in the end (delta: 169.3 MB). Free memory was 234.6 MB in the beginning and 352.2 MB in the end (delta: -117.6 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1456]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 45 locations, 3 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 334 SDtfs, 121 SDslu, 874 SDs, 0 SdLazy, 295 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 14 NumberOfFragments, 181 HoareAnnotationTreeSize, 12 FomulaSimplifications, 275 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 27931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-20-46-145.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-20-46-145.csv Received shutdown request...