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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 00:00:16,780 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 00:00:16,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 00:00:16,795 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 00:00:16,795 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 00:00:16,796 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 00:00:16,797 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 00:00:16,799 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 00:00:16,800 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 00:00:16,801 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 00:00:16,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 00:00:16,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 00:00:16,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 00:00:16,803 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 00:00:16,804 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 00:00:16,807 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 00:00:16,809 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 00:00:16,811 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 00:00:16,812 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 00:00:16,813 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 00:00:16,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 00:00:16,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 00:00:16,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 00:00:16,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 00:00:16,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 00:00:16,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 00:00:16,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 00:00:16,821 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 00:00:16,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 00:00:16,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 00:00:16,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 00:00:16,822 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-25 00:00:16,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 00:00:16,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 00:00:16,833 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 00:00:16,834 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 00:00:16,834 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 00:00:16,834 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 00:00:16,834 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 00:00:16,834 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 00:00:16,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 00:00:16,835 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 00:00:16,836 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 00:00:16,837 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 00:00:16,837 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 00:00:16,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 00:00:16,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 00:00:16,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 00:00:16,838 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 00:00:16,838 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 00:00:16,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 00:00:16,838 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 00:00:16,839 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 00:00:16,839 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 00:00:16,839 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 00:00:16,839 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 00:00:16,839 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 00:00:16,840 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 00:00:16,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 00:00:16,840 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 00:00:16,840 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 00:00:16,841 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 00:00:16,841 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 00:00:16,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 00:00:16,890 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 00:00:16,894 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 00:00:16,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 00:00:16,895 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 00:00:16,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_2_false-valid-free.i [2018-01-25 00:00:17,080 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 00:00:17,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 00:00:17,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 00:00:17,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 00:00:17,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 00:00:17,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142f1c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17, skipping insertion in model container [2018-01-25 00:00:17,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,120 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:00:17,174 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 00:00:17,293 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:00:17,313 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 00:00:17,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17 WrapperNode [2018-01-25 00:00:17,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 00:00:17,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 00:00:17,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 00:00:17,323 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 00:00:17,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (1/1) ... [2018-01-25 00:00:17,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 00:00:17,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 00:00:17,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 00:00:17,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 00:00:17,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (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-25 00:00:17,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 00:00:17,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 00:00:17,404 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 00:00:17,404 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2018-01-25 00:00:17,405 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-25 00:00:17,405 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 00:00:17,405 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 00:00:17,405 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 00:00:17,406 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 00:00:17,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 00:00:17,407 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 00:00:17,690 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 00:00:17,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:00:17 BoogieIcfgContainer [2018-01-25 00:00:17,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 00:00:17,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 00:00:17,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 00:00:17,694 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 00:00:17,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 12:00:17" (1/3) ... [2018-01-25 00:00:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50998d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:00:17, skipping insertion in model container [2018-01-25 00:00:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 12:00:17" (2/3) ... [2018-01-25 00:00:17,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50998d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 12:00:17, skipping insertion in model container [2018-01-25 00:00:17,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 12:00:17" (3/3) ... [2018-01-25 00:00:17,697 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2_false-valid-free.i [2018-01-25 00:00:17,703 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 00:00:17,710 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 00:00:17,760 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 00:00:17,760 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 00:00:17,761 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 00:00:17,761 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 00:00:17,761 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 00:00:17,761 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 00:00:17,761 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 00:00:17,761 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 00:00:17,762 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 00:00:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-25 00:00:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:00:17,784 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:17,785 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:17,785 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1429677520, now seen corresponding path program 1 times [2018-01-25 00:00:17,791 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:17,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:17,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:17,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:17,843 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:17,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:17,983 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-25 00:00:17,986 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:17,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 00:00:17,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:17,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 00:00:18,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 00:00:18,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 00:00:18,003 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2018-01-25 00:00:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:18,351 INFO L93 Difference]: Finished difference Result 178 states and 218 transitions. [2018-01-25 00:00:18,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 00:00:18,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 00:00:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:18,369 INFO L225 Difference]: With dead ends: 178 [2018-01-25 00:00:18,370 INFO L226 Difference]: Without dead ends: 116 [2018-01-25 00:00:18,374 INFO L525 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-25 00:00:18,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-25 00:00:18,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 73. [2018-01-25 00:00:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 00:00:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-01-25 00:00:18,427 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 17 [2018-01-25 00:00:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:18,428 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-01-25 00:00:18,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 00:00:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-01-25 00:00:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 00:00:18,430 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:18,430 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:18,430 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:18,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1429687667, now seen corresponding path program 1 times [2018-01-25 00:00:18,431 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:18,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:18,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:18,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:18,562 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-25 00:00:18,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:18,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:00:18,563 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:18,564 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:00:18,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:00:18,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:00:18,565 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 5 states. [2018-01-25 00:00:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:18,617 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2018-01-25 00:00:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:00:18,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 00:00:18,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:18,620 INFO L225 Difference]: With dead ends: 136 [2018-01-25 00:00:18,620 INFO L226 Difference]: Without dead ends: 73 [2018-01-25 00:00:18,621 INFO L525 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-01-25 00:00:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-25 00:00:18,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-01-25 00:00:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 00:00:18,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-01-25 00:00:18,631 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 17 [2018-01-25 00:00:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:18,632 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-01-25 00:00:18,632 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:00:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-01-25 00:00:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:00:18,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:18,633 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:18,633 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:18,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1294678610, now seen corresponding path program 1 times [2018-01-25 00:00:18,633 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:18,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:18,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,635 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:18,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:18,714 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-25 00:00:18,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:18,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 00:00:18,715 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:18,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:00:18,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:00:18,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:00:18,716 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 6 states. [2018-01-25 00:00:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:18,787 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-01-25 00:00:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:00:18,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:00:18,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:18,789 INFO L225 Difference]: With dead ends: 75 [2018-01-25 00:00:18,789 INFO L226 Difference]: Without dead ends: 71 [2018-01-25 00:00:18,789 INFO L525 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-01-25 00:00:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-25 00:00:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-25 00:00:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 00:00:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2018-01-25 00:00:18,799 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 19 [2018-01-25 00:00:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:18,799 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2018-01-25 00:00:18,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:00:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2018-01-25 00:00:18,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:00:18,800 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:18,800 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:18,800 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688757, now seen corresponding path program 1 times [2018-01-25 00:00:18,801 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:18,802 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:18,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:18,803 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:18,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:18,893 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-25 00:00:18,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:18,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:00:18,893 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:18,894 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 00:00:18,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 00:00:18,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 00:00:18,894 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand 6 states. [2018-01-25 00:00:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:19,124 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2018-01-25 00:00:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 00:00:19,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 00:00:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:19,126 INFO L225 Difference]: With dead ends: 71 [2018-01-25 00:00:19,126 INFO L226 Difference]: Without dead ends: 70 [2018-01-25 00:00:19,126 INFO L525 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-01-25 00:00:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-25 00:00:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-25 00:00:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-25 00:00:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-01-25 00:00:19,135 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 19 [2018-01-25 00:00:19,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:19,135 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-01-25 00:00:19,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 00:00:19,135 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-01-25 00:00:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 00:00:19,136 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:19,136 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:19,137 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1294688758, now seen corresponding path program 1 times [2018-01-25 00:00:19,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:19,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:19,138 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:19,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:19,139 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:19,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:19,452 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-25 00:00:19,453 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:19,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 00:00:19,453 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:19,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 00:00:19,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 00:00:19,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-25 00:00:19,454 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 9 states. [2018-01-25 00:00:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:19,717 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2018-01-25 00:00:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:00:19,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-25 00:00:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:19,719 INFO L225 Difference]: With dead ends: 130 [2018-01-25 00:00:19,719 INFO L226 Difference]: Without dead ends: 74 [2018-01-25 00:00:19,720 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-25 00:00:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-25 00:00:19,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-01-25 00:00:19,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-25 00:00:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-01-25 00:00:19,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 19 [2018-01-25 00:00:19,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:19,777 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-01-25 00:00:19,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 00:00:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-01-25 00:00:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 00:00:19,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:19,778 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 00:00:19,778 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash 607378637, now seen corresponding path program 1 times [2018-01-25 00:00:19,778 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:19,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:19,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:19,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:19,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:19,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:20,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:20,052 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:00:20,053 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-25 00:00:20,056 INFO L201 CegarAbsIntRunner]: [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [103], [104], [106], [108], [119], [123], [124], [125], [127], [128] [2018-01-25 00:00:20,104 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:00:20,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:00:36,161 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:00:36,163 INFO L268 AbstractInterpreter]: Visited 21 different actions 26 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 19 variables. [2018-01-25 00:00:36,225 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:00:36,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:36,225 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 00:00:36,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:36,237 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:00:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:36,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:00:36,456 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 20 treesize of output 19 [2018-01-25 00:00:36,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:00:36,477 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 17 treesize of output 16 [2018-01-25 00:00:36,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:00:36,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:00:36,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:00:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:36,680 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:00:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:37,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:37,428 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 00:00:37,444 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:37,444 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:00:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:37,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:00:37,483 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 17 treesize of output 16 [2018-01-25 00:00:37,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 00:00:37,496 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 20 treesize of output 19 [2018-01-25 00:00:37,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 00:00:37,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 00:00:37,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-25 00:00:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:37,545 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:00:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:38,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 00:00:38,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10, 9, 10] total 32 [2018-01-25 00:00:38,197 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 00:00:38,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 00:00:38,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 00:00:38,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 00:00:38,198 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 19 states. [2018-01-25 00:00:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:38,874 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2018-01-25 00:00:38,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 00:00:38,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-01-25 00:00:38,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:38,875 INFO L225 Difference]: With dead ends: 135 [2018-01-25 00:00:38,875 INFO L226 Difference]: Without dead ends: 79 [2018-01-25 00:00:38,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2018-01-25 00:00:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-25 00:00:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-01-25 00:00:38,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 00:00:38,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-01-25 00:00:38,883 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 23 [2018-01-25 00:00:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:38,883 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-01-25 00:00:38,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-25 00:00:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-01-25 00:00:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 00:00:38,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:38,884 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 00:00:38,884 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 376259064, now seen corresponding path program 1 times [2018-01-25 00:00:38,884 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:38,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:38,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:38,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:38,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:38,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 00:00:38,985 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:38,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 00:00:38,986 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:38,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 00:00:38,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 00:00:38,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 00:00:38,986 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 8 states. [2018-01-25 00:00:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:39,237 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2018-01-25 00:00:39,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 00:00:39,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-01-25 00:00:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:39,239 INFO L225 Difference]: With dead ends: 104 [2018-01-25 00:00:39,239 INFO L226 Difference]: Without dead ends: 103 [2018-01-25 00:00:39,239 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-25 00:00:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-25 00:00:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-01-25 00:00:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-25 00:00:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2018-01-25 00:00:39,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 38 [2018-01-25 00:00:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:39,249 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2018-01-25 00:00:39,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 00:00:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2018-01-25 00:00:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-25 00:00:39,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:39,251 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-25 00:00:39,251 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash 376259065, now seen corresponding path program 1 times [2018-01-25 00:00:39,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:39,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:39,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:39,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:39,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:39,276 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:39,400 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:39,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:39,401 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:00:39,401 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-01-25 00:00:39,401 INFO L201 CegarAbsIntRunner]: [3], [7], [10], [28], [32], [37], [40], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [123], [124], [125], [127], [128], [129] [2018-01-25 00:00:39,403 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:00:39,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:00:53,794 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 00:00:53,794 INFO L268 AbstractInterpreter]: Visited 29 different actions 42 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 22 variables. [2018-01-25 00:00:53,796 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 00:00:53,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:53,796 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 00:00:53,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:53,801 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:00:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:53,821 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:00:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:53,857 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:00:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 00:00:53,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:53,910 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 00:00:53,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:53,913 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 00:00:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:53,964 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 00:00:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 00:00:53,999 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 00:00:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-25 00:00:54,033 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 00:00:54,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [7, 7, 7] total 18 [2018-01-25 00:00:54,034 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:54,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 00:00:54,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 00:00:54,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2018-01-25 00:00:54,035 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 4 states. [2018-01-25 00:00:54,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:54,121 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-01-25 00:00:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:00:54,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-25 00:00:54,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:54,123 INFO L225 Difference]: With dead ends: 137 [2018-01-25 00:00:54,124 INFO L226 Difference]: Without dead ends: 101 [2018-01-25 00:00:54,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-01-25 00:00:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-01-25 00:00:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2018-01-25 00:00:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-25 00:00:54,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2018-01-25 00:00:54,137 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 38 [2018-01-25 00:00:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:54,137 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2018-01-25 00:00:54,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 00:00:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2018-01-25 00:00:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 00:00:54,138 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:54,138 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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-01-25 00:00:54,138 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:54,138 INFO L82 PathProgramCache]: Analyzing trace with hash -435840666, now seen corresponding path program 1 times [2018-01-25 00:00:54,138 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:54,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:54,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:54,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:54,140 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:54,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-01-25 00:00:54,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 00:00:54,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 00:00:54,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 00:00:54,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 00:00:54,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 00:00:54,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 00:00:54,214 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand 5 states. [2018-01-25 00:00:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 00:00:54,250 INFO L93 Difference]: Finished difference Result 168 states and 189 transitions. [2018-01-25 00:00:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 00:00:54,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-25 00:00:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 00:00:54,254 INFO L225 Difference]: With dead ends: 168 [2018-01-25 00:00:54,254 INFO L226 Difference]: Without dead ends: 111 [2018-01-25 00:00:54,255 INFO L525 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-01-25 00:00:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-25 00:00:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-25 00:00:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-25 00:00:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-25 00:00:54,264 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 42 [2018-01-25 00:00:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 00:00:54,264 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-25 00:00:54,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 00:00:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-25 00:00:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-25 00:00:54,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 00:00:54,266 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-01-25 00:00:54,266 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, free_17Err3RequiresViolation, free_17Err1RequiresViolation, free_17Err2RequiresViolation, free_17Err0RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation, alloc_unsafe_17Err1RequiresViolation, alloc_unsafe_17Err3RequiresViolation, alloc_unsafe_17Err2RequiresViolation, alloc_unsafe_17Err4RequiresViolation, alloc_unsafe_17Err0RequiresViolation, alloc_unsafe_17Err5RequiresViolation]=== [2018-01-25 00:00:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash 946633512, now seen corresponding path program 1 times [2018-01-25 00:00:54,266 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 00:00:54,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:54,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 00:00:54,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 00:00:54,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 00:00:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 00:00:54,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 00:00:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-25 00:00:54,337 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 00:00:54,337 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 00:00:54,337 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-01-25 00:00:54,337 INFO L201 CegarAbsIntRunner]: [3], [7], [12], [14], [19], [21], [52], [55], [56], [57], [59], [60], [61], [88], [90], [94], [98], [101], [103], [104], [108], [119], [121], [122], [123], [124], [125], [127], [128], [129] [2018-01-25 00:00:54,339 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 00:00:54,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 00:01:05,990 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 00:01:05,990 INFO L268 AbstractInterpreter]: Visited 30 different actions 54 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-01-25 00:01:05,996 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates Received shutdown request... [2018-01-25 00:01:09,906 INFO L232 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 72.22% of their original sizes. [2018-01-25 00:01:09,907 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 00:01:09,920 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 00:01:09,923 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 00:01:09,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 12:01:09 BoogieIcfgContainer [2018-01-25 00:01:09,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 00:01:09,924 INFO L168 Benchmark]: Toolchain (without parser) took 52843.40 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 257.7 MB in the beginning and 331.0 MB in the end (delta: -73.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 00:01:09,925 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 300.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 00:01:09,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.66 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:01:09,925 INFO L168 Benchmark]: Boogie Preprocessor took 32.86 ms. Allocated memory is still 300.4 MB. Free memory was 243.8 MB in the beginning and 241.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 00:01:09,925 INFO L168 Benchmark]: RCFGBuilder took 335.57 ms. Allocated memory is still 300.4 MB. Free memory was 241.8 MB in the beginning and 221.0 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. [2018-01-25 00:01:09,926 INFO L168 Benchmark]: TraceAbstraction took 52231.72 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 221.0 MB in the beginning and 331.0 MB in the end (delta: -110.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. [2018-01-25 00:01:09,928 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 300.4 MB. Free memory is still 263.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.66 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 243.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.86 ms. Allocated memory is still 300.4 MB. Free memory was 243.8 MB in the beginning and 241.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 335.57 ms. Allocated memory is still 300.4 MB. Free memory was 241.8 MB in the beginning and 221.0 MB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 52231.72 ms. Allocated memory was 300.4 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 221.0 MB in the beginning and 331.0 MB in the end (delta: -110.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 20 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 123 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -40 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 29 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 50 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.626819 RENAME_VARIABLES(MILLISECONDS) : 1.188408 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 4.524634 PROJECTAWAY(MILLISECONDS) : 3.775698 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.094774 DISJOIN(MILLISECONDS) : 2.838394 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 1.239273 ADD_EQUALITY(MILLISECONDS) : 0.036051 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009714 #CONJOIN_DISJUNCTIVE : 42 #RENAME_VARIABLES : 69 #UNFREEZE : 0 #CONJOIN : 82 #PROJECTAWAY : 67 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 66 #ADD_EQUALITY : 51 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 241 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 39 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.375024 RENAME_VARIABLES(MILLISECONDS) : 0.052846 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.163640 PROJECTAWAY(MILLISECONDS) : 0.030795 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.093204 DISJOIN(MILLISECONDS) : 0.144012 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.067653 ADD_EQUALITY(MILLISECONDS) : 0.017337 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008100 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 105 #UNFREEZE : 0 #CONJOIN : 113 #PROJECTAWAY : 95 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 10 #RENAME_VARIABLES_DISJUNCTIVE : 102 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 215 LocStat_NO_SUPPORTING_DISEQUALITIES : 26 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 40 TransStat_MAX_WEQGRAPH_SIZE : 12 TransStat_MAX_SIZEOF_WEQEDGELABEL : 3 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 42 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.185676 RENAME_VARIABLES(MILLISECONDS) : 0.047916 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.167223 PROJECTAWAY(MILLISECONDS) : 0.030256 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041539 DISJOIN(MILLISECONDS) : 0.322926 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.062131 ADD_EQUALITY(MILLISECONDS) : 0.020615 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014195 #CONJOIN_DISJUNCTIVE : 76 #RENAME_VARIABLES : 139 #UNFREEZE : 0 #CONJOIN : 139 #PROJECTAWAY : 114 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 19 #RENAME_VARIABLES_DISJUNCTIVE : 136 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1477]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1477). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1460). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1470). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1474). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1451). Cancelled while BasicCegarLoop was analyzing trace of length 45 with TraceHistMax 4, while AbsIntCurrentIteration was generating AI predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 72 locations, 15 error locations. TIMEOUT Result, 52.1s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 625 SDtfs, 230 SDslu, 2251 SDs, 0 SdLazy, 696 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 217 SyntacticMatches, 8 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 42.2s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.91791944185925 AbsIntWeakeningRatio, 0.8837209302325582 AbsIntAvgWeakeningVarsNumRemoved, 5.255813953488372 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 92 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 354 NumberOfCodeBlocks, 354 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 459 ConstructedInterpolants, 10 QuantifiedInterpolants, 72501 SizeOfPredicates, 14 NumberOfNonLiveVariables, 444 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 78/145 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_00-01-09-941.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_2_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_00-01-09-941.csv Completed graceful shutdown