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_imprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:29:55,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:29:55,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:29:55,836 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:29:55,836 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:29:55,837 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:29:55,839 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:29:55,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:29:55,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:29:55,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:29:55,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:29:55,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:29:55,844 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:29:55,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:29:55,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:29:55,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:29:55,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:29:55,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:29:55,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:29:55,857 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:29:55,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:29:55,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:29:55,859 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:29:55,860 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:29:55,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:29:55,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:29:55,863 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:29:55,863 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:29:55,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:29:55,864 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:29:55,864 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:29:55,865 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_imprecise.epf [2018-01-21 00:29:55,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:29:55,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:29:55,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:29:55,875 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:29:55,876 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:29:55,876 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:29:55,876 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:29:55,876 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:29:55,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:29:55,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:29:55,877 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:29:55,877 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:29:55,878 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:29:55,878 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:29:55,878 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:29:55,878 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:29:55,878 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:29:55,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:29:55,879 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:29:55,879 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:29:55,879 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:29:55,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:29:55,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:29:55,880 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:29:55,880 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:29:55,880 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:29:55,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:29:55,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:29:55,881 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:29:55,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:29:55,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:29:55,882 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:29:55,883 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:29:55,884 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:29:55,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:29:55,933 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:29:55,936 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:29:55,937 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:29:55,938 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:29:55,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:56,093 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:29:56,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:29:56,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:56,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:29:56,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:29:56,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafcbf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56, skipping insertion in model container [2018-01-21 00:29:56,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,120 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:56,158 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:29:56,279 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:56,297 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:29:56,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56 WrapperNode [2018-01-21 00:29:56,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:29:56,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:29:56,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:29:56,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:29:56,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,342 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (1/1) ... [2018-01-21 00:29:56,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:29:56,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:29:56,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:29:56,345 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:29:56,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (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 00:29:56,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:29:56,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:29:56,410 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-21 00:29:56,411 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:29:56,411 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:29:56,412 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-21 00:29:56,412 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:29:56,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:29:56,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:29:56,623 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:29:56,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:56 BoogieIcfgContainer [2018-01-21 00:29:56,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:29:56,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:29:56,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:29:56,629 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:29:56,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:29:56" (1/3) ... [2018-01-21 00:29:56,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fff0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:56, skipping insertion in model container [2018-01-21 00:29:56,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:29:56" (2/3) ... [2018-01-21 00:29:56,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fff0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:29:56, skipping insertion in model container [2018-01-21 00:29:56,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:29:56" (3/3) ... [2018-01-21 00:29:56,632 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:29:56,639 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:29:56,646 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:29:56,691 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:56,691 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:56,691 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:56,692 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:56,692 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:56,692 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:56,692 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:56,692 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrncpyErr0EnsuresViolation======== [2018-01-21 00:29:56,693 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 00:29:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:29:56,720 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:56,721 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:56,721 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr0EnsuresViolation]=== [2018-01-21 00:29:56,726 INFO L82 PathProgramCache]: Analyzing trace with hash -863788705, now seen corresponding path program 1 times [2018-01-21 00:29:56,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:56,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:56,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:56,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:56,779 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:56,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:56,882 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 00:29:56,884 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:56,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:56,884 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:56,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:56,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:56,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:56,902 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-21 00:29:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:56,926 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-01-21 00:29:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:56,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 00:29:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:56,936 INFO L225 Difference]: With dead ends: 55 [2018-01-21 00:29:56,936 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:56,941 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 00:29:57,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:57,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 00:29:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:57,051 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:57,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:57,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:57,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:29:57,082 INFO L401 ceAbstractionStarter]: For program point L551'(lines 551 552) no Hoare annotation was computed. [2018-01-21 00:29:57,082 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 555) no Hoare annotation was computed. [2018-01-21 00:29:57,082 INFO L404 ceAbstractionStarter]: At program point cstrncpyENTRY(lines 540 557) the Hoare annotation is: true [2018-01-21 00:29:57,082 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point cstrncpyFINAL(lines 540 557) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point cstrncpyErr0EnsuresViolation(lines 540 557) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point L551(lines 551 552) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-21 00:29:57,083 INFO L401 ceAbstractionStarter]: For program point cstrncpyEXIT(lines 540 557) no Hoare annotation was computed. [2018-01-21 00:29:57,084 INFO L404 ceAbstractionStarter]: At program point L551'''(lines 551 552) the Hoare annotation is: true [2018-01-21 00:29:57,084 INFO L404 ceAbstractionStarter]: At program point L546''(lines 546 555) the Hoare annotation is: true [2018-01-21 00:29:57,084 INFO L401 ceAbstractionStarter]: For program point L546'''(lines 546 555) no Hoare annotation was computed. [2018-01-21 00:29:57,084 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-21 00:29:57,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,084 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,085 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 572) the Hoare annotation is: true [2018-01-21 00:29:57,085 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,085 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 572) the Hoare annotation is: true [2018-01-21 00:29:57,085 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,085 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 572) the Hoare annotation is: true [2018-01-21 00:29:57,085 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 572) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point L561(lines 561 563) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-21 00:29:57,086 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 558 572) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point L568'''(line 568) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point L564'(lines 564 566) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 558 572) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 558 572) no Hoare annotation was computed. [2018-01-21 00:29:57,087 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 558 572) the Hoare annotation is: true [2018-01-21 00:29:57,088 INFO L401 ceAbstractionStarter]: For program point L561''(lines 561 563) no Hoare annotation was computed. [2018-01-21 00:29:57,088 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-21 00:29:57,088 INFO L404 ceAbstractionStarter]: At program point L569'(line 569) the Hoare annotation is: true [2018-01-21 00:29:57,088 INFO L401 ceAbstractionStarter]: For program point L567''(line 567) no Hoare annotation was computed. [2018-01-21 00:29:57,088 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-21 00:29:57,092 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:57,092 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:57,092 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:57,092 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:57,092 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:57,093 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:57,093 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:57,093 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:29:57,093 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 00:29:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:29:57,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:57,095 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:29:57,096 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:29:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash 101226, now seen corresponding path program 1 times [2018-01-21 00:29:57,096 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:57,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:57,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,098 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:57,128 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:57,132 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:57,136 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:57,136 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:57,136 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:57,137 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:57,137 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:57,137 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:57,137 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:57,137 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:29:57,137 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 00:29:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:29:57,141 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:57,141 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 00:29:57,141 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1088900075, now seen corresponding path program 1 times [2018-01-21 00:29:57,142 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:57,142 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,142 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:57,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,143 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:57,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:57,188 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 00:29:57,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:57,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:57,189 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:57,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:57,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:57,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:57,190 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-21 00:29:57,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:57,195 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-01-21 00:29:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:57,196 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:29:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:57,200 INFO L225 Difference]: With dead ends: 55 [2018-01-21 00:29:57,200 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 00:29:57,200 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 00:29:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 00:29:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 00:29:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 00:29:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-21 00:29:57,210 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 27 [2018-01-21 00:29:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:57,210 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-21 00:29:57,210 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-21 00:29:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 00:29:57,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:57,211 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, 1] [2018-01-21 00:29:57,211 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:57,212 INFO L82 PathProgramCache]: Analyzing trace with hash -145997304, now seen corresponding path program 1 times [2018-01-21 00:29:57,212 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:57,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:57,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,213 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:57,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:57,323 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 00:29:57,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:57,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:29:57,324 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:57,326 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:29:57,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:29:57,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:29:57,326 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-01-21 00:29:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:57,383 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-21 00:29:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:57,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-21 00:29:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:57,385 INFO L225 Difference]: With dead ends: 51 [2018-01-21 00:29:57,385 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 00:29:57,386 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 00:29:57,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 00:29:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-21 00:29:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 00:29:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-01-21 00:29:57,392 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 28 [2018-01-21 00:29:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:57,392 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-01-21 00:29:57,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:29:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-01-21 00:29:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:29:57,394 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:57,394 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:57,394 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 197922362, now seen corresponding path program 1 times [2018-01-21 00:29:57,395 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:57,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:57,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:57,396 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:57,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:57,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:57,687 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:29:57,688 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-01-21 00:29:57,690 INFO L201 CegarAbsIntRunner]: [0], [4], [8], [10], [11], [12], [33], [37], [38], [40], [41], [46], [47], [50], [56], [60], [61], [62], [63], [64], [66], [67], [68], [69], [70], [71], [73], [74], [75], [76], [77], [78] [2018-01-21 00:29:57,743 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:29:57,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:29:58,154 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:29:58,156 INFO L268 AbstractInterpreter]: Visited 32 different actions 63 times. Merged at 15 different actions 29 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 35 variables. [2018-01-21 00:29:58,175 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:29:58,175 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:29:58,175 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:29:58,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:58,186 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:29:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:58,229 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:29:58,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-21 00:29:58,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-21 00:29:58,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:58,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:58,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:29:58,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2018-01-21 00:29:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:58,383 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:29:58,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-21 00:29:58,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-21 00:29:58,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:29:58,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:58,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:29:58,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:3 [2018-01-21 00:29:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:29:58,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-21 00:29:58,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 15 [2018-01-21 00:29:58,754 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:58,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:29:58,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:29:58,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-01-21 00:29:58,755 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 9 states. [2018-01-21 00:29:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:59,022 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-01-21 00:29:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:29:59,022 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-01-21 00:29:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:59,025 INFO L225 Difference]: With dead ends: 73 [2018-01-21 00:29:59,025 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 00:29:59,026 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2018-01-21 00:29:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 00:29:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-01-21 00:29:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 00:29:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-01-21 00:29:59,038 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 33 [2018-01-21 00:29:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:59,038 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-01-21 00:29:59,038 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:29:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-01-21 00:29:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:29:59,040 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:59,040 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:59,040 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:29:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2121150396, now seen corresponding path program 1 times [2018-01-21 00:29:59,041 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:59,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:59,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,042 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:29:59,084 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:29:59,092 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:59,097 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:59,099 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:59,099 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:29:59,112 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:29:59,112 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:29:59,112 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:29:59,112 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:29:59,112 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:29:59,112 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:29:59,112 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:29:59,113 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:29:59,113 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:29:59,114 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-01-21 00:29:59,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:29:59,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:59,115 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 00:29:59,115 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -23479436, now seen corresponding path program 1 times [2018-01-21 00:29:59,115 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:59,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:59,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,116 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:59,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:59,137 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 00:29:59,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:59,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:29:59,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:59,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:29:59,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:29:59,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:29:59,139 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-01-21 00:29:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:59,143 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-01-21 00:29:59,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:29:59,143 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 00:29:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:59,144 INFO L225 Difference]: With dead ends: 55 [2018-01-21 00:29:59,144 INFO L226 Difference]: Without dead ends: 35 [2018-01-21 00:29:59,145 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 00:29:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-21 00:29:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-21 00:29:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-21 00:29:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-01-21 00:29:59,149 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 25 [2018-01-21 00:29:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:59,149 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-01-21 00:29:59,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:29:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-01-21 00:29:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:29:59,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:59,150 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] [2018-01-21 00:29:59,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash -902944217, now seen corresponding path program 1 times [2018-01-21 00:29:59,151 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:59,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:59,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,152 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:59,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:59,200 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 00:29:59,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:59,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:29:59,201 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:59,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:29:59,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:29:59,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:29:59,202 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-01-21 00:29:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:59,243 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-21 00:29:59,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:29:59,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-21 00:29:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:59,244 INFO L225 Difference]: With dead ends: 47 [2018-01-21 00:29:59,244 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 00:29:59,245 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 00:29:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 00:29:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 00:29:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 00:29:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-21 00:29:59,249 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 26 [2018-01-21 00:29:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:59,249 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-21 00:29:59,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:29:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-21 00:29:59,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:29:59,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:59,250 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:59,250 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:59,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1010260697, now seen corresponding path program 1 times [2018-01-21 00:29:59,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:59,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:59,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:59,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:29:59,532 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:59,532 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:29:59,532 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:59,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:29:59,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:29:59,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:29:59,534 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-01-21 00:29:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:59,754 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-21 00:29:59,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:29:59,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-21 00:29:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:59,755 INFO L225 Difference]: With dead ends: 50 [2018-01-21 00:29:59,755 INFO L226 Difference]: Without dead ends: 37 [2018-01-21 00:29:59,756 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:29:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-21 00:29:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-21 00:29:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-21 00:29:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-01-21 00:29:59,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 31 [2018-01-21 00:29:59,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:59,761 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-01-21 00:29:59,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:29:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-01-21 00:29:59,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:29:59,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:29:59,762 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:29:59,762 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:29:59,762 INFO L82 PathProgramCache]: Analyzing trace with hash 876247191, now seen corresponding path program 1 times [2018-01-21 00:29:59,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:29:59,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,763 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:29:59,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:29:59,763 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:29:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:29:59,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:29:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:29:59,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:29:59,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:29:59,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:29:59,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:29:59,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:29:59,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:29:59,873 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 6 states. [2018-01-21 00:29:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:29:59,955 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-01-21 00:29:59,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 00:29:59,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-21 00:29:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:29:59,956 INFO L225 Difference]: With dead ends: 37 [2018-01-21 00:29:59,956 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:29:59,956 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:29:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:29:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:29:59,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:29:59,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:29:59,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-21 00:29:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:29:59,957 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:29:59,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:29:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:29:59,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:29:59,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:29:59 BoogieIcfgContainer [2018-01-21 00:29:59,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:29:59,960 INFO L168 Benchmark]: Toolchain (without parser) took 3866.61 ms. Allocated memory was 307.2 MB in the beginning and 526.4 MB in the end (delta: 219.2 MB). Free memory was 264.0 MB in the beginning and 429.3 MB in the end (delta: -165.3 MB). Peak memory consumption was 53.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:59,961 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 307.2 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:29:59,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.63 ms. Allocated memory is still 307.2 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:59,962 INFO L168 Benchmark]: Boogie Preprocessor took 38.56 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:59,962 INFO L168 Benchmark]: RCFGBuilder took 278.98 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 235.1 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:59,962 INFO L168 Benchmark]: TraceAbstraction took 3334.80 ms. Allocated memory was 307.2 MB in the beginning and 526.4 MB in the end (delta: 219.2 MB). Free memory was 235.1 MB in the beginning and 429.3 MB in the end (delta: -194.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:29:59,963 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 307.2 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 207.63 ms. Allocated memory is still 307.2 MB. Free memory was 264.0 MB in the beginning and 254.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.56 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 252.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 278.98 ms. Allocated memory is still 307.2 MB. Free memory was 252.0 MB in the beginning and 235.1 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3334.80 ms. Allocated memory was 307.2 MB in the beginning and 526.4 MB in the end (delta: 219.2 MB). Free memory was 235.1 MB in the beginning and 429.3 MB in the end (delta: -194.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 31 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 328 LocStat_NO_SUPPORTING_DISEQUALITIES : 69 LocStat_NO_DISJUNCTIONS : -62 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 38 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 70 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.502009 RENAME_VARIABLES(MILLISECONDS) : 0.031411 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.243043 PROJECTAWAY(MILLISECONDS) : 0.700972 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001722 DISJOIN(MILLISECONDS) : 0.749528 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.060231 ADD_EQUALITY(MILLISECONDS) : 0.059284 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.020271 #CONJOIN_DISJUNCTIVE : 113 #RENAME_VARIABLES : 227 #UNFREEZE : 0 #CONJOIN : 196 #PROJECTAWAY : 178 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 227 #ADD_EQUALITY : 72 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * 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: cstrncpyErr0EnsuresViolation CFG has 4 procedures, 41 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 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=41occurred 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, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 8 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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, 41 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=41occurred 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: [L559] int length = __VERIFIER_nondet_int(); [L560] int n = __VERIFIER_nondet_int(); [L561] COND FALSE !(length < 1) VAL [length=3, n=0] [L564] COND TRUE n < 1 [L565] n = 1 VAL [length=3, n=1] [L567] EXPR, FCALL __builtin_alloca (n * sizeof(char)) VAL [__builtin_alloca (n * sizeof(char))={6:0}, length=3, n=1] [L567] char* nondetArea = (char*) __builtin_alloca (n * sizeof(char)); VAL [__builtin_alloca (n * sizeof(char))={6:0}, length=3, n=1, nondetArea={6:0}] [L568] EXPR, FCALL __builtin_alloca (length * sizeof(char)) VAL [__builtin_alloca (length * sizeof(char))={5:0}, __builtin_alloca (n * sizeof(char))={6:0}, length=3, n=1, nondetArea={6:0}] [L568] char* nondetString = (char*) __builtin_alloca (length * sizeof(char)); VAL [__builtin_alloca (length * sizeof(char))={5:0}, __builtin_alloca (n * sizeof(char))={6:0}, length=3, n=1, nondetArea={6:0}, nondetString={5:0}] [L569] FCALL nondetString[length-1] = '\0' VAL [__builtin_alloca (length * sizeof(char))={5:0}, __builtin_alloca (n * sizeof(char))={6:0}, length=3, n=1, nondetArea={6:0}, nondetString={5:0}] [L570] CALL cstrncpy(nondetArea, nondetString, n) VAL [\old(n)=1, s1={6:0}, s2={5:0}] [L542] char *dst = s1; [L543] const char *src = s2; [L544] char *us; [L545] int n2; VAL [\old(n)=1, dst={6:0}, n=1, s1={6:0}, s1={6:0}, s2={5:0}, s2={5:0}, src={5:0}] [L546] COND TRUE n > 0 [L547] n-- [L548] EXPR dst++ [L548] EXPR src++ VAL [\old(n)=1, dst={6:1}, dst++={6:0}, n=0, s1={6:0}, s1={6:0}, s2={5:0}, s2={5:0}, src={5:1}, src++=7src++={5:0}] [L548] EXPR, FCALL *dst++ = *src++ VAL [\old(n)=1, dst={6:1}, dst++={6:0}, n=0, s1={6:0}, s1={6:0}, s2={5:0}, s2={5:0}, src={5:1}, src++=7src++={5:0}] [L548] COND FALSE !((*dst++ = *src++) == '\0') [L546] COND FALSE !(n > 0) VAL [\old(n)=1, dst={6:1}, n=0, s1={6:0}, s1={6:0}, s2={5:0}, s2={5:0}, src={5:1}] [L556] RET return s1; VAL [\old(n)=1, \result={6:0}, dst={6:1}, n=0, s1={6:0}, s1={6:0}, s2={5:0}, s2={5:0}, src={5:1}] [L570] cstrncpy(nondetArea, nondetString, n) VAL [__builtin_alloca (length * sizeof(char))={5:0}, __builtin_alloca (n * sizeof(char))={6:0}, cstrncpy(nondetArea, nondetString, n)={6:0}, length=3, n=1, nondetArea={6:0}, nondetString={5:0}] [L571] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 41 locations, 4 error locations. UNSAFE Result, 1.9s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 132 SDtfs, 74 SDslu, 306 SDs, 0 SdLazy, 122 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 149 ConstructedInterpolants, 0 QuantifiedInterpolants, 17871 SizeOfPredicates, 9 NumberOfNonLiveVariables, 139 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 558]: 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, 41 locations, 4 error locations. SAFE Result, 0.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 48 SDslu, 146 SDs, 0 SdLazy, 301 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 12281 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 551]: 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/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-29-59-971.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-29-59-971.csv Received shutdown request...