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/mempurity-32bit-Automizer_Taipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:24:07,134 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:24:07,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:24:07,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:24:07,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:24:07,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:24:07,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:24:07,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:24:07,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:24:07,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:24:07,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:24:07,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:24:07,160 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:24:07,162 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:24:07,163 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:24:07,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:24:07,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:24:07,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:24:07,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:24:07,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:24:07,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:24:07,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:24:07,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:24:07,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:24:07,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:24:07,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:24:07,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:24:07,178 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:24:07,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:24:07,178 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:24:07,179 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:24:07,179 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ.epf [2018-01-20 23:24:07,189 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:24:07,189 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:24:07,190 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:24:07,190 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:24:07,190 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:24:07,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:24:07,191 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:24:07,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:24:07,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:24:07,192 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:24:07,193 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:24:07,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:24:07,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:24:07,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:24:07,193 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:24:07,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:24:07,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:24:07,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:24:07,194 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:24:07,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:24:07,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:24:07,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:24:07,195 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:24:07,195 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:24:07,195 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:24:07,195 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:24:07,196 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:24:07,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:24:07,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:24:07,196 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:24:07,196 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:24:07,197 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:24:07,197 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:24:07,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:24:07,244 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:24:07,248 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:24:07,249 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:24:07,250 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:24:07,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:07,418 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:24:07,423 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:24:07,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:07,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:24:07,432 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:24:07,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcefd7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07, skipping insertion in model container [2018-01-20 23:24:07,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,457 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:07,498 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:24:07,641 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:07,657 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:24:07,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07 WrapperNode [2018-01-20 23:24:07,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:24:07,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:24:07,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:24:07,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:24:07,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (1/1) ... [2018-01-20 23:24:07,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:24:07,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:24:07,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:24:07,707 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:24:07,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (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-20 23:24:07,764 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:24:07,765 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:24:07,765 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:24:07,765 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:24:07,765 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:24:07,765 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:24:07,766 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:24:07,997 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:24:07,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:07 BoogieIcfgContainer [2018-01-20 23:24:07,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:24:07,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:24:07,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:24:08,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:24:08,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:24:07" (1/3) ... [2018-01-20 23:24:08,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589766dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:08, skipping insertion in model container [2018-01-20 23:24:08,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:24:07" (2/3) ... [2018-01-20 23:24:08,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589766dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:24:08, skipping insertion in model container [2018-01-20 23:24:08,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:24:07" (3/3) ... [2018-01-20 23:24:08,003 INFO L105 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-20 23:24:08,009 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:24:08,015 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 23:24:08,061 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:08,062 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:08,062 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:08,062 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:08,062 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:08,062 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:08,062 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:08,063 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:24:08,063 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:24:08,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:24:08,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,090 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:24:08,090 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:24:08,095 INFO L82 PathProgramCache]: Analyzing trace with hash 106673, now seen corresponding path program 1 times [2018-01-20 23:24:08,098 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,141 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:08,192 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:08,198 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:08,203 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:08,203 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:08,203 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:08,204 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:08,204 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:08,204 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:08,204 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:08,204 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:24:08,204 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:24:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:24:08,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:08,207 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1701202051, now seen corresponding path program 1 times [2018-01-20 23:24:08,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:08,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:08,310 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-20 23:24:08,312 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:08,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:08,312 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:08,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:08,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:08,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,333 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-20 23:24:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:08,454 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-20 23:24:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:08,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-20 23:24:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:08,465 INFO L225 Difference]: With dead ends: 58 [2018-01-20 23:24:08,465 INFO L226 Difference]: Without dead ends: 33 [2018-01-20 23:24:08,468 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-20 23:24:08,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-20 23:24:08,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-20 23:24:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-20 23:24:08,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 15 [2018-01-20 23:24:08,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:08,498 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-20 23:24:08,498 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-20 23:24:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 23:24:08,499 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,499 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:08,500 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash 83400416, now seen corresponding path program 1 times [2018-01-20 23:24:08,500 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,501 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,501 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:08,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:08,584 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-20 23:24:08,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:08,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:08,584 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:08,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:08,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:08,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,587 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-20 23:24:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:08,645 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-01-20 23:24:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:24:08,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-20 23:24:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:08,647 INFO L225 Difference]: With dead ends: 56 [2018-01-20 23:24:08,647 INFO L226 Difference]: Without dead ends: 38 [2018-01-20 23:24:08,649 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-20 23:24:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-20 23:24:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-20 23:24:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-20 23:24:08,656 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-01-20 23:24:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:08,656 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-20 23:24:08,656 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-20 23:24:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-20 23:24:08,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,658 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:08,658 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:08,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2028475934, now seen corresponding path program 1 times [2018-01-20 23:24:08,659 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,661 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:08,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:24:08,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:08,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:08,734 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:08,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:08,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:08,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,736 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-20 23:24:08,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:08,768 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-20 23:24:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:24:08,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-20 23:24:08,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:08,770 INFO L225 Difference]: With dead ends: 52 [2018-01-20 23:24:08,771 INFO L226 Difference]: Without dead ends: 45 [2018-01-20 23:24:08,771 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-20 23:24:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-01-20 23:24:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-20 23:24:08,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-20 23:24:08,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2018-01-20 23:24:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:08,778 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-20 23:24:08,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:08,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-20 23:24:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-20 23:24:08,780 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:08,780 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:24:08,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1502089971, now seen corresponding path program 1 times [2018-01-20 23:24:08,781 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,783 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:24:08,833 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:24:08,840 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:08,845 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:08,845 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:24:08,858 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:24:08,858 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:24:08,858 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:24:08,858 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:24:08,858 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:24:08,858 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:24:08,859 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:24:08,859 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:24:08,859 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:24:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-20 23:24:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-20 23:24:08,861 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,861 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:08,861 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -909960591, now seen corresponding path program 1 times [2018-01-20 23:24:08,862 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,863 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:08,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:08,901 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-20 23:24:08,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:08,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:08,901 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:08,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:08,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:08,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,902 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-01-20 23:24:08,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:08,922 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-01-20 23:24:08,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:08,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-20 23:24:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:08,923 INFO L225 Difference]: With dead ends: 58 [2018-01-20 23:24:08,923 INFO L226 Difference]: Without dead ends: 31 [2018-01-20 23:24:08,924 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-20 23:24:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-20 23:24:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-20 23:24:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-01-20 23:24:08,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2018-01-20 23:24:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:08,929 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-01-20 23:24:08,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-01-20 23:24:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-20 23:24:08,930 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:08,930 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-20 23:24:08,930 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1600085006, now seen corresponding path program 1 times [2018-01-20 23:24:08,930 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:08,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:08,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:08,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:08,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:08,975 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-20 23:24:08,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:08,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:08,976 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:08,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:08,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:08,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:08,977 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-01-20 23:24:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:09,004 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-01-20 23:24:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:24:09,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-20 23:24:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:09,005 INFO L225 Difference]: With dead ends: 52 [2018-01-20 23:24:09,005 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 23:24:09,005 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 23:24:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-20 23:24:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-20 23:24:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-01-20 23:24:09,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-01-20 23:24:09,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:09,011 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-01-20 23:24:09,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-01-20 23:24:09,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:24:09,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:09,013 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:09,013 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:09,013 INFO L82 PathProgramCache]: Analyzing trace with hash 266045328, now seen corresponding path program 1 times [2018-01-20 23:24:09,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:09,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:09,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:09,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:09,015 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:09,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:24:09,070 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:09,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:24:09,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:09,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:09,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:09,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:09,072 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-01-20 23:24:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:09,102 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-01-20 23:24:09,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:24:09,102 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-20 23:24:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:09,103 INFO L225 Difference]: With dead ends: 48 [2018-01-20 23:24:09,103 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 23:24:09,104 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 23:24:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-01-20 23:24:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-20 23:24:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-20 23:24:09,109 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 24 [2018-01-20 23:24:09,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:09,110 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-20 23:24:09,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:09,110 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-20 23:24:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-20 23:24:09,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:24:09,111 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:24:09,111 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 23:24:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1941225697, now seen corresponding path program 1 times [2018-01-20 23:24:09,112 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:24:09,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:09,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:24:09,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:24:09,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:24:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:24:09,130 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:24:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 23:24:09,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:24:09,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:24:09,206 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:24:09,206 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:24:09,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:24:09,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:24:09,207 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 4 states. [2018-01-20 23:24:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:24:09,270 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-01-20 23:24:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 23:24:09,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-01-20 23:24:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:24:09,271 INFO L225 Difference]: With dead ends: 35 [2018-01-20 23:24:09,271 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:24:09,271 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:24:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:24:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:24:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:24:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:24:09,272 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-20 23:24:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:24:09,272 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:24:09,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:24:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:24:09,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:24:09,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:24:09 BoogieIcfgContainer [2018-01-20 23:24:09,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:24:09,277 INFO L168 Benchmark]: Toolchain (without parser) took 1858.36 ms. Allocated memory was 302.0 MB in the beginning and 453.0 MB in the end (delta: 151.0 MB). Free memory was 261.9 MB in the beginning and 346.7 MB in the end (delta: -84.8 MB). Peak memory consumption was 66.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:09,278 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:24:09,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.19 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:09,278 INFO L168 Benchmark]: Boogie Preprocessor took 42.75 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:09,279 INFO L168 Benchmark]: RCFGBuilder took 290.37 ms. Allocated memory is still 302.0 MB. Free memory was 249.9 MB in the beginning and 234.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:09,279 INFO L168 Benchmark]: TraceAbstraction took 1278.06 ms. Allocated memory was 302.0 MB in the beginning and 453.0 MB in the end (delta: 151.0 MB). Free memory was 234.0 MB in the beginning and 346.7 MB in the end (delta: -112.7 MB). Peak memory consumption was 38.3 MB. Max. memory is 5.3 GB. [2018-01-20 23:24:09,281 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.19 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 251.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.75 ms. Allocated memory is still 302.0 MB. Free memory was 251.0 MB in the beginning and 249.9 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 290.37 ms. Allocated memory is still 302.0 MB. Free memory was 249.9 MB in the beginning and 234.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1278.06 ms. Allocated memory was 302.0 MB in the beginning and 453.0 MB in the end (delta: 151.0 MB). Free memory was 234.0 MB in the beginning and 346.7 MB in the end (delta: -112.7 MB). Peak memory consumption was 38.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L541] int i, j; [L542] int val; [L543] int length = __VERIFIER_nondet_int(); [L544] COND TRUE length < 1 || length >= 2147483647 / sizeof(int) [L544] length = 1 VAL [length=1] [L545] EXPR, FCALL __builtin_alloca (length*sizeof(int)) VAL [__builtin_alloca (length*sizeof(int))={6:0}, length=1] [L545] int *arr = __builtin_alloca (length*sizeof(int)); VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, length=1] [L546] COND FALSE !(!arr) [L547] i=0 VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, i=0, length=1] [L547] COND TRUE i 0) [L554] j++ VAL [__builtin_alloca (length*sizeof(int))={6:0}, arr={6:0}, i=1, j=1, length=1, val=0] [L554] COND FALSE !(j