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_test5_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:32:06,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:32:06,289 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:32:06,302 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:32:06,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:32:06,303 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:32:06,304 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:32:06,305 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:32:06,307 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:32:06,308 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:32:06,309 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:32:06,309 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:32:06,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:32:06,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:32:06,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:32:06,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:32:06,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:32:06,316 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:32:06,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:32:06,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:32:06,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:32:06,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:32:06,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:32:06,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:32:06,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:32:06,323 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:32:06,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:32:06,324 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:32:06,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:32:06,324 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:32:06,325 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:32:06,325 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:06,334 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:32:06,334 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:32:06,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:32:06,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:32:06,335 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:32:06,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:32:06,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:32:06,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:32:06,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:32:06,337 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:32:06,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:32:06,377 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:32:06,381 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:32:06,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:32:06,382 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:32:06,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-04 19:32:06,529 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:32:06,531 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:32:06,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:06,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:32:06,537 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:32:06,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:06" (1/1) ... [2018-02-04 19:32:06,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d34c095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:06, skipping insertion in model container [2018-02-04 19:32:06,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:32:06" (1/1) ... [2018-02-04 19:32:06,555 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:06,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:32:06,672 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:06,681 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:32:06,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:06 WrapperNode [2018-02-04 19:32:06,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:32:06,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:32:06,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:32:06,686 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:32:06,694 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:06" (1/1) ... [2018-02-04 19:32:06,694 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:06" (1/1) ... [2018-02-04 19:32:06,703 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:06" (1/1) ... [2018-02-04 19:32:06,703 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:06" (1/1) ... [2018-02-04 19:32:06,705 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:06" (1/1) ... [2018-02-04 19:32:06,707 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:06" (1/1) ... [2018-02-04 19:32:06,708 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:06" (1/1) ... [2018-02-04 19:32:06,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:32:06,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:32:06,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:32:06,710 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:32:06,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:06" (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:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure h5 [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure g5 [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:32:06,742 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:32:06,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:32:06,742 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:32:06,742 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:32:06,742 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:32:06,742 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure h5 [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure g5 [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:32:06,743 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:32:06,852 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:32:06,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:06 BoogieIcfgContainer [2018-02-04 19:32:06,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:32:06,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:32:06,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:32:06,856 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:32:06,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:32:06" (1/3) ... [2018-02-04 19:32:06,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7b8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:06, skipping insertion in model container [2018-02-04 19:32:06,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:32:06" (2/3) ... [2018-02-04 19:32:06,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7b8f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:32:06, skipping insertion in model container [2018-02-04 19:32:06,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:32:06" (3/3) ... [2018-02-04 19:32:06,858 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test5_true-valid-memsafety_true-termination.i [2018-02-04 19:32:06,865 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:32:06,870 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 19:32:06,901 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:32:06,901 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:32:06,901 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:32:06,901 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:32:06,901 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:32:06,901 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:32:06,901 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:32:06,902 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:32:06,902 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:32:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-02-04 19:32:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:32:06,922 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:06,922 INFO L351 BasicCegarLoop]: trace histogram [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:06,923 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:06,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818119, now seen corresponding path program 1 times [2018-02-04 19:32:06,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:06,928 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:06,965 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:06,966 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:06,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,009 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:07,133 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:07,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:32:07,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:32:07,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:32:07,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:32:07,145 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 9 states. [2018-02-04 19:32:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:07,275 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-04 19:32:07,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:07,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 19:32:07,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:07,283 INFO L225 Difference]: With dead ends: 48 [2018-02-04 19:32:07,283 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 19:32:07,285 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 19:32:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-02-04 19:32:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 19:32:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 19:32:07,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2018-02-04 19:32:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:07,306 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 19:32:07,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:32:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 19:32:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:32:07,307 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:07,307 INFO L351 BasicCegarLoop]: trace histogram [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:07,307 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:07,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1224818118, now seen corresponding path program 1 times [2018-02-04 19:32:07,307 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:07,307 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:07,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:07,308 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,320 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:07,380 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:07,380 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 19:32:07,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 19:32:07,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 19:32:07,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-04 19:32:07,383 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-02-04 19:32:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:07,438 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-02-04 19:32:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:07,439 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 19:32:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:07,440 INFO L225 Difference]: With dead ends: 46 [2018-02-04 19:32:07,440 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 19:32:07,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 19:32:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-04 19:32:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 19:32:07,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-02-04 19:32:07,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 20 [2018-02-04 19:32:07,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:07,446 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-02-04 19:32:07,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 19:32:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-02-04 19:32:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:32:07,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:07,447 INFO L351 BasicCegarLoop]: trace histogram [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:07,447 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:07,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905065, now seen corresponding path program 1 times [2018-02-04 19:32:07,447 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:07,447 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:07,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:07,449 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,463 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:07,540 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:07,540 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:32:07,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:32:07,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:32:07,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:07,541 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 10 states. [2018-02-04 19:32:07,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:07,591 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-02-04 19:32:07,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 19:32:07,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 19:32:07,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:07,592 INFO L225 Difference]: With dead ends: 41 [2018-02-04 19:32:07,592 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 19:32:07,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:32:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 19:32:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 19:32:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 19:32:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-04 19:32:07,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 22 [2018-02-04 19:32:07,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:07,597 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-04 19:32:07,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:32:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-04 19:32:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:32:07,598 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:07,598 INFO L351 BasicCegarLoop]: trace histogram [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:07,598 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1045905064, now seen corresponding path program 1 times [2018-02-04 19:32:07,599 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:07,599 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:07,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,600 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:07,600 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,611 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:07,684 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:07,684 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 19:32:07,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:32:07,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:32:07,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:07,685 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-02-04 19:32:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:07,797 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-02-04 19:32:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:07,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-04 19:32:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:07,798 INFO L225 Difference]: With dead ends: 44 [2018-02-04 19:32:07,798 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 19:32:07,798 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:32:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 19:32:07,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-02-04 19:32:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 19:32:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-02-04 19:32:07,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-02-04 19:32:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:07,801 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-02-04 19:32:07,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:32:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-02-04 19:32:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 19:32:07,801 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:07,801 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 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:07,801 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1043029204, now seen corresponding path program 1 times [2018-02-04 19:32:07,802 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:07,802 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:07,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:07,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,811 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:07,836 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:07,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:32:07,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:32:07,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:32:07,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:32:07,838 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 3 states. [2018-02-04 19:32:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:07,861 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-02-04 19:32:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:32:07,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-02-04 19:32:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:07,862 INFO L225 Difference]: With dead ends: 40 [2018-02-04 19:32:07,862 INFO L226 Difference]: Without dead ends: 37 [2018-02-04 19:32:07,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:07,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-04 19:32:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-02-04 19:32:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 19:32:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-02-04 19:32:07,871 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-02-04 19:32:07,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:07,871 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-02-04 19:32:07,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:32:07,871 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-02-04 19:32:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 19:32:07,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:07,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 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:07,872 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:07,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1685081515, now seen corresponding path program 1 times [2018-02-04 19:32:07,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:07,872 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:07,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:07,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:07,880 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:07,960 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:07,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:07,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:32:07,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:32:07,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:32:07,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:07,962 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-02-04 19:32:08,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:08,005 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-02-04 19:32:08,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 19:32:08,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-02-04 19:32:08,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:08,006 INFO L225 Difference]: With dead ends: 37 [2018-02-04 19:32:08,006 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 19:32:08,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 19:32:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 19:32:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-02-04 19:32:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 19:32:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-02-04 19:32:08,008 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-02-04 19:32:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:08,008 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-02-04 19:32:08,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:32:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-02-04 19:32:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:32:08,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:08,009 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 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:08,009 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1527636810, now seen corresponding path program 1 times [2018-02-04 19:32:08,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:08,009 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:08,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:08,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:08,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:08,015 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:08,086 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:08,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:08,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 19:32:08,087 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 19:32:08,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 19:32:08,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 19:32:08,087 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 10 states. [2018-02-04 19:32:08,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:08,138 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2018-02-04 19:32:08,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 19:32:08,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-02-04 19:32:08,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:08,139 INFO L225 Difference]: With dead ends: 30 [2018-02-04 19:32:08,139 INFO L226 Difference]: Without dead ends: 28 [2018-02-04 19:32:08,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 19:32:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-02-04 19:32:08,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-02-04 19:32:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 19:32:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-02-04 19:32:08,142 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 26 [2018-02-04 19:32:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:08,142 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-02-04 19:32:08,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 19:32:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-02-04 19:32:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 19:32:08,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:32:08,143 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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:08,143 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, g5Err1RequiresViolation, g5Err0RequiresViolation]=== [2018-02-04 19:32:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash -228650675, now seen corresponding path program 1 times [2018-02-04 19:32:08,143 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:32:08,143 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:32:08,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:08,144 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:08,144 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:32:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:08,156 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:08,163 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:32:08,163 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:32:08,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:32:08,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:32:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:32:08,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:32:08,323 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:08,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:32:08,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 19:32:08,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 19:32:08,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 19:32:08,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=123, Unknown=6, NotChecked=0, Total=156 [2018-02-04 19:32:08,324 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 13 states. [2018-02-04 19:32:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:32:08,480 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-02-04 19:32:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 19:32:08,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 19:32:08,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:32:08,480 INFO L225 Difference]: With dead ends: 27 [2018-02-04 19:32:08,480 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 19:32:08,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=145, Unknown=6, NotChecked=0, Total=182 [2018-02-04 19:32:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 19:32:08,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 19:32:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 19:32:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 19:32:08,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-02-04 19:32:08,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:32:08,481 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 19:32:08,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 19:32:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 19:32:08,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 19:32:08,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:32:08 BoogieIcfgContainer [2018-02-04 19:32:08,485 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:32:08,485 INFO L168 Benchmark]: Toolchain (without parser) took 1955.50 ms. Allocated memory was 397.9 MB in the beginning and 618.1 MB in the end (delta: 220.2 MB). Free memory was 354.6 MB in the beginning and 532.0 MB in the end (delta: -177.3 MB). Peak memory consumption was 42.9 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:08,486 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 397.9 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:32:08,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.92 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 341.4 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:08,486 INFO L168 Benchmark]: Boogie Preprocessor took 23.69 ms. Allocated memory is still 397.9 MB. Free memory was 341.4 MB in the beginning and 338.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:08,486 INFO L168 Benchmark]: RCFGBuilder took 143.20 ms. Allocated memory is still 397.9 MB. Free memory was 338.8 MB in the beginning and 324.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:08,487 INFO L168 Benchmark]: TraceAbstraction took 1631.69 ms. Allocated memory was 397.9 MB in the beginning and 618.1 MB in the end (delta: 220.2 MB). Free memory was 324.2 MB in the beginning and 532.0 MB in the end (delta: -207.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 5.3 GB. [2018-02-04 19:32:08,487 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.15 ms. Allocated memory is still 397.9 MB. Free memory is still 359.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.92 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 341.4 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.69 ms. Allocated memory is still 397.9 MB. Free memory was 341.4 MB in the beginning and 338.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 143.20 ms. Allocated memory is still 397.9 MB. Free memory was 338.8 MB in the beginning and 324.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1631.69 ms. Allocated memory was 397.9 MB in the beginning and 618.1 MB in the end (delta: 220.2 MB). Free memory was 324.2 MB in the beginning and 532.0 MB in the end (delta: -207.7 MB). Peak memory consumption was 12.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1449]: 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 33 locations, 3 error locations. SAFE Result, 1.5s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 196 SDtfs, 66 SDslu, 1175 SDs, 0 SdLazy, 596 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 178 ConstructedInterpolants, 3 QuantifiedInterpolants, 14762 SizeOfPredicates, 5 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-32-08-493.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test5_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-32-08-493.csv Received shutdown request...