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_cmemchr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:35:35,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:35:35,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:35:35,919 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:35:35,919 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:35:35,920 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:35:35,921 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:35:35,923 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:35:35,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:35:35,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:35:35,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:35:35,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:35:35,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:35:35,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:35:35,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:35:35,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:35:35,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:35:35,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:35:35,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:35:35,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:35:35,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:35:35,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:35:35,948 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:35:35,949 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:35:35,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:35:35,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:35:35,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:35:35,952 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:35:35,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:35:35,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:35:35,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:35:35,953 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:35:35,963 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:35:35,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:35:35,964 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:35:35,965 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:35:35,965 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:35:35,965 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:35:35,965 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:35:35,965 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:35:35,966 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:35:35,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:35:35,966 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:35:35,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:35:35,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:35:35,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:35:35,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:35:35,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:35:35,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:35:35,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:35:35,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:35:35,969 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:35:35,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:35:35,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:35:35,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:35:35,970 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:35:35,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:35:35,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:35:35,970 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:35:35,971 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:35:35,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:35:35,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:35:35,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:35:35,971 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:35:35,972 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:35:35,972 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:35:36,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:35:36,022 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:35:36,026 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:35:36,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:35:36,028 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:35:36,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:35:36,232 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:35:36,236 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:35:36,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:35:36,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:35:36,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:35:36,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91737b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36, skipping insertion in model container [2018-01-21 05:35:36,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,260 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:35:36,299 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:35:36,418 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:35:36,435 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:35:36,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36 WrapperNode [2018-01-21 05:35:36,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:35:36,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:35:36,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:35:36,444 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:35:36,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (1/1) ... [2018-01-21 05:35:36,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:35:36,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:35:36,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:35:36,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:35:36,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (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:35:36,528 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:35:36,529 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:35:36,529 INFO L136 BoogieDeclarations]: Found implementation of procedure cmemchr [2018-01-21 05:35:36,529 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:35:36,529 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:35:36,530 INFO L128 BoogieDeclarations]: Found specification of procedure cmemchr [2018-01-21 05:35:36,530 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:35:36,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:35:36,530 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:35:36,704 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:35:36,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:35:36 BoogieIcfgContainer [2018-01-21 05:35:36,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:35:36,706 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:35:36,706 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:35:36,708 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:35:36,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:35:36" (1/3) ... [2018-01-21 05:35:36,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799f6790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:35:36, skipping insertion in model container [2018-01-21 05:35:36,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:36" (2/3) ... [2018-01-21 05:35:36,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799f6790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:35:36, skipping insertion in model container [2018-01-21 05:35:36,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:35:36" (3/3) ... [2018-01-21 05:35:36,713 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:35:36,722 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:35:36,730 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:35:36,779 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:36,779 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:36,779 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:36,780 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:36,780 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:36,780 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:36,780 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:36,780 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cmemchrErr0EnsuresViolation======== [2018-01-21 05:35:36,781 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 05:35:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 05:35:36,808 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:36,809 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:35:36,809 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cmemchrErr0EnsuresViolation]=== [2018-01-21 05:35:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash 670112966, now seen corresponding path program 1 times [2018-01-21 05:35:36,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:36,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:36,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:36,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:36,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:36,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:35:36,960 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:35:36,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:36,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 05:35:36,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:36,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:35:36,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:35:36,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:35:36,978 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-01-21 05:35:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:36,998 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-21 05:35:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:35:36,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 05:35:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:37,008 INFO L225 Difference]: With dead ends: 44 [2018-01-21 05:35:37,008 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:35:37,012 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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:35:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:35:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:35:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:35:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:35:37,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 05:35:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:37,123 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:35:37,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:35:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:35:37,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:35:37,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point cmemchrEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point cmemchrFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point L543(lines 543 549) no Hoare annotation was computed. [2018-01-21 05:35:37,149 INFO L401 ceAbstractionStarter]: For program point cmemchrErr0EnsuresViolation(lines 540 551) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L404 ceAbstractionStarter]: At program point cmemchrENTRY(lines 540 551) the Hoare annotation is: true [2018-01-21 05:35:37,150 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L404 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: true [2018-01-21 05:35:37,150 INFO L401 ceAbstractionStarter]: For program point L543'(lines 543 549) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L401 ceAbstractionStarter]: For program point L545'(lines 545 548) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,150 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 565) the Hoare annotation is: true [2018-01-21 05:35:37,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,151 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 565) the Hoare annotation is: true [2018-01-21 05:35:37,151 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,151 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 565) the Hoare annotation is: true [2018-01-21 05:35:37,152 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,152 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 565) no Hoare annotation was computed. [2018-01-21 05:35:37,152 INFO L404 ceAbstractionStarter]: At program point L563(line 563) the Hoare annotation is: true [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point L563'(line 563) no Hoare annotation was computed. [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 565) no Hoare annotation was computed. [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-01-21 05:35:37,153 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 565) no Hoare annotation was computed. [2018-01-21 05:35:37,154 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 552 565) the Hoare annotation is: true [2018-01-21 05:35:37,154 INFO L401 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-21 05:35:37,154 INFO L401 ceAbstractionStarter]: For program point L559'(lines 559 561) no Hoare annotation was computed. [2018-01-21 05:35:37,154 INFO L401 ceAbstractionStarter]: For program point L556''(lines 556 558) no Hoare annotation was computed. [2018-01-21 05:35:37,154 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 565) no Hoare annotation was computed. [2018-01-21 05:35:37,157 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:37,158 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:37,158 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:37,158 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:37,158 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:37,158 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:37,158 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:37,158 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:35:37,159 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 05:35:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:35:37,161 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,161 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:35:37,161 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:35:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash 85498, now seen corresponding path program 1 times [2018-01-21 05:35:37,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,163 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:37,190 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:35:37,193 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:37,197 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:37,197 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:37,197 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:37,197 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:37,197 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:37,198 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:37,198 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:37,198 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:35:37,198 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 05:35:37,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 05:35:37,200 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,200 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] [2018-01-21 05:35:37,200 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:37,200 INFO L82 PathProgramCache]: Analyzing trace with hash -207518398, now seen corresponding path program 1 times [2018-01-21 05:35:37,200 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:37,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:35:37,353 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:35:37,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:37,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:35:37,353 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:37,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:35:37,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:35:37,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:35:37,354 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-01-21 05:35:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:37,438 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-01-21 05:35:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:35:37,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 05:35:37,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:37,494 INFO L225 Difference]: With dead ends: 62 [2018-01-21 05:35:37,495 INFO L226 Difference]: Without dead ends: 45 [2018-01-21 05:35:37,495 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:35:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-21 05:35:37,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-01-21 05:35:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 05:35:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-01-21 05:35:37,515 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22 [2018-01-21 05:35:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:37,516 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-01-21 05:35:37,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:35:37,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-01-21 05:35:37,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 05:35:37,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,518 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] [2018-01-21 05:35:37,518 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:37,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1487382076, now seen corresponding path program 1 times [2018-01-21 05:35:37,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:37,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:35:37,607 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:35:37,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:37,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:35:37,608 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:37,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:35:37,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:35:37,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:35:37,610 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 6 states. [2018-01-21 05:35:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:37,665 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-01-21 05:35:37,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 05:35:37,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-21 05:35:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:37,666 INFO L225 Difference]: With dead ends: 47 [2018-01-21 05:35:37,667 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 05:35:37,668 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-21 05:35:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 05:35:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-01-21 05:35:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-01-21 05:35:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-01-21 05:35:37,671 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2018-01-21 05:35:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:37,672 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-01-21 05:35:37,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:35:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-01-21 05:35:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 05:35:37,673 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,673 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] [2018-01-21 05:35:37,673 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash -347713369, now seen corresponding path program 1 times [2018-01-21 05:35:37,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,675 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:37,716 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:35:37,722 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:37,724 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:37,725 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:37,726 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:37,737 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:37,737 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:37,737 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:37,737 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:37,737 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:37,737 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:37,737 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:37,737 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:35:37,738 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-21 05:35:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 05:35:37,740 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,740 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] [2018-01-21 05:35:37,740 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:35:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1108162716, now seen corresponding path program 1 times [2018-01-21 05:35:37,740 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,742 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:37,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:35:37,819 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:35:37,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:37,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:35:37,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:37,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 05:35:37,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 05:35:37,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 05:35:37,820 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-01-21 05:35:37,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:37,863 INFO L93 Difference]: Finished difference Result 62 states and 75 transitions. [2018-01-21 05:35:37,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:35:37,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-21 05:35:37,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:37,865 INFO L225 Difference]: With dead ends: 62 [2018-01-21 05:35:37,865 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 05:35:37,866 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:35:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 05:35:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-01-21 05:35:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-21 05:35:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-01-21 05:35:37,873 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 20 [2018-01-21 05:35:37,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:37,874 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-01-21 05:35:37,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 05:35:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-01-21 05:35:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 05:35:37,875 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:37,875 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] [2018-01-21 05:35:37,875 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:35:37,875 INFO L82 PathProgramCache]: Analyzing trace with hash 521356702, now seen corresponding path program 1 times [2018-01-21 05:35:37,875 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:37,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:37,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:37,877 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:37,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 05:35:37,935 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:35:37,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:37,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 05:35:37,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:37,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:35:37,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:35:37,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:35:37,936 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2018-01-21 05:35:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:37,999 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-01-21 05:35:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 05:35:38,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-21 05:35:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:38,000 INFO L225 Difference]: With dead ends: 32 [2018-01-21 05:35:38,000 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:35:38,001 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:35:38,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:35:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:35:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:35:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:35:38,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 05:35:38,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:38,003 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:35:38,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:35:38,003 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:35:38,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:35:38,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:35:38 BoogieIcfgContainer [2018-01-21 05:35:38,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:35:38,007 INFO L168 Benchmark]: Toolchain (without parser) took 1774.28 ms. Allocated memory was 309.3 MB in the beginning and 452.5 MB in the end (delta: 143.1 MB). Free memory was 268.2 MB in the beginning and 350.4 MB in the end (delta: -82.2 MB). Peak memory consumption was 61.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:38,009 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 309.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:35:38,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.50 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 258.3 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:35:38,009 INFO L168 Benchmark]: Boogie Preprocessor took 34.97 ms. Allocated memory is still 309.3 MB. Free memory was 258.3 MB in the beginning and 256.3 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:35:38,010 INFO L168 Benchmark]: RCFGBuilder took 225.73 ms. Allocated memory is still 309.3 MB. Free memory was 256.3 MB in the beginning and 241.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:38,010 INFO L168 Benchmark]: TraceAbstraction took 1300.59 ms. Allocated memory was 309.3 MB in the beginning and 452.5 MB in the end (delta: 143.1 MB). Free memory was 241.3 MB in the beginning and 350.4 MB in the end (delta: -109.1 MB). Peak memory consumption was 34.0 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:38,012 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.20 ms. Allocated memory is still 309.3 MB. Free memory is still 274.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.50 ms. Allocated memory is still 309.3 MB. Free memory was 268.2 MB in the beginning and 258.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.97 ms. Allocated memory is still 309.3 MB. Free memory was 258.3 MB in the beginning and 256.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 225.73 ms. Allocated memory is still 309.3 MB. Free memory was 256.3 MB in the beginning and 241.3 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1300.59 ms. Allocated memory was 309.3 MB in the beginning and 452.5 MB in the end (delta: 143.1 MB). Free memory was 241.3 MB in the beginning and 350.4 MB in the end (delta: -109.1 MB). Peak memory consumption was 34.0 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: - 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: cmemchrErr0EnsuresViolation CFG has 4 procedures, 32 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s 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, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 32 locations, 4 error locations. UNSAFE Result, 0.0s 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=32occurred 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: [L553] int length = __VERIFIER_nondet_int(); [L554] int n = __VERIFIER_nondet_int(); [L555] int c = __VERIFIER_nondet_int(); [L556] COND TRUE length < 1 [L557] length = 1 VAL [c=0, length=1, n=0] [L559] COND TRUE n < 1 [L560] n = 1 VAL [c=0, length=1, n=1] [L562] EXPR, FCALL __builtin_alloca (n * sizeof(char)) VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, length=1, n=1] [L562] char* nondetArea = (char*) __builtin_alloca (n * sizeof(char)); VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, length=1, n=1, nondetArea={3:0}] [L563] CALL cmemchr(nondetArea, c, n) VAL [\old(c)=0, \old(n)=1, s={3:0}] [L543] COND TRUE n != 0 [L544] const unsigned char *p = s; VAL [\old(c)=0, \old(n)=1, c=0, n=1, p={3:0}, s={3:0}, s={3:0}] [L546] EXPR p++ VAL [\old(c)=0, \old(n)=1, c=0, n=1, p={3:1}, p++=0, p++={3:0}, s={3:0}, s={3:0}] [L546] COND TRUE *p++ == (unsigned char)c [L547] RET return ((void *)(p - 1)); VAL [\old(c)=0, \old(n)=1, \result={3:0}, c=0, n=1, p={3:1}, s={3:0}, s={3:0}] [L563] cmemchr(nondetArea, c, n) VAL [__builtin_alloca (n * sizeof(char))={3:0}, c=0, cmemchr(nondetArea, c, n)={3:0}, length=1, n=1, nondetArea={3:0}] [L564] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 32 locations, 4 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 35 SDslu, 161 SDs, 0 SdLazy, 50 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 2562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 552]: 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, 32 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 28 SDslu, 102 SDs, 0 SdLazy, 54 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 2470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_05-35-38-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_05-35-38-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_05-35-38-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_05-35-38-023.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cmemchr-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_05-35-38-023.csv Received shutdown request...