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_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:36:05,388 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:36:05,391 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:36:05,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:36:05,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:36:05,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:36:05,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:36:05,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:36:05,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:36:05,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:36:05,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:36:05,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:36:05,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:36:05,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:36:05,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:36:05,423 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:36:05,425 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:36:05,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:36:05,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:36:05,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:36:05,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:36:05,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:36:05,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:36:05,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:36:05,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:36:05,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:36:05,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:36:05,438 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:36:05,438 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:36:05,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:36:05,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:36:05,439 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_precise.epf [2018-01-21 05:36:05,450 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:36:05,450 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:36:05,451 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:36:05,451 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:36:05,451 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:36:05,451 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:36:05,451 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:36:05,452 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:36:05,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:36:05,452 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:36:05,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:36:05,453 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:36:05,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:36:05,453 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:36:05,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:36:05,454 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:36:05,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:36:05,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:36:05,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:36:05,455 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:36:05,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:36:05,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:36:05,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:36:05,456 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:36:05,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:36:05,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:36:05,457 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:36:05,457 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:36:05,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:36:05,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:36:05,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:36:05,458 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:36:05,458 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:36:05,459 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:36:05,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:36:05,512 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:36:05,516 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:36:05,518 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:36:05,518 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:36:05,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:36:05,705 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:36:05,710 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:36:05,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:36:05,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:36:05,717 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:36:05,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a32728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05, skipping insertion in model container [2018-01-21 05:36:05,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,741 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:36:05,782 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:36:05,911 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:36:05,931 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:36:05,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05 WrapperNode [2018-01-21 05:36:05,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:36:05,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:36:05,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:36:05,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:36:05,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (1/1) ... [2018-01-21 05:36:05,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:36:05,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:36:05,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:36:05,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:36:05,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (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-21 05:36:06,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:36:06,028 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:36:06,028 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrnlen [2018-01-21 05:36:06,029 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:36:06,029 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:36:06,029 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:36:06,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:36:06,029 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure cstrnlen [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:36:06,030 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:36:06,207 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:36:06,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:36:06 BoogieIcfgContainer [2018-01-21 05:36:06,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:36:06,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:36:06,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:36:06,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:36:06,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:36:05" (1/3) ... [2018-01-21 05:36:06,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b8e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:36:06, skipping insertion in model container [2018-01-21 05:36:06,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:36:05" (2/3) ... [2018-01-21 05:36:06,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5b8e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:36:06, skipping insertion in model container [2018-01-21 05:36:06,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:36:06" (3/3) ... [2018-01-21 05:36:06,215 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:36:06,225 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:36:06,233 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:36:06,285 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:36:06,285 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:36:06,285 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:36:06,285 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:36:06,286 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:36:06,286 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:36:06,286 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:36:06,286 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:36:06,287 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:36:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 05:36:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:36:06,322 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:06,323 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:36:06,323 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:36:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash 82648, now seen corresponding path program 1 times [2018-01-21 05:36:06,330 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:06,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:06,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,374 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:36:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:36:06,435 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:36:06,441 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:36:06,449 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:36:06,450 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:36:06,450 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:36:06,450 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:36:06,450 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:36:06,450 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:36:06,450 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:36:06,450 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrnlenErr0EnsuresViolation======== [2018-01-21 05:36:06,451 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:36:06,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 05:36:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-21 05:36:06,454 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:06,454 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:36:06,454 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrnlenErr0EnsuresViolation]=== [2018-01-21 05:36:06,455 INFO L82 PathProgramCache]: Analyzing trace with hash 553872978, now seen corresponding path program 1 times [2018-01-21 05:36:06,455 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:06,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:06,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,457 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:06,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:06,537 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-21 05:36:06,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:06,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:36:06,539 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:06,541 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:36:06,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:36:06,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:06,556 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 05:36:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:06,583 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 05:36:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:36:06,670 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-01-21 05:36:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:06,677 INFO L225 Difference]: With dead ends: 45 [2018-01-21 05:36:06,677 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:36:06,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:06,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:36:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:36:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:36:06,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:36:06,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-21 05:36:06,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:06,702 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:36:06,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:36:06,703 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:36:06,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:36:06,705 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:36:06,705 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:36:06,705 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:36:06,705 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:36:06,705 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:36:06,705 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:36:06,706 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:36:06,706 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:36:06,706 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:36:06,707 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 05:36:06,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 05:36:06,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:06,708 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, 1, 1] [2018-01-21 05:36:06,708 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:36:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1554819341, now seen corresponding path program 1 times [2018-01-21 05:36:06,708 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:06,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:06,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,709 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:06,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:06,746 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-21 05:36:06,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:06,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:36:06,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:06,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:36:06,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:36:06,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:06,748 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 05:36:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:06,751 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 05:36:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:36:06,751 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-21 05:36:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:06,754 INFO L225 Difference]: With dead ends: 45 [2018-01-21 05:36:06,754 INFO L226 Difference]: Without dead ends: 29 [2018-01-21 05:36:06,754 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-21 05:36:06,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-21 05:36:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-21 05:36:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-01-21 05:36:06,763 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 23 [2018-01-21 05:36:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:06,763 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-01-21 05:36:06,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:36:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-01-21 05:36:06,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 05:36:06,764 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:06,764 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, 1, 1, 1, 1] [2018-01-21 05:36:06,764 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:36:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -637658528, now seen corresponding path program 1 times [2018-01-21 05:36:06,764 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:06,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:06,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:06,766 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:06,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:06,998 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-21 05:36:06,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:06,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:36:06,999 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:07,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:36:07,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:36:07,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:36:07,002 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-01-21 05:36:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:07,201 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-01-21 05:36:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 05:36:07,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 05:36:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:07,205 INFO L225 Difference]: With dead ends: 68 [2018-01-21 05:36:07,206 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 05:36:07,207 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:36:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 05:36:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2018-01-21 05:36:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-21 05:36:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-01-21 05:36:07,225 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 25 [2018-01-21 05:36:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:07,226 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-01-21 05:36:07,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:36:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-01-21 05:36:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 05:36:07,229 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:07,229 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, 1, 1, 1, 1] [2018-01-21 05:36:07,229 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:36:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1663164062, now seen corresponding path program 1 times [2018-01-21 05:36:07,230 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:07,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:07,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,231 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:07,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:07,371 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-21 05:36:07,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:07,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 05:36:07,372 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:07,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 05:36:07,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 05:36:07,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-21 05:36:07,373 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 7 states. [2018-01-21 05:36:07,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:07,542 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-01-21 05:36:07,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 05:36:07,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-21 05:36:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:07,544 INFO L225 Difference]: With dead ends: 63 [2018-01-21 05:36:07,544 INFO L226 Difference]: Without dead ends: 42 [2018-01-21 05:36:07,544 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-21 05:36:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-21 05:36:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2018-01-21 05:36:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 05:36:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 05:36:07,549 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 25 [2018-01-21 05:36:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:07,549 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 05:36:07,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 05:36:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 05:36:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 05:36:07,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:07,550 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, 1, 1, 1, 1, 1, 1] [2018-01-21 05:36:07,550 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:36:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2048961725, now seen corresponding path program 1 times [2018-01-21 05:36:07,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:07,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:07,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:36:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:36:07,597 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:36:07,603 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:36:07,668 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:36:07,669 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:36:07,669 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:36:07,678 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:36:07,679 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:36:07,679 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:36:07,679 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:36:07,679 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:36:07,679 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:36:07,679 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:36:07,679 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:36:07,679 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:36:07,680 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-01-21 05:36:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 05:36:07,681 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:07,681 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-21 05:36:07,681 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:36:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1267654414, now seen corresponding path program 1 times [2018-01-21 05:36:07,682 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:07,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:07,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,683 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:07,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:07,704 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-21 05:36:07,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:07,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 05:36:07,705 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:07,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:36:07,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:36:07,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:07,706 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-01-21 05:36:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:07,709 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-21 05:36:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:36:07,710 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 05:36:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:07,711 INFO L225 Difference]: With dead ends: 45 [2018-01-21 05:36:07,711 INFO L226 Difference]: Without dead ends: 27 [2018-01-21 05:36:07,711 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:36:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-21 05:36:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-21 05:36:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-21 05:36:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-01-21 05:36:07,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2018-01-21 05:36:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:07,716 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-01-21 05:36:07,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:36:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-01-21 05:36:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 05:36:07,717 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:07,717 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, 1, 1] [2018-01-21 05:36:07,718 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:36:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1560438341, now seen corresponding path program 1 times [2018-01-21 05:36:07,718 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:07,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:07,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,719 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:07,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:07,814 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-21 05:36:07,814 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:07,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:36:07,814 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:07,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:36:07,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:36:07,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:36:07,815 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-01-21 05:36:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:07,966 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-01-21 05:36:07,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 05:36:07,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 05:36:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:07,967 INFO L225 Difference]: With dead ends: 64 [2018-01-21 05:36:07,967 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 05:36:07,968 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:36:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 05:36:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-01-21 05:36:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-21 05:36:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-01-21 05:36:07,974 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 23 [2018-01-21 05:36:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:07,975 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-01-21 05:36:07,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:36:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-01-21 05:36:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 05:36:07,976 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:36:07,976 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, 1, 1] [2018-01-21 05:36:07,976 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 05:36:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1713460601, now seen corresponding path program 1 times [2018-01-21 05:36:07,977 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:36:07,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:36:07,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:36:07,978 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:36:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:36:07,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:36:08,058 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-21 05:36:08,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:36:08,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 05:36:08,059 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:36:08,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:36:08,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:36:08,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:36:08,060 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 4 states. [2018-01-21 05:36:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:36:08,165 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-01-21 05:36:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:36:08,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-21 05:36:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:36:08,167 INFO L225 Difference]: With dead ends: 42 [2018-01-21 05:36:08,167 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:36:08,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-21 05:36:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:36:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:36:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:36:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:36:08,169 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 05:36:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:36:08,169 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:36:08,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:36:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:36:08,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:36:08,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:36:08 BoogieIcfgContainer [2018-01-21 05:36:08,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:36:08,173 INFO L168 Benchmark]: Toolchain (without parser) took 2467.88 ms. Allocated memory was 304.1 MB in the beginning and 465.0 MB in the end (delta: 161.0 MB). Free memory was 261.4 MB in the beginning and 325.3 MB in the end (delta: -63.9 MB). Peak memory consumption was 97.1 MB. Max. memory is 5.3 GB. [2018-01-21 05:36:08,174 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:36:08,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:36:08,175 INFO L168 Benchmark]: Boogie Preprocessor took 33.58 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:36:08,175 INFO L168 Benchmark]: RCFGBuilder took 232.90 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 234.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 05:36:08,176 INFO L168 Benchmark]: TraceAbstraction took 1963.60 ms. Allocated memory was 304.1 MB in the beginning and 465.0 MB in the end (delta: 161.0 MB). Free memory was 234.9 MB in the beginning and 325.3 MB in the end (delta: -90.4 MB). Peak memory consumption was 70.5 MB. Max. memory is 5.3 GB. [2018-01-21 05:36:08,177 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.23 ms. Allocated memory is still 304.1 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 230.18 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.58 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 232.90 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 234.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1963.60 ms. Allocated memory was 304.1 MB in the beginning and 465.0 MB in the end (delta: 161.0 MB). Free memory was 234.9 MB in the beginning and 325.3 MB in the end (delta: -90.4 MB). Peak memory consumption was 70.5 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) - 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 4 procedures, 33 locations, 4 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=33occurred 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 - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: cstrnlenErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: [L549] int length1 = __VERIFIER_nondet_int(); [L550] int n = __VERIFIER_nondet_int(); [L551] COND TRUE length1 < 1 [L552] length1 = 1 VAL [length1=1, n=0] [L554] COND TRUE n < 1 [L555] n = 1 VAL [length1=1, n=1] [L557] EXPR, FCALL __builtin_alloca (length1 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1] [L557] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1, nondetString1={3:0}] [L558] FCALL nondetString1[length1-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, length1=1, n=1, nondetString1={3:0}] [L559] CALL, EXPR cstrnlen(nondetString1,n) VAL [\old(maxlen)=1, str={3:0}] [L543] const char *cp; [L544] cp = str VAL [\old(maxlen)=1, cp={3:0}, maxlen=1, str={3:0}, str={3:0}] [L544] maxlen != 0 && *cp != '\0' VAL [\old(maxlen)=1, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=1, str={3:0}, str={3:0}] [L544] EXPR, FCALL \read(*cp) VAL [\old(maxlen)=1, \read(*cp)=0, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=1, str={3:0}, str={3:0}] [L544] maxlen != 0 && *cp != '\0' VAL [\old(maxlen)=1, \read(*cp)=0, cp={3:0}, maxlen=1, maxlen != 0 && *cp != '\0'=0, str={3:0}, str={3:0}] [L544] COND FALSE !(maxlen != 0 && *cp != '\0') [L546] RET return (size_t)(cp - str); VAL [\old(maxlen)=1, \result=0, cp={3:0}, maxlen=1, str={3:0}, str={3:0}] [L559] EXPR cstrnlen(nondetString1,n) VAL [__builtin_alloca (length1 * sizeof(char))={3:0}, cstrnlen(nondetString1,n)=0, length1=1, n=1, nondetString1={3:0}] [L559] return cstrnlen(nondetString1,n); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 102 SDtfs, 86 SDslu, 179 SDs, 0 SdLazy, 67 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=2, 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 5236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 548]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 33 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 93 SDtfs, 55 SDslu, 87 SDs, 0 SdLazy, 58 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 4382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-36-08-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-36-08-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-36-08-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-36-08-188.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrnlen-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-36-08-188.csv Received shutdown request...