java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:47:46,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:47:46,669 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:47:46,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:47:46,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:47:46,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:47:46,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:47:46,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:47:46,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:47:46,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:47:46,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:47:46,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:47:46,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:47:46,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:47:46,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:47:46,710 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:47:46,712 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:47:46,714 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:47:46,715 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:47:46,716 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:47:46,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:47:46,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:47:46,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:47:46,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:47:46,727 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:47:46,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:47:46,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:47:46,729 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:47:46,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:47:46,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:47:46,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:47:46,730 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:47:46,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:47:46,750 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:47:46,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:47:46,751 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:47:46,751 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:47:46,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:47:46,751 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:47:46,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:47:46,754 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:47:46,754 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:47:46,754 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:47:46,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:47:46,756 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:47:46,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:47:46,756 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:47:46,756 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:47:46,756 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:47:46,757 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:47:46,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:47:46,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:47:46,758 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:47:46,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:47:46,760 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:47:46,761 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:47:46,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:47:46,825 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:47:46,829 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:47:46,830 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:47:46,831 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:47:46,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-31 08:47:47,048 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:47:47,058 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:47:47,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:47:47,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:47:47,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:47:47,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f472315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47, skipping insertion in model container [2018-01-31 08:47:47,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,092 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:47:47,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:47:47,352 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:47:47,377 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:47:47,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47 WrapperNode [2018-01-31 08:47:47,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:47:47,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:47:47,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:47:47,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:47:47,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... [2018-01-31 08:47:47,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:47:47,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:47:47,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:47:47,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:47:47,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:47:47,492 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:47:47,492 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:47:47,492 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-31 08:47:47,492 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-31 08:47:47,492 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:47:47,492 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 08:47:47,493 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:47:47,494 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-31 08:47:47,494 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-31 08:47:47,494 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:47:47,494 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:47:47,494 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:47:47,939 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:47:47,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:47:47 BoogieIcfgContainer [2018-01-31 08:47:47,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:47:47,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:47:47,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:47:47,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:47:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:47:47" (1/3) ... [2018-01-31 08:47:47,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a719a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:47:47, skipping insertion in model container [2018-01-31 08:47:47,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:47:47" (2/3) ... [2018-01-31 08:47:47,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a719a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:47:47, skipping insertion in model container [2018-01-31 08:47:47,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:47:47" (3/3) ... [2018-01-31 08:47:47,947 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-31 08:47:47,953 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:47:47,960 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-31 08:47:48,014 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:47:48,015 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:47:48,015 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:47:48,015 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:47:48,015 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:47:48,015 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:47:48,015 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:47:48,015 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:47:48,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:47:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-31 08:47:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:47:48,048 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:48,049 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-01-31 08:47:48,049 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1416841440, now seen corresponding path program 1 times [2018-01-31 08:47:48,057 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:48,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:48,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:48,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:48,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:48,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:48,402 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:48,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:47:48,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:47:48,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:47:48,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:47:48,505 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2018-01-31 08:47:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:48,780 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2018-01-31 08:47:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:47:48,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-31 08:47:48,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:48,801 INFO L225 Difference]: With dead ends: 109 [2018-01-31 08:47:48,801 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:47:48,805 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-01-31 08:47:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:47:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2018-01-31 08:47:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:47:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-01-31 08:47:48,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 25 [2018-01-31 08:47:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:48,874 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-01-31 08:47:48,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:47:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-01-31 08:47:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 08:47:48,877 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:48,877 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-01-31 08:47:48,877 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1509134574, now seen corresponding path program 1 times [2018-01-31 08:47:48,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:48,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:48,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:48,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:48,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:48,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:49,020 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:49,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:47:49,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:47:49,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:47:49,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:47:49,024 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 6 states. [2018-01-31 08:47:49,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:49,144 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2018-01-31 08:47:49,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:47:49,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-31 08:47:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:49,146 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:47:49,146 INFO L226 Difference]: Without dead ends: 102 [2018-01-31 08:47:49,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:47:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-31 08:47:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2018-01-31 08:47:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:47:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-01-31 08:47:49,165 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 26 [2018-01-31 08:47:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:49,166 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-01-31 08:47:49,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:47:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-01-31 08:47:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 08:47:49,168 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:49,168 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, 1] [2018-01-31 08:47:49,168 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1951381002, now seen corresponding path program 1 times [2018-01-31 08:47:49,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:49,169 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:49,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:49,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:49,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:49,281 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:49,281 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:47:49,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:47:49,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:47:49,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:47:49,285 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 5 states. [2018-01-31 08:47:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:49,422 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2018-01-31 08:47:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:47:49,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-31 08:47:49,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:49,423 INFO L225 Difference]: With dead ends: 116 [2018-01-31 08:47:49,423 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 08:47:49,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:47:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 08:47:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 08:47:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:47:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-31 08:47:49,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 28 [2018-01-31 08:47:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:49,431 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-31 08:47:49,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:47:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-31 08:47:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:47:49,433 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:49,433 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, 1, 1] [2018-01-31 08:47:49,433 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1617900740, now seen corresponding path program 1 times [2018-01-31 08:47:49,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:49,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:49,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:49,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:49,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:49,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:49,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:47:49,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:47:49,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:47:49,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:47:49,610 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 6 states. [2018-01-31 08:47:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:49,791 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-01-31 08:47:49,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:47:49,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-31 08:47:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:49,814 INFO L225 Difference]: With dead ends: 64 [2018-01-31 08:47:49,814 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 08:47:49,814 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:47:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 08:47:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2018-01-31 08:47:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-31 08:47:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2018-01-31 08:47:49,822 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 29 [2018-01-31 08:47:49,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:49,823 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2018-01-31 08:47:49,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:47:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2018-01-31 08:47:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:47:49,824 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:49,824 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, 1, 1] [2018-01-31 08:47:49,824 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:49,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1617900739, now seen corresponding path program 1 times [2018-01-31 08:47:49,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:49,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:49,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:49,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:49,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:49,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:49,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:47:49,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:47:49,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:47:49,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:47:49,929 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 4 states. [2018-01-31 08:47:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:50,166 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-31 08:47:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:47:50,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-01-31 08:47:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:50,168 INFO L225 Difference]: With dead ends: 106 [2018-01-31 08:47:50,168 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:47:50,169 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-01-31 08:47:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:47:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 62. [2018-01-31 08:47:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 08:47:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-31 08:47:50,183 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 29 [2018-01-31 08:47:50,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:50,184 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-31 08:47:50,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:47:50,184 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-31 08:47:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-31 08:47:50,185 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:50,185 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1] [2018-01-31 08:47:50,186 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1982179737, now seen corresponding path program 1 times [2018-01-31 08:47:50,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:50,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:50,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:50,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:50,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:50,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:47:50,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:47:50,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:47:50,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:47:50,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:47:50,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:47:50,362 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 5 states. [2018-01-31 08:47:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:50,421 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-01-31 08:47:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:47:50,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-01-31 08:47:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:50,422 INFO L225 Difference]: With dead ends: 124 [2018-01-31 08:47:50,422 INFO L226 Difference]: Without dead ends: 79 [2018-01-31 08:47:50,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:47:50,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-31 08:47:50,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-01-31 08:47:50,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-31 08:47:50,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-31 08:47:50,431 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 37 [2018-01-31 08:47:50,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:50,432 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-31 08:47:50,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:47:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-31 08:47:50,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:47:50,433 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:50,433 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-01-31 08:47:50,434 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:50,434 INFO L82 PathProgramCache]: Analyzing trace with hash 892974841, now seen corresponding path program 1 times [2018-01-31 08:47:50,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:50,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:50,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:50,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:50,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:50,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:50,701 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:50,701 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:47:50,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:50,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:50,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:47:50,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:50,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:47:50,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-31 08:47:50,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:51,019 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:51,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-31 08:47:51,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:51,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:47:51,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-31 08:47:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:51,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:51,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-01-31 08:47:51,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:47:51,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:47:51,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:47:51,290 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 11 states. [2018-01-31 08:47:51,602 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 24 DAG size of output 17 [2018-01-31 08:47:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:47:52,520 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2018-01-31 08:47:52,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:47:52,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-31 08:47:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:47:52,522 INFO L225 Difference]: With dead ends: 91 [2018-01-31 08:47:52,522 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:47:52,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:47:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:47:52,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 63. [2018-01-31 08:47:52,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 08:47:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-01-31 08:47:52,532 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 38 [2018-01-31 08:47:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:47:52,532 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-01-31 08:47:52,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:47:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-01-31 08:47:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:47:52,534 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:47:52,534 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-01-31 08:47:52,534 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:47:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash 892974842, now seen corresponding path program 1 times [2018-01-31 08:47:52,534 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:47:52,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:47:52,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:52,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:52,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:47:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:52,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:47:52,937 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 19 DAG size of output 17 [2018-01-31 08:47:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:53,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:47:53,411 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:47:53,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:47:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:47:53,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:47:53,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-31 08:47:53,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:53,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-31 08:47:53,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:53,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-31 08:47:53,534 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:53,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-31 08:47:53,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:53,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:47:53,566 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-31 08:47:53,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:53,921 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:53,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-31 08:47:53,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:53,964 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:53,965 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 45 treesize of output 48 [2018-01-31 08:47:53,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:54,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:54,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:54,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-31 08:47:54,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:54,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:47:54,047 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 41 treesize of output 50 [2018-01-31 08:47:54,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-31 08:47:54,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:47:54,086 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-31 08:47:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:47:54,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:47:54,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-01-31 08:47:54,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:47:54,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:47:54,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2018-01-31 08:47:54,241 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 21 states. [2018-01-31 08:47:54,645 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-31 08:47:55,174 WARN L143 SmtUtils]: Spent 226ms on a formula simplification that was a NOOP. DAG size: 49 [2018-01-31 08:48:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:41,070 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2018-01-31 08:48:41,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:48:41,071 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-01-31 08:48:41,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:41,072 INFO L225 Difference]: With dead ends: 135 [2018-01-31 08:48:41,072 INFO L226 Difference]: Without dead ends: 134 [2018-01-31 08:48:41,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=163, Invalid=955, Unknown=4, NotChecked=0, Total=1122 [2018-01-31 08:48:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-31 08:48:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 68. [2018-01-31 08:48:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-31 08:48:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-01-31 08:48:41,089 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 38 [2018-01-31 08:48:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:41,090 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-01-31 08:48:41,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:48:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-01-31 08:48:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:48:41,091 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:41,091 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:48:41,091 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash -390323938, now seen corresponding path program 1 times [2018-01-31 08:48:41,092 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:41,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:41,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:41,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:41,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:48:41,108 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:48:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-31 08:48:41,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:48:41,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:48:41,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:48:41,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:48:41,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:48:41,159 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 4 states. [2018-01-31 08:48:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:48:41,233 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2018-01-31 08:48:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:48:41,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-01-31 08:48:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:48:41,237 INFO L225 Difference]: With dead ends: 95 [2018-01-31 08:48:41,238 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:48:41,238 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-01-31 08:48:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:48:41,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-01-31 08:48:41,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 08:48:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-01-31 08:48:41,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 40 [2018-01-31 08:48:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:48:41,261 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-01-31 08:48:41,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:48:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-01-31 08:48:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 08:48:41,263 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:48:41,263 INFO L351 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:48:41,263 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-31 08:48:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1439195079, now seen corresponding path program 1 times [2018-01-31 08:48:41,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:48:41,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:48:41,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:41,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:48:41,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:48:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:48:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 08:48:41,330 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 08:48:41,351 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 08:48:41,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:48:41 BoogieIcfgContainer [2018-01-31 08:48:41,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:48:41,380 INFO L168 Benchmark]: Toolchain (without parser) took 54329.42 ms. Allocated memory was 305.7 MB in the beginning and 512.8 MB in the end (delta: 207.1 MB). Free memory was 264.5 MB in the beginning and 362.8 MB in the end (delta: -98.3 MB). Peak memory consumption was 108.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:41,381 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:48:41,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.84 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 251.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:41,382 INFO L168 Benchmark]: Boogie Preprocessor took 41.05 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:41,382 INFO L168 Benchmark]: RCFGBuilder took 504.16 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 231.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:41,382 INFO L168 Benchmark]: TraceAbstraction took 53436.65 ms. Allocated memory was 305.7 MB in the beginning and 512.8 MB in the end (delta: 207.1 MB). Free memory was 231.3 MB in the beginning and 362.8 MB in the end (delta: -131.5 MB). Peak memory consumption was 75.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:48:41,384 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.18 ms. Allocated memory is still 305.7 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 334.84 ms. Allocated memory is still 305.7 MB. Free memory was 264.5 MB in the beginning and 251.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.05 ms. Allocated memory is still 305.7 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 504.16 ms. Allocated memory is still 305.7 MB. Free memory was 249.5 MB in the beginning and 231.3 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 53436.65 ms. Allocated memory was 305.7 MB in the beginning and 512.8 MB in the end (delta: 207.1 MB). Free memory was 231.3 MB in the beginning and 362.8 MB in the end (delta: -131.5 MB). Peak memory consumption was 75.6 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: - UnprovableResult [Line: 1458]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1458. Possible 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() VAL [\old(size)=40, __VERIFIER_nondet_int()=1, size=40] [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); VAL [array={42:0}, ldv_malloc(sizeof(struct A18*)*len)={42:0}, len=10] [L1441] struct A18 *p; VAL [array={42:0}, len=10] [L1442] int i=0; VAL [array={42:0}, i=0, len=10] [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, 57 locations, 7 error locations. UNSAFE Result, 53.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 49.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 518 SDtfs, 593 SDslu, 1682 SDs, 0 SdLazy, 798 SolverSat, 77 SolverUnsat, 24 SolverUnknown, 0 SolverNotchecked, 40.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 172 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 408 NumberOfCodeBlocks, 408 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 355 ConstructedInterpolants, 23 QuantifiedInterpolants, 83114 SizeOfPredicates, 11 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 23/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-48-41-395.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-48-41-395.csv Received shutdown request...