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_RubberTaipan+AI_EQ.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 13:26:15,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:26:15,256 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:26:15,268 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:26:15,268 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:26:15,269 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:26:15,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:26:15,272 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:26:15,273 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:26:15,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:26:15,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:26:15,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:26:15,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:26:15,276 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:26:15,277 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:26:15,280 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:26:15,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:26:15,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:26:15,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:26:15,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:26:15,289 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:26:15,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:26:15,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:26:15,290 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:26:15,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:26:15,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:26:15,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:26:15,293 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:26:15,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:26:15,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:26:15,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:26:15,295 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:26:15,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:26:15,305 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:26:15,305 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:26:15,306 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:26:15,306 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:26:15,306 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:26:15,306 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:26:15,307 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:26:15,307 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:26:15,307 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:26:15,308 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:26:15,308 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:26:15,308 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:26:15,308 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:26:15,308 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:26:15,309 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:26:15,309 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:26:15,309 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:26:15,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:26:15,309 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:26:15,310 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:26:15,310 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:26:15,310 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:26:15,310 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:26:15,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:26:15,311 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:26:15,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:26:15,311 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:26:15,311 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:26:15,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:26:15,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:26:15,312 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:26:15,313 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:26:15,313 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:26:15,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:26:15,362 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:26:15,366 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:26:15,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:26:15,368 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:26:15,369 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 13:26:15,548 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:26:15,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:26:15,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:26:15,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:26:15,560 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:26:15,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2871eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15, skipping insertion in model container [2018-01-24 13:26:15,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,583 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:26:15,636 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:26:15,742 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:26:15,764 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:26:15,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15 WrapperNode [2018-01-24 13:26:15,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:26:15,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:26:15,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:26:15,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:26:15,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (1/1) ... [2018-01-24 13:26:15,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:26:15,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:26:15,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:26:15,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:26:15,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (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 13:26:15,861 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:26:15,862 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:26:15,862 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:26:15,862 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:26:15,862 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:26:15,862 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:26:15,862 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:26:15,863 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:26:15,864 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:26:15,864 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:26:15,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:26:15,864 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:26:16,071 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:26:16,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:26:16 BoogieIcfgContainer [2018-01-24 13:26:16,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:26:16,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:26:16,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:26:16,074 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:26:16,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:26:15" (1/3) ... [2018-01-24 13:26:16,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95daad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:26:16, skipping insertion in model container [2018-01-24 13:26:16,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:26:15" (2/3) ... [2018-01-24 13:26:16,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f95daad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:26:16, skipping insertion in model container [2018-01-24 13:26:16,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:26:16" (3/3) ... [2018-01-24 13:26:16,077 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-24 13:26:16,084 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:26:16,089 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-24 13:26:16,134 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:26:16,134 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:26:16,134 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:26:16,134 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:26:16,134 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:26:16,134 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:26:16,135 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:26:16,135 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:26:16,136 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:26:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-24 13:26:16,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:26:16,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:16,157 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 13:26:16,157 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 13:26:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-01-24 13:26:16,163 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:16,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,209 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:16,209 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,209 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:16,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:16,349 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 13:26:16,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:26:16,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:26:16,351 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:26:16,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:26:16,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:26:16,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:26:16,366 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-24 13:26:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:16,544 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-01-24 13:26:16,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:26:16,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 13:26:16,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:16,559 INFO L225 Difference]: With dead ends: 84 [2018-01-24 13:26:16,559 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 13:26:16,563 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 13:26:16,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 13:26:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-24 13:26:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 13:26:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-24 13:26:16,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-01-24 13:26:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:16,611 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-24 13:26:16,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:26:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-24 13:26:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:26:16,613 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:16,614 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 13:26:16,614 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 13:26:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-01-24 13:26:16,614 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:16,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:16,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,617 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:16,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:16,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:16,712 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:26:16,712 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:26:16,712 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:26:16,714 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:26:16,714 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:26:16,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:26:16,715 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-01-24 13:26:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:16,807 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-01-24 13:26:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:26:16,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 13:26:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:16,809 INFO L225 Difference]: With dead ends: 82 [2018-01-24 13:26:16,809 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 13:26:16,810 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 13:26:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 13:26:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-01-24 13:26:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 13:26:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-24 13:26:16,819 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-01-24 13:26:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:16,820 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-24 13:26:16,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:26:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-24 13:26:16,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:26:16,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:16,821 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 13:26:16,822 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 13:26:16,822 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-01-24 13:26:16,822 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:16,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:16,824 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,824 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:16,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:16,882 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 13:26:16,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:26:16,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:26:16,882 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:26:16,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:26:16,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:26:16,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:26:16,883 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-01-24 13:26:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:16,912 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-01-24 13:26:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:26:16,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 13:26:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:16,913 INFO L225 Difference]: With dead ends: 90 [2018-01-24 13:26:16,914 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 13:26:16,914 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 13:26:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 13:26:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-01-24 13:26:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:26:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-01-24 13:26:16,921 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-01-24 13:26:16,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:16,921 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-01-24 13:26:16,922 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:26:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-01-24 13:26:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:26:16,923 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:16,923 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 13:26:16,923 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 13:26:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-01-24 13:26:16,923 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:16,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:16,925 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:16,925 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:16,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:16,985 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 13:26:16,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:26:16,986 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 13:26:16,995 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:16,995 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:26:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:17,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:26:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:17,058 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:26:17,108 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 13:26:17,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:26:17,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 5 [2018-01-24 13:26:17,131 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:26:17,132 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:26:17,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:26:17,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:26:17,132 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 5 states. [2018-01-24 13:26:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:17,168 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-24 13:26:17,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:26:17,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 13:26:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:17,169 INFO L225 Difference]: With dead ends: 91 [2018-01-24 13:26:17,169 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 13:26:17,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 4 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 13:26:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 13:26:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 13:26:17,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 13:26:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 13:26:17,175 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-01-24 13:26:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:17,175 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 13:26:17,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:26:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 13:26:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:26:17,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:17,176 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 13:26:17,176 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 13:26:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-01-24 13:26:17,176 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:17,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:17,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:17,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:17,178 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:17,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:17,242 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 13:26:17,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:26:17,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:26:17,243 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:26:17,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:26:17,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:26:17,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:26:17,244 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-24 13:26:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:17,274 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-24 13:26:17,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:26:17,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 13:26:17,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:17,276 INFO L225 Difference]: With dead ends: 86 [2018-01-24 13:26:17,276 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 13:26:17,276 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 13:26:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 13:26:17,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-24 13:26:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 13:26:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 13:26:17,284 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-24 13:26:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:17,285 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 13:26:17,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:26:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 13:26:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:26:17,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:17,286 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 13:26:17,286 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 13:26:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-01-24 13:26:17,287 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:17,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:17,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:17,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:17,289 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:17,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:17,455 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 13:26:17,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:26:17,455 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:26:17,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:17,465 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:26:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:17,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:26:17,515 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 6 treesize of output 5 [2018-01-24 13:26:17,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:26:17,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:17,570 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:17,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 13:26:17,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:26:17,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 13:26:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:17,598 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:26:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:17,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:26:17,892 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 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 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:26:17,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:17,896 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:26:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:17,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:26:17,936 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 6 treesize of output 5 [2018-01-24 13:26:17,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:26:17,949 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:17,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:17,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-01-24 13:26:17,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:17,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:26:17,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 13:26:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:17,963 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:26:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:26:18,095 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:26:18,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 16 [2018-01-24 13:26:18,096 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:26:18,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:26:18,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:26:18,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:26:18,097 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 11 states. [2018-01-24 13:26:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:26:18,355 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-01-24 13:26:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:26:18,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-01-24 13:26:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:26:18,356 INFO L225 Difference]: With dead ends: 75 [2018-01-24 13:26:18,356 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 13:26:18,357 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:26:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 13:26:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-01-24 13:26:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 13:26:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-01-24 13:26:18,364 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 28 [2018-01-24 13:26:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:26:18,365 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-01-24 13:26:18,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:26:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-01-24 13:26:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:26:18,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:26:18,366 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 13:26:18,366 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 13:26:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-01-24 13:26:18,366 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:26:18,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:18,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:18,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:26:18,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:26:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:18,384 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:26:18,803 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 13:26:18,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:26:18,804 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:26:18,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:18,811 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:26:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:18,834 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:26:18,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 23 treesize of output 22 [2018-01-24 13:26:18,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:18,882 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 13:26:18,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:18,905 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 13:26:18,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:18,921 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 13:26:18,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:18,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:26:18,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 13:26:19,239 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,241 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,242 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 52 treesize of output 46 [2018-01-24 13:26:19,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:19,282 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 13:26:19,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:19,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,324 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 47 treesize of output 60 [2018-01-24 13:26:19,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:19,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,370 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:19,370 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 13:26:19,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:19,402 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 13:26:19,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 13:26:19,480 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 13:26:19,480 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:26:19,609 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 13:26:30,148 WARN L146 SmtUtils]: Spent 8399ms on a formula simplification. DAG size of input: 84 DAG size of output 36 [2018-01-24 13:26:30,181 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-24 13:26:32,955 WARN L146 SmtUtils]: Spent 2644ms on a formula simplification. DAG size of input: 84 DAG size of output 41 [2018-01-24 13:26:33,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 34 treesize of output 37 [2018-01-24 13:26:33,168 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 13:26:33,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:33,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:33,211 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 13:26:33,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:33,227 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 13:26:33,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:33,243 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 13:26:33,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 13:26:37,918 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 52 treesize of output 55 [2018-01-24 13:26:37,949 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 13:26:37,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:37,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:37,991 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 13:26:37,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,023 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 13:26:38,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,048 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 13:26:38,048 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 13:26:38,759 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 13:26:38,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:26:38,779 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 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 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:26:38,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:26:38,783 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:26:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:26:38,818 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:26:38,842 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 13:26:38,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,895 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 13:26:38,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,897 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 13:26:38,897 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,915 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 13:26:38,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:38,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:26:38,929 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 13:26:39,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,005 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 52 treesize of output 55 [2018-01-24 13:26:39,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:39,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,062 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,062 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 47 treesize of output 60 [2018-01-24 13:26:39,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:39,119 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,121 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 44 treesize of output 38 [2018-01-24 13:26:39,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:39,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,166 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:26:39,167 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 13:26:39,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:39,212 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 13:26:39,212 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 13:26:39,279 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 13:26:39,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:26:39,357 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 13:26:39,602 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 13:26:39,614 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-24 13:26:51,905 WARN L146 SmtUtils]: Spent 8073ms on a formula simplification. DAG size of input: 83 DAG size of output 73 [2018-01-24 13:26:51,910 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 13:26:51,917 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 13:26:52,084 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 34 treesize of output 28 [2018-01-24 13:26:52,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:52,104 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 13:26:52,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:52,122 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 28 treesize of output 31 [2018-01-24 13:26:52,143 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 13:26:52,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:52,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:52,164 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 13:26:52,164 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 13:26:55,086 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 13:26:55,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:55,112 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 52 treesize of output 46 [2018-01-24 13:26:55,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:55,136 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 46 treesize of output 49 [2018-01-24 13:26:55,177 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 13:26:55,177 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:26:55,187 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:26:55,209 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 13:26:55,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 13:26:56,109 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 13:26:56,111 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:26:56,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 28 [2018-01-24 13:26:56,111 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:26:56,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 13:26:56,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 13:26:56,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=725, Unknown=7, NotChecked=0, Total=812 [2018-01-24 13:26:56,112 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-01-24 13:26:56,547 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-24 13:27:33,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 13:27:33,270 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 13:27:33,275 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 13:27:33,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:27:33 BoogieIcfgContainer [2018-01-24 13:27:33,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:27:33,277 INFO L168 Benchmark]: Toolchain (without parser) took 77728.09 ms. Allocated memory was 305.1 MB in the beginning and 553.1 MB in the end (delta: 248.0 MB). Free memory was 264.2 MB in the beginning and 480.1 MB in the end (delta: -215.9 MB). Peak memory consumption was 32.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:27:33,278 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:27:33,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.03 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:27:33,278 INFO L168 Benchmark]: Boogie Preprocessor took 32.37 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:27:33,278 INFO L168 Benchmark]: RCFGBuilder took 266.36 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 232.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:27:33,278 INFO L168 Benchmark]: TraceAbstraction took 77203.57 ms. Allocated memory was 305.1 MB in the beginning and 553.1 MB in the end (delta: 248.0 MB). Free memory was 232.3 MB in the beginning and 480.1 MB in the end (delta: -247.8 MB). Peak memory consumption was 200.1 kB. Max. memory is 5.3 GB. [2018-01-24 13:27:33,280 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.24 ms. Allocated memory is still 305.1 MB. Free memory is still 271.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.03 ms. Allocated memory is still 305.1 MB. Free memory was 264.2 MB in the beginning and 251.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.37 ms. Allocated memory is still 305.1 MB. Free memory was 251.1 MB in the beginning and 249.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 266.36 ms. Allocated memory is still 305.1 MB. Free memory was 249.0 MB in the beginning and 232.3 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 77203.57 ms. Allocated memory was 305.1 MB in the beginning and 553.1 MB in the end (delta: 248.0 MB). Free memory was 232.3 MB in the beginning and 480.1 MB in the end (delta: -247.8 MB). Peak memory consumption was 200.1 kB. Max. memory is 5.3 GB. * 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 constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and interpolant automaton (currently 11 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (33 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 77.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 37.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 308 SDslu, 852 SDs, 0 SdLazy, 464 SolverSat, 58 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 34.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 326 GetRequests, 232 SyntacticMatches, 27 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 38.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 90 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 38.7s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 418 ConstructedInterpolants, 94 QuantifiedInterpolants, 145808 SizeOfPredicates, 26 NumberOfNonLiveVariables, 533 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 33/76 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-27-33-288.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-27-33-288.csv Completed graceful shutdown