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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:32:01,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:32:01,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:32:01,947 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:32:01,947 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:32:01,948 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:32:01,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:32:01,950 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:32:01,952 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:32:01,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:32:01,953 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:32:01,953 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:32:01,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:32:01,955 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:32:01,956 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:32:01,957 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:32:01,959 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:32:01,960 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:32:01,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:32:01,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:32:01,964 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:32:01,964 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:32:01,964 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:32:01,965 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:32:01,966 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:32:01,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:32:01,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:32:01,967 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:32:01,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:32:01,968 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:32:01,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:32:01,969 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 19:32:01,979 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:32:01,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:32:01,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:32:01,980 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:32:01,980 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:32:01,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:32:01,981 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:32:01,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:32:01,982 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:32:01,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:32:01,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:32:01,983 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:32:01,983 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:32:01,983 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:32:02,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:32:02,030 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:32:02,035 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:32:02,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:32:02,036 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:32:02,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 19:32:02,199 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:32:02,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:32:02,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:02,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:32:02,208 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:32:02,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b275d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02, skipping insertion in model container [2018-02-04 19:32:02,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,227 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:02,280 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:02,359 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:02,367 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:02,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02 WrapperNode [2018-02-04 19:32:02,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:02,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:32:02,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:32:02,372 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:32:02,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... [2018-02-04 19:32:02,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:32:02,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:32:02,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:32:02,392 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:32:02,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 19:32:02,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:32:02,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:32:02,430 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:32:02,431 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:32:02,431 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:32:02,431 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:32:02,432 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:32:02,538 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:32:02,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:02 BoogieIcfgContainer [2018-02-04 19:32:02,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:32:02,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:32:02,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:32:02,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:32:02,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:32:02" (1/3) ... [2018-02-04 19:32:02,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5721b7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:02, skipping insertion in model container [2018-02-04 19:32:02,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:02" (2/3) ... [2018-02-04 19:32:02,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5721b7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:02, skipping insertion in model container [2018-02-04 19:32:02,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:02" (3/3) ... [2018-02-04 19:32:02,545 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-04 19:32:02,552 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:32:02,559 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-04 19:32:02,595 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:32:02,595 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:32:02,595 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:32:02,595 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:32:02,595 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:32:02,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:32:02,596 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:32:02,596 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:32:02,597 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:32:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-04 19:32:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 19:32:02,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:02,615 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:02,615 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-04 19:32:02,621 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:02,622 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:02,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:02,675 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:02,675 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:02,727 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:32:02,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:02,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:32:02,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:32:02,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:32:02,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:32:02,802 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-04 19:32:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:02,882 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-04 19:32:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:32:02,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-04 19:32:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:02,934 INFO L225 Difference]: With dead ends: 42 [2018-02-04 19:32:02,935 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 19:32:02,936 INFO L554 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-02-04 19:32:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 19:32:02,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 19:32:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 19:32:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 19:32:02,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-04 19:32:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:02,966 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 19:32:02,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:32:02,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 19:32:02,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 19:32:02,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:02,968 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:02,969 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-04 19:32:02,969 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:02,969 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:02,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:02,971 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:02,971 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:02,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:32:03,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:03,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:32:03,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:03,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:03,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:03,056 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-04 19:32:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,100 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-04 19:32:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:03,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-04 19:32:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,102 INFO L225 Difference]: With dead ends: 40 [2018-02-04 19:32:03,102 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 19:32:03,103 INFO L554 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-02-04 19:32:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 19:32:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-04 19:32:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-04 19:32:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-04 19:32:03,107 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-04 19:32:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,108 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-04 19:32:03,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-04 19:32:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:32:03,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,109 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,109 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-04 19:32:03,109 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,109 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:03,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:32:03,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:32:03,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:32:03,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:32:03,171 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-04 19:32:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,180 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-04 19:32:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:32:03,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:32:03,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,180 INFO L225 Difference]: With dead ends: 32 [2018-02-04 19:32:03,181 INFO L226 Difference]: Without dead ends: 32 [2018-02-04 19:32:03,181 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-04 19:32:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-04 19:32:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-04 19:32:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 19:32:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-04 19:32:03,183 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-04 19:32:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,184 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-04 19:32:03,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:32:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-04 19:32:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:32:03,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,184 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,184 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-04 19:32:03,185 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,185 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,186 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,186 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:03,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:32:03,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:32:03,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:32:03,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:32:03,217 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-04 19:32:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,229 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-04 19:32:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:32:03,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:32:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,229 INFO L225 Difference]: With dead ends: 36 [2018-02-04 19:32:03,229 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 19:32:03,230 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-04 19:32:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 19:32:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-04 19:32:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 19:32:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-04 19:32:03,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-04 19:32:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,233 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-04 19:32:03,233 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:32:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-04 19:32:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 19:32:03,233 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,233 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,233 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-04 19:32:03,234 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,234 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,235 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,235 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,289 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:03,289 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:03,294 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:32:03,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-02-04 19:32:03,350 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:32:03,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:32:03,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:32:03,351 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-02-04 19:32:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,361 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-04 19:32:03,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:03,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 19:32:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,363 INFO L225 Difference]: With dead ends: 33 [2018-02-04 19:32:03,363 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 19:32:03,363 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 19:32:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 19:32:03,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 19:32:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 19:32:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 19:32:03,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-04 19:32:03,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,368 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 19:32:03,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:32:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 19:32:03,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:32:03,369 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,369 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,369 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,369 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-04 19:32:03,370 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,370 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,371 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,371 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:03,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:03,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,437 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:03,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:32:03,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-04 19:32:03,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:03,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:03,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:03,459 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 19:32:03,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,478 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 19:32:03,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:32:03,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-04 19:32:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,483 INFO L225 Difference]: With dead ends: 30 [2018-02-04 19:32:03,483 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 19:32:03,484 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:32:03,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 19:32:03,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 19:32:03,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 19:32:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 19:32:03,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-04 19:32:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,487 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 19:32:03,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 19:32:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 19:32:03,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,487 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,488 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-04 19:32:03,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,489 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:32:03,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:03,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:03,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:03,611 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-02-04 19:32:03,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:32:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:32:03,638 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 19:32:03,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-04 19:32:03,638 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:32:03,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:32:03,639 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:03,639 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-04 19:32:03,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,703 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-04 19:32:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:03,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 19:32:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,707 INFO L225 Difference]: With dead ends: 31 [2018-02-04 19:32:03,707 INFO L226 Difference]: Without dead ends: 31 [2018-02-04 19:32:03,707 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:32:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-04 19:32:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-04 19:32:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-04 19:32:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-04 19:32:03,709 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-04 19:32:03,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,710 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-04 19:32:03,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:32:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-04 19:32:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:03,710 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,710 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,710 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-04 19:32:03,710 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,711 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,711 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,711 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:32:03,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:03,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:03,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:03,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:03,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:03,756 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-04 19:32:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,772 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-04 19:32:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:32:03,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:32:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,774 INFO L225 Difference]: With dead ends: 30 [2018-02-04 19:32:03,774 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 19:32:03,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:32:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 19:32:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-04 19:32:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-04 19:32:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-04 19:32:03,777 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-04 19:32:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,777 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-04 19:32:03,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-04 19:32:03,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:03,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,778 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,778 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-04 19:32:03,779 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,779 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,780 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,780 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 19:32:03,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:03,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:32:03,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:32:03,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:32:03,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:32:03,816 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-04 19:32:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:03,857 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-04 19:32:03,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:32:03,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-04 19:32:03,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:03,858 INFO L225 Difference]: With dead ends: 29 [2018-02-04 19:32:03,858 INFO L226 Difference]: Without dead ends: 29 [2018-02-04 19:32:03,858 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:32:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-04 19:32:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-04 19:32:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-04 19:32:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-04 19:32:03,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-04 19:32:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:03,862 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-04 19:32:03,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:32:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-04 19:32:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:32:03,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:03,863 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:32:03,863 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-04 19:32:03,863 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:03,863 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:03,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,864 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,864 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,874 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:03,881 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:03,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:03,881 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:03,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:03,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:03,908 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-02-04 19:32:03,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:32:03,978 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:03,979 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:03,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-02-04 19:32:03,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:03,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 19:32:04,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:32:04,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-02-04 19:32:04,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:04,043 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 2 xjuncts. [2018-02-04 19:32:04,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:31 [2018-02-04 19:32:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 19:32:04,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:04,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 19:32:04,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:32:04,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:32:04,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:32:04,072 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-02-04 19:32:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:04,149 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-04 19:32:04,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:04,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-02-04 19:32:04,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:04,150 INFO L225 Difference]: With dead ends: 28 [2018-02-04 19:32:04,150 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 19:32:04,150 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-04 19:32:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 19:32:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-02-04 19:32:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 19:32:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 19:32:04,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-02-04 19:32:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:04,153 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 19:32:04,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:32:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 19:32:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:32:04,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:04,153 INFO L351 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-02-04 19:32:04,154 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:04,154 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-02-04 19:32:04,154 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:04,154 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:04,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:04,155 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:04,155 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:04,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:04,166 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:04,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:04,166 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:04,167 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:04,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:32:04,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:32:04,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 19:32:04,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 19:32:04,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 19:32:04,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=97, Unknown=7, NotChecked=0, Total=132 [2018-02-04 19:32:04,307 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-02-04 19:32:04,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:04,425 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-04 19:32:04,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:32:04,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-04 19:32:04,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:04,426 INFO L225 Difference]: With dead ends: 31 [2018-02-04 19:32:04,426 INFO L226 Difference]: Without dead ends: 23 [2018-02-04 19:32:04,426 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=117, Unknown=7, NotChecked=0, Total=156 [2018-02-04 19:32:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-04 19:32:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-04 19:32:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-04 19:32:04,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-04 19:32:04,428 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26 [2018-02-04 19:32:04,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:04,428 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-04 19:32:04,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 19:32:04,428 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-04 19:32:04,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:32:04,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:04,429 INFO L351 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-02-04 19:32:04,429 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:32:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times [2018-02-04 19:32:04,429 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:04,429 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:04,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:04,430 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:04,430 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:04,439 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:32:04,441 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:04,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:04,442 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:04,442 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:04,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:04,462 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-02-04 19:32:04,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:32:04,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:32:04,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:32:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-04 19:32:04,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:04,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 19:32:04,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-04 19:32:04,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-04 19:32:04,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=141, Unknown=8, NotChecked=0, Total=182 [2018-02-04 19:32:04,641 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2018-02-04 19:32:04,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:04,840 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-04 19:32:04,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:32:04,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-02-04 19:32:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:04,845 INFO L225 Difference]: With dead ends: 22 [2018-02-04 19:32:04,845 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 19:32:04,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=347, Unknown=8, NotChecked=0, Total=420 [2018-02-04 19:32:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 19:32:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 19:32:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 19:32:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 19:32:04,846 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-04 19:32:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:04,847 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 19:32:04,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-04 19:32:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 19:32:04,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 19:32:04,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:32:04 BoogieIcfgContainer [2018-02-04 19:32:04,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:32:04,852 INFO L168 Benchmark]: Toolchain (without parser) took 2652.04 ms. Allocated memory was 400.6 MB in the beginning and 618.7 MB in the end (delta: 218.1 MB). Free memory was 357.2 MB in the beginning and 431.0 MB in the end (delta: -73.8 MB). Peak memory consumption was 144.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:04,853 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:32:04,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.82 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:04,853 INFO L168 Benchmark]: Boogie Preprocessor took 20.02 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:04,853 INFO L168 Benchmark]: RCFGBuilder took 147.38 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 327.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:04,853 INFO L168 Benchmark]: TraceAbstraction took 2311.61 ms. Allocated memory was 400.6 MB in the beginning and 618.7 MB in the end (delta: 218.1 MB). Free memory was 327.9 MB in the beginning and 431.0 MB in the end (delta: -103.1 MB). Peak memory consumption was 115.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:04,854 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 400.6 MB. Free memory is still 363.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.82 ms. Allocated memory is still 400.6 MB. Free memory was 357.2 MB in the beginning and 344.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 20.02 ms. Allocated memory is still 400.6 MB. Free memory was 344.0 MB in the beginning and 342.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 147.38 ms. Allocated memory is still 400.6 MB. Free memory was 342.7 MB in the beginning and 327.9 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2311.61 ms. Allocated memory was 400.6 MB in the beginning and 618.7 MB in the end (delta: 218.1 MB). Free memory was 327.9 MB in the beginning and 431.0 MB in the end (delta: -103.1 MB). Peak memory consumption was 115.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 5 error locations. SAFE Result, 2.2s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 75 SDslu, 858 SDs, 0 SdLazy, 601 SolverSat, 52 SolverUnsat, 20 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 115 SyntacticMatches, 7 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 27 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 414 NumberOfCodeBlocks, 414 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 320 ConstructedInterpolants, 8 QuantifiedInterpolants, 31061 SizeOfPredicates, 15 NumberOfNonLiveVariables, 580 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 46/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-32-04-860.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-32-04-860.csv Received shutdown request...