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_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 19:10:22,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 19:10:22,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 19:10:22,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 19:10:22,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 19:10:22,482 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 19:10:22,483 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 19:10:22,485 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 19:10:22,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 19:10:22,487 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 19:10:22,487 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 19:10:22,488 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 19:10:22,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 19:10:22,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 19:10:22,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 19:10:22,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 19:10:22,493 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 19:10:22,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 19:10:22,495 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 19:10:22,496 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 19:10:22,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 19:10:22,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 19:10:22,498 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 19:10:22,499 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 19:10:22,500 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 19:10:22,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 19:10:22,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 19:10:22,501 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 19:10:22,501 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 19:10:22,501 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 19:10:22,502 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 19:10:22,502 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:10:22,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 19:10:22,510 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 19:10:22,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 19:10:22,511 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 19:10:22,511 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 19:10:22,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 19:10:22,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 19:10:22,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 19:10:22,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 19:10:22,513 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 19:10:22,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 19:10:22,546 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 19:10:22,548 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 19:10:22,549 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 19:10:22,549 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 19:10:22,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-04 19:10:22,681 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 19:10:22,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 19:10:22,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:22,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 19:10:22,686 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 19:10:22,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@286f8729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22, skipping insertion in model container [2018-02-04 19:10:22,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,699 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:22,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 19:10:22,816 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:22,830 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 19:10:22,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22 WrapperNode [2018-02-04 19:10:22,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 19:10:22,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 19:10:22,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 19:10:22,837 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 19:10:22,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (1/1) ... [2018-02-04 19:10:22,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 19:10:22,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 19:10:22,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 19:10:22,864 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 19:10:22,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (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:10:22,899 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 19:10:22,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 19:10:22,900 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-04 19:10:22,900 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-04 19:10:22,900 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 19:10:22,900 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-04 19:10:22,901 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-04 19:10:22,901 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 19:10:22,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 19:10:22,901 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 19:10:23,019 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 19:10:23,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:23 BoogieIcfgContainer [2018-02-04 19:10:23,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 19:10:23,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 19:10:23,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 19:10:23,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 19:10:23,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 07:10:22" (1/3) ... [2018-02-04 19:10:23,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261cefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:23, skipping insertion in model container [2018-02-04 19:10:23,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 07:10:22" (2/3) ... [2018-02-04 19:10:23,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261cefea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 07:10:23, skipping insertion in model container [2018-02-04 19:10:23,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 07:10:23" (3/3) ... [2018-02-04 19:10:23,023 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-02-04 19:10:23,028 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 19:10:23,033 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-04 19:10:23,061 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 19:10:23,062 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 19:10:23,062 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 19:10:23,062 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 19:10:23,062 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 19:10:23,062 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 19:10:23,062 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 19:10:23,063 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 19:10:23,063 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 19:10:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-02-04 19:10:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 19:10:23,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,083 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:23,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-02-04 19:10:23,091 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,091 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,135 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,227 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:10:23,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 19:10:23,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 19:10:23,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 19:10:23,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:10:23,242 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-02-04 19:10:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,385 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-04 19:10:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 19:10:23,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-02-04 19:10:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,392 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:10:23,392 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 19:10:23,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 19:10:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 19:10:23,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-02-04 19:10:23,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:10:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-02-04 19:10:23,419 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-02-04 19:10:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,420 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-02-04 19:10:23,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 19:10:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-02-04 19:10:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 19:10:23,421 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,421 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:23,421 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-02-04 19:10:23,421 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,421 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,423 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,423 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,495 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:10:23,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 19:10:23,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:10:23,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:10:23,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:23,497 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-02-04 19:10:23,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,558 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-02-04 19:10:23,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:10:23,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-02-04 19:10:23,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,559 INFO L225 Difference]: With dead ends: 76 [2018-02-04 19:10:23,560 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 19:10:23,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 19:10:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-02-04 19:10:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 19:10:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-02-04 19:10:23,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-02-04 19:10:23,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,566 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-02-04 19:10:23,566 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:10:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-02-04 19:10:23,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 19:10:23,567 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,567 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:10:23,567 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-02-04 19:10:23,567 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,567 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,568 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,568 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,613 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:10:23,613 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:10:23,614 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:23,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:23,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:23,614 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-02-04 19:10:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,630 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-04 19:10:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:23,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 19:10:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,631 INFO L225 Difference]: With dead ends: 44 [2018-02-04 19:10:23,631 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 19:10:23,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 19:10:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 19:10:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 19:10:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 19:10:23,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-04 19:10:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,636 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 19:10:23,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 19:10:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:10:23,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,637 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:10:23,637 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-02-04 19:10:23,638 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,638 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,639 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,639 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,698 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:10:23,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:10:23,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 19:10:23,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 19:10:23,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 19:10:23,700 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-02-04 19:10:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,778 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-04 19:10:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 19:10:23,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 19:10:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,779 INFO L225 Difference]: With dead ends: 49 [2018-02-04 19:10:23,780 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 19:10:23,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 19:10:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 19:10:23,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-02-04 19:10:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 19:10:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-04 19:10:23,784 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-02-04 19:10:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,784 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-04 19:10:23,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 19:10:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-04 19:10:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 19:10:23,785 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,785 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:10:23,785 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,786 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-02-04 19:10:23,786 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,786 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,787 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,787 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,817 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:10:23,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:10:23,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:10:23,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:10:23,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:23,818 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-02-04 19:10:23,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,834 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-02-04 19:10:23,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 19:10:23,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-04 19:10:23,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,835 INFO L225 Difference]: With dead ends: 68 [2018-02-04 19:10:23,835 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 19:10:23,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:23,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 19:10:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-02-04 19:10:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 19:10:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 19:10:23,837 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-02-04 19:10:23,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,838 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 19:10:23,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:10:23,838 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 19:10:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 19:10:23,838 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,838 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:23,838 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-02-04 19:10:23,839 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,839 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,839 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 19:10:23,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:23,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 19:10:23,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 19:10:23,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 19:10:23,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:23,888 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-02-04 19:10:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:23,895 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-02-04 19:10:23,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:23,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-04 19:10:23,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:23,896 INFO L225 Difference]: With dead ends: 62 [2018-02-04 19:10:23,896 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 19:10:23,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 19:10:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-02-04 19:10:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 19:10:23,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-02-04 19:10:23,901 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-02-04 19:10:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:23,901 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-02-04 19:10:23,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 19:10:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-02-04 19:10:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:10:23,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:23,902 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:23,902 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:23,902 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-02-04 19:10:23,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:23,902 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:23,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:23,927 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:23,928 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:23,928 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:23,929 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:23,963 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:23,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 19:10:23,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:23,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 19:10:23,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 19:10:24,015 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc1.base| 1))) is different from true [2018-02-04 19:10:24,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-02-04 19:10:24,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,025 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-04 19:10:24,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-02-04 19:10:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:10:24,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:24,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-04 19:10:24,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 19:10:24,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 19:10:24,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2018-02-04 19:10:24,032 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 8 states. [2018-02-04 19:10:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:24,133 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-04 19:10:24,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 19:10:24,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 19:10:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:24,135 INFO L225 Difference]: With dead ends: 55 [2018-02-04 19:10:24,135 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 19:10:24,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2018-02-04 19:10:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 19:10:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2018-02-04 19:10:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 19:10:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 19:10:24,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2018-02-04 19:10:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:24,139 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 19:10:24,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 19:10:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 19:10:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 19:10:24,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:24,140 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 19:10:24,140 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-02-04 19:10:24,140 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:24,140 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:24,141 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:24,141 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:24,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:24,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:24,164 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 19:10:24,164 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 19:10:24,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 19:10:24,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:24,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 19:10:24,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-02-04 19:10:24,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-04 19:10:24,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-04 19:10:24,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-02-04 19:10:24,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 19:10:24,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-02-04 19:10:24,349 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((ldv_malloc_~size Int) (|ldv_malloc_#t~malloc1.base| Int)) (let ((.cse0 (mod ldv_malloc_~size 4294967296))) (and (= (store |c_old(#length)| |ldv_malloc_#t~malloc1.base| .cse0) |c_#length|) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc1.base|) 0) (<= .cse0 2147483647)))) (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (mod v_prenex_2 4294967296))) (and (= (store |c_old(#length)| v_prenex_3 (+ .cse1 (- 4294967296))) |c_#length|) (<= (select |c_old(#valid)| v_prenex_3) 0) (< 2147483647 .cse1))))) is different from true [2018-02-04 19:10:24,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-02-04 19:10:24,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,408 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2018-02-04 19:10:24,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,444 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 19:10:24,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 19:10:24,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-02-04 19:10:24,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 19:10:24,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-04 19:10:24,489 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:55 [2018-02-04 19:10:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-02-04 19:10:24,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 19:10:24,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 19:10:24,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 19:10:24,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 19:10:24,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=74, Unknown=1, NotChecked=16, Total=110 [2018-02-04 19:10:24,535 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 11 states. [2018-02-04 19:10:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:27,233 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2018-02-04 19:10:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 19:10:27,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 19:10:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:27,234 INFO L225 Difference]: With dead ends: 81 [2018-02-04 19:10:27,235 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 19:10:27,235 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2018-02-04 19:10:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 19:10:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2018-02-04 19:10:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 19:10:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-04 19:10:27,239 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 28 [2018-02-04 19:10:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:27,239 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-04 19:10:27,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 19:10:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-04 19:10:27,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 19:10:27,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:27,241 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, 1, 1, 1] [2018-02-04 19:10:27,241 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 652258778, now seen corresponding path program 1 times [2018-02-04 19:10:27,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:27,241 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:27,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:27,242 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:27,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 19:10:27,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 19:10:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 19:10:27,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 19:10:27,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 19:10:27,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 19:10:27,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 19:10:27,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 19:10:27,269 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 4 states. [2018-02-04 19:10:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 19:10:27,285 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-02-04 19:10:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 19:10:27,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 19:10:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 19:10:27,286 INFO L225 Difference]: With dead ends: 60 [2018-02-04 19:10:27,286 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 19:10:27,286 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 19:10:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 19:10:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-02-04 19:10:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 19:10:27,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-02-04 19:10:27,289 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 29 [2018-02-04 19:10:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 19:10:27,289 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-02-04 19:10:27,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 19:10:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-02-04 19:10:27,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 19:10:27,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 19:10:27,289 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, 1, 1, 1, 1, 1] [2018-02-04 19:10:27,290 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-02-04 19:10:27,290 INFO L82 PathProgramCache]: Analyzing trace with hash -244587327, now seen corresponding path program 1 times [2018-02-04 19:10:27,290 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 19:10:27,290 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 19:10:27,290 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:27,291 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 19:10:27,291 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 19:10:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:10:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 19:10:27,320 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 19:10:27,328 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-04 19:10:27,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 07:10:27 BoogieIcfgContainer [2018-02-04 19:10:27,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 19:10:27,339 INFO L168 Benchmark]: Toolchain (without parser) took 4657.03 ms. Allocated memory was 392.2 MB in the beginning and 615.0 MB in the end (delta: 222.8 MB). Free memory was 349.0 MB in the beginning and 466.5 MB in the end (delta: -117.5 MB). Peak memory consumption was 105.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:27,339 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 392.2 MB. Free memory is still 355.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 19:10:27,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.74 ms. Allocated memory is still 392.2 MB. Free memory was 349.0 MB in the beginning and 335.8 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:10:27,339 INFO L168 Benchmark]: Boogie Preprocessor took 26.50 ms. Allocated memory is still 392.2 MB. Free memory was 335.8 MB in the beginning and 334.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:27,340 INFO L168 Benchmark]: RCFGBuilder took 156.34 ms. Allocated memory is still 392.2 MB. Free memory was 334.5 MB in the beginning and 316.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:27,340 INFO L168 Benchmark]: TraceAbstraction took 4318.07 ms. Allocated memory was 392.2 MB in the beginning and 615.0 MB in the end (delta: 222.8 MB). Free memory was 316.5 MB in the beginning and 466.5 MB in the end (delta: -150.1 MB). Peak memory consumption was 72.8 MB. Max. memory is 5.3 GB. [2018-02-04 19:10:27,340 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.13 ms. Allocated memory is still 392.2 MB. Free memory is still 355.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.74 ms. Allocated memory is still 392.2 MB. Free memory was 349.0 MB in the beginning and 335.8 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.50 ms. Allocated memory is still 392.2 MB. Free memory was 335.8 MB in the beginning and 334.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 156.34 ms. Allocated memory is still 392.2 MB. Free memory was 334.5 MB in the beginning and 316.5 MB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 4318.07 ms. Allocated memory was 392.2 MB in the beginning and 615.0 MB in the end (delta: 222.8 MB). Free memory was 316.5 MB in the beginning and 466.5 MB in the end (delta: -150.1 MB). Peak memory consumption was 72.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1458]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1459] CALL entry_point() [L1439] int len = 10; VAL [len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] RET return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] [L1440] EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; [L1443] int j; VAL [array={42:0}, i=0, len=10] [L1444] COND FALSE !(!array) VAL [array={42:0}, i=0, len=10] [L1445] COND TRUE i=0) VAL [array={42:0}, i=0, j=-1, len=10, p={0:0}] [L1459] entry_point() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. UNSAFE Result, 4.2s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 379 SDtfs, 241 SDslu, 1007 SDs, 0 SdLazy, 530 SolverSat, 34 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=9, 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, 9 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 202 ConstructedInterpolants, 9 QuantifiedInterpolants, 24629 SizeOfPredicates, 8 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 12/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_19-10-27-345.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_19-10-27-345.csv Received shutdown request...