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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:32:57,001 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:32:57,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:32:57,014 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:32:57,014 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:32:57,015 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:32:57,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:32:57,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:32:57,019 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:32:57,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:32:57,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:32:57,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:32:57,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:32:57,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:32:57,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:32:57,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:32:57,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:32:57,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:32:57,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:32:57,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:32:57,031 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:32:57,031 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:32:57,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:32:57,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:32:57,033 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:32:57,034 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:32:57,034 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:32:57,035 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:32:57,035 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:32:57,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:32:57,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:32:57,036 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:32:57,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:32:57,044 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:32:57,045 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:32:57,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:32:57,046 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:32:57,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:32:57,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:32:57,046 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:32:57,046 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:32:57,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:32:57,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:32:57,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:32:57,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:32:57,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:32:57,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:32:57,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:32:57,048 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:32:57,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:32:57,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:32:57,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:32:57,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:32:57,083 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:32:57,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:32:57,085 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:32:57,085 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-02 09:32:57,216 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:32:57,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:32:57,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:32:57,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:32:57,224 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:32:57,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ce2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57, skipping insertion in model container [2018-02-02 09:32:57,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,243 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:32:57,286 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:32:57,379 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:32:57,392 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:32:57,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57 WrapperNode [2018-02-02 09:32:57,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:32:57,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:32:57,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:32:57,397 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:32:57,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (1/1) ... [2018-02-02 09:32:57,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:32:57,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:32:57,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:32:57,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:32:57,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (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-02 09:32:57,471 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:32:57,472 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:32:57,472 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 09:32:57,472 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 09:32:57,472 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:32:57,472 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:32:57,472 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:32:57,472 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:32:57,473 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:32:57,578 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:32:57,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:32:57 BoogieIcfgContainer [2018-02-02 09:32:57,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:32:57,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:32:57,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:32:57,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:32:57,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:32:57" (1/3) ... [2018-02-02 09:32:57,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fedcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:32:57, skipping insertion in model container [2018-02-02 09:32:57,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:32:57" (2/3) ... [2018-02-02 09:32:57,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fedcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:32:57, skipping insertion in model container [2018-02-02 09:32:57,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:32:57" (3/3) ... [2018-02-02 09:32:57,588 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-02-02 09:32:57,596 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:32:57,603 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-02-02 09:32:57,636 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:32:57,636 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:32:57,636 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:32:57,636 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:32:57,636 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:32:57,637 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:32:57,637 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:32:57,637 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:32:57,637 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:32:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-02-02 09:32:57,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 09:32:57,656 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:57,657 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:57,657 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-02-02 09:32:57,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:57,663 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:57,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:57,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:57,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:57,744 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:57,796 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-02 09:32:57,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:57,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:32:57,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:32:57,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:32:57,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:32:57,810 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-02-02 09:32:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:57,919 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-02-02 09:32:57,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:32:57,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 09:32:57,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:57,927 INFO L225 Difference]: With dead ends: 42 [2018-02-02 09:32:57,927 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 09:32:57,928 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-02 09:32:57,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 09:32:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-02 09:32:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:32:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 09:32:57,962 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-02-02 09:32:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:57,962 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 09:32:57,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:32:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 09:32:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:32:57,964 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:57,964 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-02 09:32:57,964 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-02-02 09:32:57,964 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:57,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:57,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:57,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:57,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:57,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:58,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:58,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:32:58,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:32:58,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:32:58,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:32:58,042 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-02-02 09:32:58,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,117 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-02-02 09:32:58,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:32:58,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 09:32:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,118 INFO L225 Difference]: With dead ends: 40 [2018-02-02 09:32:58,119 INFO L226 Difference]: Without dead ends: 40 [2018-02-02 09:32:58,120 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-02 09:32:58,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-02 09:32:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-02-02 09:32:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-02-02 09:32:58,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-02-02 09:32:58,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-02-02 09:32:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,125 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-02-02 09:32:58,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:32:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-02-02 09:32:58,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:32:58,125 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,125 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:32:58,126 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,126 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-02-02 09:32:58,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,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-02 09:32:58,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:58,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:32:58,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:32:58,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:32:58,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:32:58,169 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-02-02 09:32:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,179 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-02-02 09:32:58,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:32:58,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:32:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,180 INFO L225 Difference]: With dead ends: 32 [2018-02-02 09:32:58,180 INFO L226 Difference]: Without dead ends: 32 [2018-02-02 09:32:58,180 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-02 09:32:58,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-02-02 09:32:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-02-02 09:32:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:32:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-02-02 09:32:58,182 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-02-02 09:32:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,183 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-02-02 09:32:58,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:32:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-02-02 09:32:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:32:58,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,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-02 09:32:58,184 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-02-02 09:32:58,184 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,184 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,224 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-02 09:32:58,224 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:58,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:32:58,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:32:58,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:32:58,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:32:58,225 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-02-02 09:32:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,236 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-02-02 09:32:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:32:58,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 09:32:58,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,237 INFO L225 Difference]: With dead ends: 36 [2018-02-02 09:32:58,237 INFO L226 Difference]: Without dead ends: 36 [2018-02-02 09:32:58,237 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-02 09:32:58,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-02 09:32:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-02-02 09:32:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:32:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-02-02 09:32:58,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-02-02 09:32:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,241 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-02-02 09:32:58,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:32:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-02-02 09:32:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 09:32:58,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,242 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-02 09:32:58,242 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-02-02 09:32:58,242 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,242 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,293 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-02 09:32:58,293 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:58,293 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:58,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:58,353 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-02 09:32:58,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:58,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-02-02 09:32:58,375 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:32:58,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:32:58,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:32:58,376 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-02-02 09:32:58,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,390 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-02-02 09:32:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:32:58,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-02 09:32:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,391 INFO L225 Difference]: With dead ends: 33 [2018-02-02 09:32:58,391 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 09:32:58,391 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-02 09:32:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 09:32:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 09:32:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:32:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 09:32:58,395 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-02-02 09:32:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,395 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 09:32:58,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:32:58,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 09:32:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:32:58,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,396 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-02 09:32:58,396 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-02-02 09:32:58,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,444 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-02 09:32:58,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:58,444 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:58,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,466 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:58,480 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-02 09:32:58,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:58,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-02-02 09:32:58,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:32:58,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:32:58,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:32:58,498 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-02 09:32:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,511 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 09:32:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:32:58,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 09:32:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,511 INFO L225 Difference]: With dead ends: 30 [2018-02-02 09:32:58,511 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 09:32:58,512 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-02 09:32:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 09:32:58,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 09:32:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 09:32:58,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-02 09:32:58,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-02-02 09:32:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,514 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-02 09:32:58,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:32:58,514 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-02 09:32:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 09:32:58,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,515 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-02 09:32:58,515 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,515 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-02-02 09:32:58,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,515 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,611 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-02 09:32:58,612 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:58,612 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:32:58,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:58,660 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-02 09:32:58,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:58,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:58,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:32:58,684 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-02 09:32:58,710 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:58,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-02-02 09:32:58,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:32:58,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:32:58,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:32:58,711 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-02-02 09:32:58,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,786 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-02-02 09:32:58,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:32:58,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-02 09:32:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,788 INFO L225 Difference]: With dead ends: 31 [2018-02-02 09:32:58,788 INFO L226 Difference]: Without dead ends: 31 [2018-02-02 09:32:58,788 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-02 09:32:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-02-02 09:32:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-02-02 09:32:58,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-02-02 09:32:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-02-02 09:32:58,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-02-02 09:32:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,791 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-02-02 09:32:58,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:32:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-02-02 09:32:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:32:58,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,792 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-02 09:32:58,792 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-02-02 09:32:58,792 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,792 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,793 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,856 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-02 09:32:58,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:58,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:32:58,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:32:58,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:32:58,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:32:58,857 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-02-02 09:32:58,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,874 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-02-02 09:32:58,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:32:58,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 09:32:58,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,875 INFO L225 Difference]: With dead ends: 30 [2018-02-02 09:32:58,875 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 09:32:58,876 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-02 09:32:58,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 09:32:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-02-02 09:32:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-02-02 09:32:58,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-02-02 09:32:58,879 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-02-02 09:32:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,879 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-02-02 09:32:58,879 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:32:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-02-02 09:32:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 09:32:58,880 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,880 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-02 09:32:58,880 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-02-02 09:32:58,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:58,933 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-02 09:32:58,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:32:58,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:32:58,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:32:58,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:32:58,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:32:58,934 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-02-02 09:32:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:58,973 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-02-02 09:32:58,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:32:58,973 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 09:32:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:58,974 INFO L225 Difference]: With dead ends: 29 [2018-02-02 09:32:58,974 INFO L226 Difference]: Without dead ends: 29 [2018-02-02 09:32:58,974 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-02 09:32:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-02-02 09:32:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-02-02 09:32:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-02-02 09:32:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-02-02 09:32:58,976 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-02-02 09:32:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:58,976 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-02-02 09:32:58,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:32:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-02-02 09:32:58,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 09:32:58,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:58,977 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-02 09:32:58,982 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-02-02 09:32:58,983 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:58,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:58,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:58,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:58,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:32:59,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:59,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 09:32:59,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:59,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:59,176 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-02 09:32:59,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:59,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:59,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:32:59,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:59,234 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:59,236 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 17 treesize of output 21 [2018-02-02 09:32:59,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:59,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:32:59,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-02-02 09:32:59,279 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:32:59,279 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 17 treesize of output 21 [2018-02-02 09:32:59,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:32:59,284 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-02-02 09:32:59,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-02-02 09:32:59,302 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-02 09:32:59,320 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:32:59,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 15 [2018-02-02 09:32:59,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:32:59,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:32:59,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:32:59,322 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-02-02 09:32:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:32:59,434 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-02-02 09:32:59,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:32:59,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-02-02 09:32:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:32:59,435 INFO L225 Difference]: With dead ends: 28 [2018-02-02 09:32:59,435 INFO L226 Difference]: Without dead ends: 28 [2018-02-02 09:32:59,435 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:32:59,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-02 09:32:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-02-02 09:32:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 09:32:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-02 09:32:59,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-02-02 09:32:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:32:59,438 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-02 09:32:59,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:32:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-02 09:32:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:32:59,439 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:32:59,439 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-02 09:32:59,439 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:32:59,439 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-02-02 09:32:59,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:32:59,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:32:59,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:59,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:59,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:32:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:59,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:32:59,627 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-02 09:32:59,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:32:59,628 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:32:59,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:32:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:32:59,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:32:59,804 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-02 09:32:59,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:32:59,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2018-02-02 09:32:59,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:32:59,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:32:59,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=251, Unknown=13, NotChecked=0, Total=306 [2018-02-02 09:32:59,832 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 18 states. [2018-02-02 09:33:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:00,169 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-02-02 09:33:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 09:33:00,170 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-02-02 09:33:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:00,170 INFO L225 Difference]: With dead ends: 31 [2018-02-02 09:33:00,170 INFO L226 Difference]: Without dead ends: 23 [2018-02-02 09:33:00,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=503, Unknown=13, NotChecked=0, Total=600 [2018-02-02 09:33:00,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-02-02 09:33:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-02-02 09:33:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-02-02 09:33:00,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-02-02 09:33:00,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 26 [2018-02-02 09:33:00,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:00,173 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-02-02 09:33:00,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:33:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-02-02 09:33:00,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:33:00,174 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:33:00,174 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-02 09:33:00,174 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-02 09:33:00,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1917235028, now seen corresponding path program 1 times [2018-02-02 09:33:00,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:33:00,175 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:33:00,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:00,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:33:00,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:33:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:33:00,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:33:00,478 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-02 09:33:00,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:33:00,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 09:33:00,479 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:33:00,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:33:00,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:33:00,479 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 10 states. [2018-02-02 09:33:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:33:00,608 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-02-02 09:33:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:33:00,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-02 09:33:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:33:00,609 INFO L225 Difference]: With dead ends: 22 [2018-02-02 09:33:00,609 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 09:33:00,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:33:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 09:33:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 09:33:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 09:33:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 09:33:00,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-02-02 09:33:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:33:00,609 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 09:33:00,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:33:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 09:33:00,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 09:33:00,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:33:00 BoogieIcfgContainer [2018-02-02 09:33:00,613 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:33:00,614 INFO L168 Benchmark]: Toolchain (without parser) took 3397.05 ms. Allocated memory was 400.0 MB in the beginning and 656.9 MB in the end (delta: 256.9 MB). Free memory was 356.7 MB in the beginning and 486.3 MB in the end (delta: -129.6 MB). Peak memory consumption was 127.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:00,615 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:33:00,615 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.03 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:00,615 INFO L168 Benchmark]: Boogie Preprocessor took 23.17 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:00,616 INFO L168 Benchmark]: RCFGBuilder took 157.92 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 327.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:00,616 INFO L168 Benchmark]: TraceAbstraction took 3033.93 ms. Allocated memory was 400.0 MB in the beginning and 656.9 MB in the end (delta: 256.9 MB). Free memory was 327.6 MB in the beginning and 486.3 MB in the end (delta: -158.7 MB). Peak memory consumption was 98.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:33:00,617 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.12 ms. Allocated memory is still 400.0 MB. Free memory is still 363.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 179.03 ms. Allocated memory is still 400.0 MB. Free memory was 356.7 MB in the beginning and 343.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.17 ms. Allocated memory is still 400.0 MB. Free memory was 343.5 MB in the beginning and 342.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 157.92 ms. Allocated memory is still 400.0 MB. Free memory was 342.2 MB in the beginning and 327.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3033.93 ms. Allocated memory was 400.0 MB in the beginning and 656.9 MB in the end (delta: 256.9 MB). Free memory was 327.6 MB in the beginning and 486.3 MB in the end (delta: -158.7 MB). Peak memory consumption was 98.2 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.9s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 70 SDslu, 909 SDs, 0 SdLazy, 694 SolverSat, 41 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 119 SyntacticMatches, 13 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s 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.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 369 ConstructedInterpolants, 4 QuantifiedInterpolants, 40277 SizeOfPredicates, 10 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 51/70 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_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-33-00-623.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_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-33-00-623.csv Received shutdown request...