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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:34:03,300 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:34:03,303 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:34:03,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:34:03,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:34:03,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:34:03,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:34:03,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:34:03,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:34:03,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:34:03,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:34:03,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:34:03,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:34:03,328 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:34:03,329 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:34:03,332 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:34:03,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:34:03,336 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:34:03,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:34:03,338 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:34:03,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:34:03,341 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:34:03,341 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:34:03,342 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:34:03,343 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:34:03,344 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:34:03,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:34:03,345 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:34:03,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:34:03,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:34:03,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:34:03,347 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:34:03,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:34:03,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:34:03,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:34:03,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:34:03,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:34:03,358 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:34:03,359 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:34:03,359 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:34:03,359 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:34:03,360 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:34:03,360 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:34:03,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:34:03,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:34:03,361 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:34:03,361 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:34:03,361 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:34:03,361 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:34:03,361 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:34:03,362 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:34:03,362 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:34:03,362 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:34:03,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:34:03,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:34:03,363 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:34:03,363 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:34:03,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:34:03,363 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:34:03,363 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:34:03,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:34:03,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:34:03,364 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:34:03,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:34:03,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:34:03,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:34:03,365 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:34:03,366 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:34:03,366 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:34:03,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:34:03,415 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:34:03,420 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:34:03,422 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:34:03,422 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:34:03,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-25 03:34:03,659 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:34:03,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:34:03,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:34:03,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:34:03,671 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:34:03,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5209c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03, skipping insertion in model container [2018-01-25 03:34:03,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:34:03,740 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:34:03,855 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:34:03,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:34:03,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03 WrapperNode [2018-01-25 03:34:03,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:34:03,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:34:03,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:34:03,890 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:34:03,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (1/1) ... [2018-01-25 03:34:03,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:34:03,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:34:03,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:34:03,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:34:03,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (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-25 03:34:03,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:34:03,988 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:34:03,989 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:34:03,989 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-25 03:34:03,989 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 03:34:03,989 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:34:03,989 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:34:03,989 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:34:03,990 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:34:03,991 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:34:03,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:34:03,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:34:04,271 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:34:04,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:34:04 BoogieIcfgContainer [2018-01-25 03:34:04,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:34:04,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:34:04,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:34:04,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:34:04,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:34:03" (1/3) ... [2018-01-25 03:34:04,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bca7eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:34:04, skipping insertion in model container [2018-01-25 03:34:04,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:34:03" (2/3) ... [2018-01-25 03:34:04,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bca7eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:34:04, skipping insertion in model container [2018-01-25 03:34:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:34:04" (3/3) ... [2018-01-25 03:34:04,279 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_true-valid-memsafety_true-termination.i [2018-01-25 03:34:04,288 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:34:04,296 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 03:34:04,347 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:34:04,347 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:34:04,347 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:34:04,348 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:34:04,348 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:34:04,348 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:34:04,348 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:34:04,348 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:34:04,349 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:34:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-01-25 03:34:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:34:04,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:04,380 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:04,380 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:04,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1640721602, now seen corresponding path program 1 times [2018-01-25 03:34:04,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:04,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:04,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:04,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:04,441 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:04,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:04,685 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-25 03:34:04,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:34:04,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:34:04,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:34:04,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:34:04,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:34:04,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:34:04,767 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-01-25 03:34:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:04,856 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2018-01-25 03:34:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:34:04,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:34:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:04,872 INFO L225 Difference]: With dead ends: 148 [2018-01-25 03:34:04,872 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 03:34:04,877 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:34:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 03:34:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-01-25 03:34:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 03:34:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-01-25 03:34:04,929 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 17 [2018-01-25 03:34:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:04,930 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-01-25 03:34:04,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:34:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-01-25 03:34:04,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:34:04,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:04,932 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:04,933 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1639954210, now seen corresponding path program 1 times [2018-01-25 03:34:04,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:04,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:04,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:04,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:04,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:04,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:04,998 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-25 03:34:04,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:34:04,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:34:04,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:34:05,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:34:05,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:34:05,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:34:05,002 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 3 states. [2018-01-25 03:34:05,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:05,093 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2018-01-25 03:34:05,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:34:05,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 03:34:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:05,096 INFO L225 Difference]: With dead ends: 113 [2018-01-25 03:34:05,096 INFO L226 Difference]: Without dead ends: 107 [2018-01-25 03:34:05,097 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-25 03:34:05,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-25 03:34:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 75. [2018-01-25 03:34:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-25 03:34:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-25 03:34:05,109 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 17 [2018-01-25 03:34:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:05,109 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-25 03:34:05,109 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:34:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-25 03:34:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:34:05,110 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:05,110 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:05,110 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash 202381920, now seen corresponding path program 1 times [2018-01-25 03:34:05,111 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:05,112 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:05,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:05,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:05,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:05,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:05,185 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-25 03:34:05,186 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:34:05,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:34:05,186 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:34:05,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:34:05,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:34:05,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:34:05,187 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 6 states. [2018-01-25 03:34:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:05,357 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-01-25 03:34:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:34:05,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:34:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:05,359 INFO L225 Difference]: With dead ends: 77 [2018-01-25 03:34:05,359 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 03:34:05,359 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:34:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 03:34:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-01-25 03:34:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-25 03:34:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-25 03:34:05,369 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 19 [2018-01-25 03:34:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:05,369 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-25 03:34:05,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:34:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-25 03:34:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:34:05,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:05,371 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:05,371 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash 202381921, now seen corresponding path program 1 times [2018-01-25 03:34:05,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:05,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:05,373 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:05,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:05,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:05,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:05,710 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-25 03:34:05,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:34:05,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:34:05,710 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:34:05,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:34:05,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:34:05,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:34:05,712 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-01-25 03:34:05,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:05,995 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2018-01-25 03:34:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 03:34:05,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 03:34:05,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:05,996 INFO L225 Difference]: With dead ends: 140 [2018-01-25 03:34:05,996 INFO L226 Difference]: Without dead ends: 80 [2018-01-25 03:34:05,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 03:34:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-25 03:34:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-01-25 03:34:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 03:34:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-01-25 03:34:06,004 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 19 [2018-01-25 03:34:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:06,005 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-01-25 03:34:06,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:34:06,005 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-01-25 03:34:06,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:34:06,006 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:06,006 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:06,006 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash 203149312, now seen corresponding path program 1 times [2018-01-25 03:34:06,006 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:06,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:06,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:06,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:06,008 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:06,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:06,081 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-25 03:34:06,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:34:06,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:34:06,081 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:34:06,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:34:06,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:34:06,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:34:06,082 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 6 states. [2018-01-25 03:34:06,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:06,130 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-25 03:34:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:34:06,132 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 03:34:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:06,133 INFO L225 Difference]: With dead ends: 81 [2018-01-25 03:34:06,133 INFO L226 Difference]: Without dead ends: 77 [2018-01-25 03:34:06,134 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:34:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-25 03:34:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-25 03:34:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-25 03:34:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-01-25 03:34:06,143 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 19 [2018-01-25 03:34:06,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:06,143 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-01-25 03:34:06,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:34:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-01-25 03:34:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:34:06,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:06,144 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:06,144 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:06,145 INFO L82 PathProgramCache]: Analyzing trace with hash -136195976, now seen corresponding path program 1 times [2018-01-25 03:34:06,145 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:06,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:06,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:06,147 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:06,147 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:06,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:06,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:34:06,558 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:34:06,559 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 03:34:06,561 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [92], [94], [97], [101], [106], [107], [109], [111], [125], [129], [130], [131], [133], [134] [2018-01-25 03:34:06,605 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:34:06,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:34:25,629 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:34:25,631 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 03:34:25,651 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:34:25,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:34:25,651 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:34:25,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:25,658 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:34:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:25,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:34:25,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 03:34:25,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:25,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 03:34:25,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:25,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:34:25,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:34:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:26,153 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:34:26,952 WARN L146 SmtUtils]: Spent 298ms on a formula simplification. DAG size of input: 52 DAG size of output 27 [2018-01-25 03:34:26,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:27,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:34:27,032 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:34:27,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:27,054 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:34:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:27,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:34:27,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 03:34:27,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:27,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 03:34:27,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:27,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:34:27,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:34:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:27,335 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:34:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:28,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:34:28,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 31 [2018-01-25 03:34:28,097 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:34:28,098 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:34:28,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:34:28,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-25 03:34:28,099 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 18 states. [2018-01-25 03:34:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:34:28,644 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2018-01-25 03:34:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:34:28,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2018-01-25 03:34:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:34:28,645 INFO L225 Difference]: With dead ends: 142 [2018-01-25 03:34:28,645 INFO L226 Difference]: Without dead ends: 82 [2018-01-25 03:34:28,646 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 03:34:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-25 03:34:28,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-01-25 03:34:28,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-25 03:34:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-25 03:34:28,653 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2018-01-25 03:34:28,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:34:28,653 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-25 03:34:28,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:34:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-25 03:34:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:34:28,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:34:28,654 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:34:28,654 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_17Err4RequiresViolation, alloc_17Err6RequiresViolation, alloc_17Err2RequiresViolation, alloc_17Err0RequiresViolation, alloc_17Err1RequiresViolation, alloc_17Err7RequiresViolation, alloc_17Err3RequiresViolation, alloc_17Err5RequiresViolation, mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 03:34:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1725127921, now seen corresponding path program 2 times [2018-01-25 03:34:28,654 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:34:28,655 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:28,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:34:28,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:34:28,656 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:34:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:34:28,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:34:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:29,116 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:34:29,116 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:34:29,116 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:34:29,117 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:34:29,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:34:29,117 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:34:29,123 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:34:29,123 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:34:29,134 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:34:29,139 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:34:29,140 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:34:29,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:34:29,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-25 03:34:29,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:29,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-25 03:34:29,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 03:34:29,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 03:34:29,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 03:34:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:34:29,470 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:34:30,111 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-01-25 03:34:33,344 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 296256 conjuctions. This might take some time... Received shutdown request... [2018-01-25 03:35:03,758 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:35:03,759 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:35:03,763 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:35:03,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:35:03 BoogieIcfgContainer [2018-01-25 03:35:03,763 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:35:03,764 INFO L168 Benchmark]: Toolchain (without parser) took 60104.74 ms. Allocated memory was 306.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 263.5 MB in the beginning and 692.2 MB in the end (delta: -428.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-25 03:35:03,765 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 306.2 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:35:03,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.06 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 249.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:35:03,765 INFO L168 Benchmark]: Boogie Preprocessor took 33.32 ms. Allocated memory is still 306.2 MB. Free memory was 249.5 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:35:03,766 INFO L168 Benchmark]: RCFGBuilder took 349.12 ms. Allocated memory is still 306.2 MB. Free memory was 247.6 MB in the beginning and 224.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-25 03:35:03,766 INFO L168 Benchmark]: TraceAbstraction took 59490.43 ms. Allocated memory was 306.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 224.9 MB in the beginning and 692.2 MB in the end (delta: -467.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-25 03:35:03,768 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.23 ms. Allocated memory is still 306.2 MB. Free memory is still 269.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.06 ms. Allocated memory is still 306.2 MB. Free memory was 263.5 MB in the beginning and 249.5 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.32 ms. Allocated memory is still 306.2 MB. Free memory was 249.5 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.12 ms. Allocated memory is still 306.2 MB. Free memory was 247.6 MB in the beginning and 224.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59490.43 ms. Allocated memory was 306.2 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 224.9 MB in the beginning and 692.2 MB in the end (delta: -467.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 126 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.474960 RENAME_VARIABLES(MILLISECONDS) : 1.119489 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.398188 PROJECTAWAY(MILLISECONDS) : 3.206164 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.080460 DISJOIN(MILLISECONDS) : 1.569201 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.254433 ADD_EQUALITY(MILLISECONDS) : 0.029934 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.006698 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1478]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1478). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 2 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 296256 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 17 error locations. TIMEOUT Result, 59.4s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 432 SDtfs, 142 SDslu, 1566 SDs, 0 SdLazy, 507 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 19.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 196 ConstructedInterpolants, 28 QuantifiedInterpolants, 56312 SizeOfPredicates, 10 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 0/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-35-03-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-35-03-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-35-03-779.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-35-03-779.csv Completed graceful shutdown