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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:40:18,227 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:40:18,228 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:40:18,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:40:18,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:40:18,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:40:18,245 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:40:18,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:40:18,249 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:40:18,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:40:18,250 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:40:18,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:40:18,252 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:40:18,253 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:40:18,254 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:40:18,256 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:40:18,258 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:40:18,260 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:40:18,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:40:18,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:40:18,265 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:40:18,265 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:40:18,265 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:40:18,266 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:40:18,267 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:40:18,268 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:40:18,268 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:40:18,269 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:40:18,269 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:40:18,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:40:18,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:40:18,270 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_mostprecise.epf [2018-01-24 20:40:18,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:40:18,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:40:18,279 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:40:18,279 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:40:18,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:40:18,279 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:40:18,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:40:18,280 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:40:18,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:40:18,280 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:40:18,280 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:40:18,280 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:40:18,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:40:18,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:40:18,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:40:18,282 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:40:18,282 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:40:18,282 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:40:18,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:40:18,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:40:18,283 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:40:18,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:40:18,284 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:40:18,284 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:40:18,284 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:40:18,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:40:18,326 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:40:18,329 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:40:18,330 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:40:18,331 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:40:18,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-24 20:40:18,500 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:40:18,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:40:18,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:40:18,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:40:18,511 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:40:18,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6356c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18, skipping insertion in model container [2018-01-24 20:40:18,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,525 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:40:18,570 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:40:18,681 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:40:18,698 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:40:18,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18 WrapperNode [2018-01-24 20:40:18,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:40:18,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:40:18,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:40:18,706 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:40:18,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (1/1) ... [2018-01-24 20:40:18,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:40:18,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:40:18,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:40:18,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:40:18,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (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-24 20:40:18,786 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:40:18,786 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:40:18,786 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:40:18,786 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:40:18,786 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:40:18,786 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:40:18,786 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:40:18,787 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:40:18,968 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:40:18,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:40:18 BoogieIcfgContainer [2018-01-24 20:40:18,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:40:18,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:40:18,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:40:18,971 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:40:18,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:40:18" (1/3) ... [2018-01-24 20:40:18,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9303d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:40:18, skipping insertion in model container [2018-01-24 20:40:18,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:40:18" (2/3) ... [2018-01-24 20:40:18,973 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9303d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:40:18, skipping insertion in model container [2018-01-24 20:40:18,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:40:18" (3/3) ... [2018-01-24 20:40:18,975 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-24 20:40:18,981 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:40:18,986 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 20:40:19,026 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:40:19,026 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:40:19,027 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:40:19,027 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:40:19,027 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:40:19,027 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:40:19,027 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:40:19,028 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:40:19,028 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:40:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 20:40:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:40:19,049 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:19,049 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:40:19,050 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-01-24 20:40:19,055 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:19,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:19,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,117 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:19,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:19,246 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-24 20:40:19,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:40:19,248 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:40:19,248 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:19,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:40:19,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:40:19,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:40:19,268 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 20:40:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:19,448 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-01-24 20:40:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:40:19,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 20:40:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:19,459 INFO L225 Difference]: With dead ends: 84 [2018-01-24 20:40:19,459 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 20:40:19,463 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-24 20:40:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 20:40:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-24 20:40:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:40:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-24 20:40:19,505 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-01-24 20:40:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:19,506 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-24 20:40:19,506 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:40:19,506 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-24 20:40:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:40:19,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:19,508 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-24 20:40:19,508 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-01-24 20:40:19,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:19,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:19,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:19,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:19,598 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-24 20:40:19,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:40:19,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:40:19,599 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:19,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:40:19,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:40:19,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:40:19,601 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-01-24 20:40:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:19,671 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-01-24 20:40:19,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:40:19,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 20:40:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:19,674 INFO L225 Difference]: With dead ends: 82 [2018-01-24 20:40:19,674 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 20:40:19,675 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-24 20:40:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 20:40:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-01-24 20:40:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:40:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 20:40:19,685 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-01-24 20:40:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:19,686 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 20:40:19,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:40:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 20:40:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 20:40:19,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:19,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:40:19,687 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-01-24 20:40:19,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:19,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:19,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,690 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:19,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:19,749 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-24 20:40:19,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:40:19,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:40:19,750 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:19,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:40:19,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:40:19,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:40:19,751 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-01-24 20:40:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:19,778 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-01-24 20:40:19,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:40:19,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 20:40:19,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:19,779 INFO L225 Difference]: With dead ends: 90 [2018-01-24 20:40:19,779 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 20:40:19,780 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:40:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 20:40:19,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-01-24 20:40:19,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 20:40:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-01-24 20:40:19,787 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-01-24 20:40:19,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:19,788 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-01-24 20:40:19,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:40:19,788 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-01-24 20:40:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 20:40:19,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:19,789 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:40:19,789 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-01-24 20:40:19,789 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:19,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:19,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:19,791 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:19,803 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 20:40:19,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:40:19,866 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:40:19,867 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-24 20:40:19,868 INFO L201 CegarAbsIntRunner]: [3], [9], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-24 20:40:19,910 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:40:19,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:40:20,041 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:40:20,042 INFO L268 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 17 variables. [2018-01-24 20:40:20,060 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:40:20,135 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 67.07% of their original sizes. [2018-01-24 20:40:20,135 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:40:20,178 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:40:20,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:40:20,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-24 20:40:20,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:20,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:40:20,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:40:20,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:40:20,180 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 7 states. [2018-01-24 20:40:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:24,148 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-24 20:40:24,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:40:24,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-24 20:40:24,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:24,149 INFO L225 Difference]: With dead ends: 91 [2018-01-24 20:40:24,149 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 20:40:24,150 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:40:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 20:40:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 20:40:24,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 20:40:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 20:40:24,158 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-01-24 20:40:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:24,158 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 20:40:24,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:40:24,159 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 20:40:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:40:24,160 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:24,160 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, 1, 1, 1] [2018-01-24 20:40:24,160 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:24,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-01-24 20:40:24,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:24,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:24,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:24,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:24,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:24,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 20:40:24,263 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:40:24,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:40:24,263 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:24,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:40:24,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:40:24,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:40:24,264 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-24 20:40:24,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:24,292 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 20:40:24,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:40:24,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 20:40:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:24,294 INFO L225 Difference]: With dead ends: 86 [2018-01-24 20:40:24,294 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 20:40:24,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:40:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 20:40:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-24 20:40:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 20:40:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 20:40:24,301 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-24 20:40:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:24,302 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 20:40:24,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:40:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 20:40:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:40:24,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:24,303 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:40:24,303 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-01-24 20:40:24,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:24,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:24,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:24,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:24,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:24,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:24,468 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:40:24,468 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:40:24,468 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:40:24,469 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-24 20:40:24,470 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:40:24,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:40:25,559 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:40:25,560 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:40:25,574 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:40:26,261 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-24 20:40:26,261 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:40:26,551 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:40:26,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:40:26,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-24 20:40:26,552 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:40:26,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:40:26,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:40:26,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=158, Unknown=3, NotChecked=0, Total=210 [2018-01-24 20:40:26,553 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 15 states. [2018-01-24 20:40:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:40:32,723 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2018-01-24 20:40:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 20:40:32,723 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 20:40:32,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:40:32,724 INFO L225 Difference]: With dead ends: 100 [2018-01-24 20:40:32,724 INFO L226 Difference]: Without dead ends: 81 [2018-01-24 20:40:32,725 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=292, Unknown=3, NotChecked=0, Total=380 [2018-01-24 20:40:32,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-24 20:40:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2018-01-24 20:40:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-24 20:40:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-24 20:40:32,735 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 28 [2018-01-24 20:40:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:40:32,735 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-24 20:40:32,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:40:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-24 20:40:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:40:32,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:40:32,737 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:40:32,737 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:40:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-01-24 20:40:32,737 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:40:32,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:32,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:32,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:40:32,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:40:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:32,757 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:40:32,962 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-24 20:40:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:33,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:40:33,159 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:40:33,160 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:40:33,160 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-24 20:40:33,161 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:40:33,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:40:33,727 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:40:33,727 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:40:33,732 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:40:33,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:40:33,733 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-24 20:40:33,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:33,739 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:40:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:33,774 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:40:33,835 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 23 treesize of output 22 [2018-01-24 20:40:33,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:33,856 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 26 treesize of output 25 [2018-01-24 20:40:33,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:33,858 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 22 treesize of output 21 [2018-01-24 20:40:33,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:33,880 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 25 treesize of output 24 [2018-01-24 20:40:33,880 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:33,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:40:33,895 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:40:34,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,141 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-24 20:40:34,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:34,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,210 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 20:40:34,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:34,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:34,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 20:40:34,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:34,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 20:40:34,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:34,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:40:34,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:40:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:34,467 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:40:35,704 WARN L146 SmtUtils]: Spent 1146ms on a formula simplification. DAG size of input: 46 DAG size of output 32 [2018-01-24 20:40:35,719 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 20:40:44,011 WARN L146 SmtUtils]: Spent 4097ms on a formula simplification. DAG size of input: 76 DAG size of output 29 [2018-01-24 20:40:44,026 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:40:44,748 WARN L146 SmtUtils]: Spent 607ms on a formula simplification. DAG size of input: 71 DAG size of output 38 [2018-01-24 20:40:44,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-24 20:40:44,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:44,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-01-24 20:40:45,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 20:40:45,013 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:45,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:40:45,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:40:45,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:45,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:40:45,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-24 20:40:45,481 WARN L143 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 40 [2018-01-24 20:40:48,041 WARN L143 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-24 20:40:48,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-01-24 20:40:48,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:48,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-01-24 20:40:48,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 20:40:48,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:48,180 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:40:48,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 20:40:48,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:48,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 20:40:48,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-24 20:40:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:48,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:40:48,975 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-24 20:40:48,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:40:48,979 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:40:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:40:49,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:40:49,019 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 23 treesize of output 22 [2018-01-24 20:40:49,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,021 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 26 treesize of output 25 [2018-01-24 20:40:49,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,039 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 25 treesize of output 24 [2018-01-24 20:40:49,039 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,053 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 22 treesize of output 21 [2018-01-24 20:40:49,053 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:40:49,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:40:49,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:49,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:49,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 20:40:49,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:49,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-01-24 20:40:49,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:49,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:40:49,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 20:40:49,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 20:40:49,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:49,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:40:49,437 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:40:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:49,511 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:40:50,457 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 20:41:04,768 WARN L146 SmtUtils]: Spent 8100ms on a formula simplification. DAG size of input: 76 DAG size of output 34 [2018-01-24 20:41:04,790 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-24 20:41:17,565 WARN L146 SmtUtils]: Spent 8050ms on a formula simplification. DAG size of input: 81 DAG size of output 71 [2018-01-24 20:41:17,571 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:41:17,582 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:41:17,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-01-24 20:41:17,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 20:41:17,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:41:17,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:41:17,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:41:17,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:41:17,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:41:17,780 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:41:17,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:41:17,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 Received shutdown request... [2018-01-24 20:41:17,816 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 20:41:17,816 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:41:17,821 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:41:17,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:41:17 BoogieIcfgContainer [2018-01-24 20:41:17,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:41:17,822 INFO L168 Benchmark]: Toolchain (without parser) took 59321.40 ms. Allocated memory was 303.0 MB in the beginning and 1.1 GB in the end (delta: 806.4 MB). Free memory was 260.3 MB in the beginning and 1.0 GB in the end (delta: -764.8 MB). Peak memory consumption was 41.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:41:17,823 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:41:17,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.62 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 247.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:41:17,823 INFO L168 Benchmark]: Boogie Preprocessor took 34.07 ms. Allocated memory is still 303.0 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:41:17,824 INFO L168 Benchmark]: RCFGBuilder took 228.84 ms. Allocated memory is still 303.0 MB. Free memory was 245.3 MB in the beginning and 228.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:41:17,824 INFO L168 Benchmark]: TraceAbstraction took 58851.66 ms. Allocated memory was 303.0 MB in the beginning and 1.1 GB in the end (delta: 806.4 MB). Free memory was 227.8 MB in the beginning and 1.0 GB in the end (delta: -797.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:41:17,825 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.62 ms. Allocated memory is still 303.0 MB. Free memory was 260.3 MB in the beginning and 247.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.07 ms. Allocated memory is still 303.0 MB. Free memory was 247.3 MB in the beginning and 245.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 228.84 ms. Allocated memory is still 303.0 MB. Free memory was 245.3 MB in the beginning and 228.8 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58851.66 ms. Allocated memory was 303.0 MB in the beginning and 1.1 GB in the end (delta: 806.4 MB). Free memory was 227.8 MB in the beginning and 1.0 GB in the end (delta: -797.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 13 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 61 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -26 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 26 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.835732 RENAME_VARIABLES(MILLISECONDS) : 0.204701 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.344674 PROJECTAWAY(MILLISECONDS) : 0.029549 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.936336 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.258419 ADD_EQUALITY(MILLISECONDS) : 0.042196 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.027810 #CONJOIN_DISJUNCTIVE : 21 #RENAME_VARIABLES : 43 #UNFREEZE : 0 #CONJOIN : 44 #PROJECTAWAY : 44 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 42 #ADD_EQUALITY : 26 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 134 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.202542 RENAME_VARIABLES(MILLISECONDS) : 0.080571 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.171132 PROJECTAWAY(MILLISECONDS) : 0.023247 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.069273 DISJOIN(MILLISECONDS) : 0.565933 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.103274 ADD_EQUALITY(MILLISECONDS) : 0.015671 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014274 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 76 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 143 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.200929 RENAME_VARIABLES(MILLISECONDS) : 0.049660 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.083480 PROJECTAWAY(MILLISECONDS) : 0.053873 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.062130 DISJOIN(MILLISECONDS) : 0.307994 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.061747 ADD_EQUALITY(MILLISECONDS) : 0.010834 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003626 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 29 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 58.8s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 286 SDtfs, 283 SDslu, 660 SDs, 0 SdLazy, 148 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.8817857142857142 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 3.62 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 83 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 8403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 10/14 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_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_20-41-17-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-41-17-839.csv Completed graceful shutdown