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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 05:35:56,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 05:35:56,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 05:35:56,051 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 05:35:56,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 05:35:56,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 05:35:56,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 05:35:56,055 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 05:35:56,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 05:35:56,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 05:35:56,059 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 05:35:56,059 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 05:35:56,060 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 05:35:56,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 05:35:56,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 05:35:56,065 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 05:35:56,067 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 05:35:56,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 05:35:56,070 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 05:35:56,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 05:35:56,074 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 05:35:56,074 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 05:35:56,074 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 05:35:56,075 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 05:35:56,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 05:35:56,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 05:35:56,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 05:35:56,079 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 05:35:56,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 05:35:56,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 05:35:56,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 05:35:56,080 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:56,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 05:35:56,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 05:35:56,090 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 05:35:56,090 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 05:35:56,090 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 05:35:56,090 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 05:35:56,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 05:35:56,090 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 05:35:56,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 05:35:56,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 05:35:56,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 05:35:56,091 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 05:35:56,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 05:35:56,091 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 05:35:56,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 05:35:56,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 05:35:56,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 05:35:56,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 05:35:56,093 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 05:35:56,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 05:35:56,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 05:35:56,094 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 05:35:56,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 05:35:56,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 05:35:56,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 05:35:56,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 05:35:56,096 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 05:35:56,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 05:35:56,140 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 05:35:56,143 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 05:35:56,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 05:35:56,145 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 05:35:56,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:35:56,327 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 05:35:56,334 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 05:35:56,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 05:35:56,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 05:35:56,341 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 05:35:56,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:35:56" (1/1) ... [2018-01-21 05:35:56,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f719072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:56, skipping insertion in model container [2018-01-21 05:35:56,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 05:35:56" (1/1) ... [2018-01-21 05:35:56,362 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:35:56,407 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 05:35:56,542 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:35:56,565 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 05:35:56,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:56 WrapperNode [2018-01-21 05:35:56,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 05:35:56,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 05:35:56,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 05:35:56,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 05:35:56,589 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:56" (1/1) ... [2018-01-21 05:35:56,589 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:56" (1/1) ... [2018-01-21 05:35:56,599 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:56" (1/1) ... [2018-01-21 05:35:56,600 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:56" (1/1) ... [2018-01-21 05:35:56,605 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:56" (1/1) ... [2018-01-21 05:35:56,610 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:56" (1/1) ... [2018-01-21 05:35:56,611 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:56" (1/1) ... [2018-01-21 05:35:56,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 05:35:56,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 05:35:56,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 05:35:56,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 05:35:56,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35: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 05:35:56,670 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 05:35:56,670 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 05:35:56,670 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-21 05:35:56,670 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 05:35:56,670 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 05:35:56,670 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-21 05:35:56,671 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 05:35:56,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 05:35:56,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 05:35:56,866 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 05:35:56,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:35:56 BoogieIcfgContainer [2018-01-21 05:35:56,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 05:35:56,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 05:35:56,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 05:35:56,869 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 05:35:56,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 05:35:56" (1/3) ... [2018-01-21 05:35:56,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f66d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:35:56, skipping insertion in model container [2018-01-21 05:35:56,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 05:35:56" (2/3) ... [2018-01-21 05:35:56,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f66d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 05:35:56, skipping insertion in model container [2018-01-21 05:35:56,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 05:35:56" (3/3) ... [2018-01-21 05:35:56,872 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-21 05:35:56,879 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 05:35:56,886 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 05:35:56,929 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:56,929 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:56,930 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:56,930 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:56,930 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:56,930 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:56,930 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:56,930 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrlcpyErr0EnsuresViolation======== [2018-01-21 05:35:56,931 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-21 05:35:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 05:35:56,954 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:56,955 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:56,955 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr0EnsuresViolation]=== [2018-01-21 05:35:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1347338006, now seen corresponding path program 1 times [2018-01-21 05:35:56,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:57,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:57,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,005 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:57,083 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:57,142 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:57,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:57,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-01-21 05:35:57,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:57,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 05:35:57,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 05:35:57,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 05:35:57,168 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-01-21 05:35:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:57,280 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2018-01-21 05:35:57,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 05:35:57,282 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 05:35:57,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:57,289 INFO L225 Difference]: With dead ends: 67 [2018-01-21 05:35:57,289 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:35:57,292 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:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:35:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:35:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:35:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:35:57,315 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 05:35:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:57,315 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:35:57,315 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 05:35:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:35:57,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:35:57,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 05:35:57,339 INFO L404 ceAbstractionStarter]: At program point cstrlcpyENTRY(lines 540 559) the Hoare annotation is: true [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point cstrlcpyFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point L546'(lines 546 551) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point cstrlcpyErr0EnsuresViolation(lines 540 559) no Hoare annotation was computed. [2018-01-21 05:35:57,340 INFO L401 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-21 05:35:57,341 INFO L401 ceAbstractionStarter]: For program point L547'(lines 547 550) no Hoare annotation was computed. [2018-01-21 05:35:57,341 INFO L404 ceAbstractionStarter]: At program point L547'''(lines 547 550) the Hoare annotation is: true [2018-01-21 05:35:57,341 INFO L401 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-21 05:35:57,341 INFO L401 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-21 05:35:57,341 INFO L401 ceAbstractionStarter]: For program point L553(lines 553 554) no Hoare annotation was computed. [2018-01-21 05:35:57,341 INFO L401 ceAbstractionStarter]: For program point L552(lines 552 557) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point L555(lines 555 556) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point cstrlcpyEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point L555''''(lines 555 556) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,342 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,343 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 575) the Hoare annotation is: true [2018-01-21 05:35:57,343 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,343 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 575) the Hoare annotation is: true [2018-01-21 05:35:57,343 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,343 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 575) the Hoare annotation is: true [2018-01-21 05:35:57,343 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point L571'(line 571) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point L566'(lines 566 568) no Hoare annotation was computed. [2018-01-21 05:35:57,344 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 560 575) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L401 ceAbstractionStarter]: For program point L570'''(line 570) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L401 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-01-21 05:35:57,345 INFO L404 ceAbstractionStarter]: At program point L572(line 572) the Hoare annotation is: true [2018-01-21 05:35:57,346 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 560 575) no Hoare annotation was computed. [2018-01-21 05:35:57,346 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 560 575) no Hoare annotation was computed. [2018-01-21 05:35:57,346 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 560 575) the Hoare annotation is: true [2018-01-21 05:35:57,346 INFO L401 ceAbstractionStarter]: For program point L563''(lines 563 565) no Hoare annotation was computed. [2018-01-21 05:35:57,346 INFO L401 ceAbstractionStarter]: For program point L569''(line 569) no Hoare annotation was computed. [2018-01-21 05:35:57,346 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-21 05:35:57,350 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:57,350 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:57,350 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:57,350 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:57,351 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:57,351 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:57,351 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:57,351 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 05:35:57,351 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-21 05:35:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 05:35:57,354 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:57,354 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 05:35:57,354 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 05:35:57,354 INFO L82 PathProgramCache]: Analyzing trace with hash 120061, now seen corresponding path program 1 times [2018-01-21 05:35:57,355 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:57,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:57,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,356 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:57,388 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:35:57,393 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:57,398 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:57,398 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:57,398 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:57,398 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:57,398 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:57,398 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:57,398 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:57,398 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 05:35:57,398 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-21 05:35:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 05:35:57,401 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:57,401 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, 1] [2018-01-21 05:35:57,402 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:57,402 INFO L82 PathProgramCache]: Analyzing trace with hash 621811580, now seen corresponding path program 1 times [2018-01-21 05:35:57,402 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:57,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,403 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:57,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,403 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:57,435 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:57,491 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:57,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:57,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 05:35:57,492 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:57,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 05:35:57,493 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 05:35:57,493 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:35:57,493 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-21 05:35:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:57,528 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-01-21 05:35:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 05:35:57,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-21 05:35:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:57,534 INFO L225 Difference]: With dead ends: 71 [2018-01-21 05:35:57,535 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 05:35:57,535 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:35:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 05:35:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-21 05:35:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 05:35:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-01-21 05:35:57,548 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 29 [2018-01-21 05:35:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:57,549 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-01-21 05:35:57,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 05:35:57,549 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-01-21 05:35:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 05:35:57,550 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:57,550 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:35:57,550 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1767468765, now seen corresponding path program 1 times [2018-01-21 05:35:57,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:57,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:57,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:57,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:57,580 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:57,857 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:57,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:57,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 05:35:57,858 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:57,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 05:35:57,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 05:35:57,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-21 05:35:57,861 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 7 states. [2018-01-21 05:35:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:58,087 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-01-21 05:35:58,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 05:35:58,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-21 05:35:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:58,091 INFO L225 Difference]: With dead ends: 90 [2018-01-21 05:35:58,091 INFO L226 Difference]: Without dead ends: 81 [2018-01-21 05:35:58,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-21 05:35:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-21 05:35:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2018-01-21 05:35:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-21 05:35:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-01-21 05:35:58,114 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 32 [2018-01-21 05:35:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:58,114 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-01-21 05:35:58,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 05:35:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-01-21 05:35:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 05:35:58,117 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:58,117 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, 1, 1, 1, 1] [2018-01-21 05:35:58,117 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:58,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1626920155, now seen corresponding path program 1 times [2018-01-21 05:35:58,118 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:58,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:58,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,119 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:58,139 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:58,226 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:58,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:58,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 05:35:58,227 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:58,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 05:35:58,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 05:35:58,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:35:58,228 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 4 states. [2018-01-21 05:35:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:58,289 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-01-21 05:35:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 05:35:58,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-01-21 05:35:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:58,292 INFO L225 Difference]: With dead ends: 89 [2018-01-21 05:35:58,292 INFO L226 Difference]: Without dead ends: 74 [2018-01-21 05:35:58,292 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-21 05:35:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-21 05:35:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2018-01-21 05:35:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 05:35:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-01-21 05:35:58,302 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 32 [2018-01-21 05:35:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:58,302 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-01-21 05:35:58,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 05:35:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2018-01-21 05:35:58,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 05:35:58,303 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:58,303 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, 1, 1, 1, 1, 1, 1] [2018-01-21 05:35:58,304 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:58,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1494185038, now seen corresponding path program 1 times [2018-01-21 05:35:58,304 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:58,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:58,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,305 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:58,323 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:58,418 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:58,419 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:58,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 05:35:58,419 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:58,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:35:58,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:35:58,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:35:58,420 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 6 states. [2018-01-21 05:35:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:58,480 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-01-21 05:35:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 05:35:58,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-21 05:35:58,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:58,482 INFO L225 Difference]: With dead ends: 90 [2018-01-21 05:35:58,482 INFO L226 Difference]: Without dead ends: 67 [2018-01-21 05:35:58,483 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:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-21 05:35:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-21 05:35:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-21 05:35:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-01-21 05:35:58,490 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 34 [2018-01-21 05:35:58,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:58,490 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-01-21 05:35:58,491 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:35:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-01-21 05:35:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 05:35:58,492 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:58,492 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, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:35:58,493 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 05:35:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1459560073, now seen corresponding path program 1 times [2018-01-21 05:35:58,493 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:58,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,494 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:58,494 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,495 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 05:35:58,556 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 05:35:58,565 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:58,572 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:58,574 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:58,575 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 05:35:58,593 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 05:35:58,594 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 05:35:58,594 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 05:35:58,594 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 05:35:58,594 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 05:35:58,594 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 05:35:58,594 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 05:35:58,595 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 05:35:58,595 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 05:35:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-21 05:35:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 05:35:58,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:58,598 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 05:35:58,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 05:35:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash -276447620, now seen corresponding path program 1 times [2018-01-21 05:35:58,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:58,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:58,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,600 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:58,608 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:58,634 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:58,635 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:58,635 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 05:35:58,635 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:58,635 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 05:35:58,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 05:35:58,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:35:58,636 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-21 05:35:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:58,660 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-01-21 05:35:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 05:35:58,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 05:35:58,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:58,662 INFO L225 Difference]: With dead ends: 71 [2018-01-21 05:35:58,662 INFO L226 Difference]: Without dead ends: 44 [2018-01-21 05:35:58,663 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 05:35:58,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-21 05:35:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-01-21 05:35:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 05:35:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-01-21 05:35:58,669 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 27 [2018-01-21 05:35:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:58,669 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-01-21 05:35:58,669 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 05:35:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-01-21 05:35:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 05:35:58,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 05:35:58,671 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, 1, 1] [2018-01-21 05:35:58,671 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 05:35:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash -538151453, now seen corresponding path program 1 times [2018-01-21 05:35:58,672 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 05:35:58,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 05:35:58,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 05:35:58,673 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 05:35:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 05:35:58,700 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:58,881 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:58,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 05:35:58,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 05:35:58,882 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 05:35:58,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 05:35:58,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 05:35:58,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 05:35:58,883 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 6 states. [2018-01-21 05:35:59,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 05:35:59,164 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-01-21 05:35:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 05:35:59,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-21 05:35:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 05:35:59,165 INFO L225 Difference]: With dead ends: 41 [2018-01-21 05:35:59,165 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 05:35:59,166 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-21 05:35:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 05:35:59,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 05:35:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 05:35:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 05:35:59,167 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-01-21 05:35:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 05:35:59,167 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 05:35:59,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 05:35:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 05:35:59,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 05:35:59,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 05:35:59 BoogieIcfgContainer [2018-01-21 05:35:59,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 05:35:59,172 INFO L168 Benchmark]: Toolchain (without parser) took 2844.16 ms. Allocated memory was 304.6 MB in the beginning and 483.4 MB in the end (delta: 178.8 MB). Free memory was 262.9 MB in the beginning and 424.2 MB in the end (delta: -161.2 MB). Peak memory consumption was 17.5 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:59,174 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:35:59,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.43 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:59,174 INFO L168 Benchmark]: Boogie Preprocessor took 39.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.8 MB in the beginning and 249.8 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:59,175 INFO L168 Benchmark]: RCFGBuilder took 252.26 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 232.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. [2018-01-21 05:35:59,175 INFO L168 Benchmark]: TraceAbstraction took 2303.99 ms. Allocated memory was 304.6 MB in the beginning and 483.4 MB in the end (delta: 178.8 MB). Free memory was 232.2 MB in the beginning and 424.2 MB in the end (delta: -192.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 05:35:59,177 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.43 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 251.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 252.26 ms. Allocated memory is still 304.6 MB. Free memory was 249.8 MB in the beginning and 232.2 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2303.99 ms. Allocated memory was 304.6 MB in the beginning and 483.4 MB in the end (delta: 178.8 MB). Free memory was 232.2 MB in the beginning and 424.2 MB in the end (delta: -192.0 MB). There was no memory consumed. 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: cstrlcpyErr0EnsuresViolation CFG has 4 procedures, 46 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 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=46occurred 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 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, 46 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=46occurred 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: [L561] int length = __VERIFIER_nondet_int(); [L562] int n = __VERIFIER_nondet_int(); [L563] COND TRUE length < 1 [L564] length = 1 VAL [length=1, n=2] [L566] COND FALSE !(n < 1) VAL [length=1, n=2] [L569] EXPR, FCALL __builtin_alloca (n * sizeof(char)) VAL [__builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2] [L569] char* nondetString1 = (char*) __builtin_alloca (n * sizeof(char)); VAL [__builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2, nondetString1={5:0}] [L570] EXPR, FCALL __builtin_alloca (length * sizeof(char)) VAL [__builtin_alloca (length * sizeof(char))={4:0}, __builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2, nondetString1={5:0}] [L570] char* nondetString2 = (char*) __builtin_alloca (length * sizeof(char)); VAL [__builtin_alloca (length * sizeof(char))={4:0}, __builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2, nondetString1={5:0}, nondetString2={4:0}] [L571] FCALL nondetString1[n-1] = '\0' VAL [__builtin_alloca (length * sizeof(char))={4:0}, __builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2, nondetString1={5:0}, nondetString2={4:0}] [L572] FCALL nondetString2[length-1] = '\0' VAL [__builtin_alloca (length * sizeof(char))={4:0}, __builtin_alloca (n * sizeof(char))={5:0}, length=1, n=2, nondetString1={5:0}, nondetString2={4:0}] [L573] CALL cstrlcpy(nondetString1, nondetString2, n) VAL [\old(siz)=2, dst={5:0}, src={4:0}] [L543] char *d = dst; [L544] const char *s = src; [L545] size_t n = siz; VAL [\old(siz)=2, d={5:0}, dst={5:0}, dst={5:0}, n=2, s={4:0}, siz=2, src={4:0}, src={4:0}] [L546] COND TRUE n != 0 VAL [\old(siz)=2, d={5:0}, dst={5:0}, dst={5:0}, n=2, s={4:0}, siz=2, src={4:0}, src={4:0}] [L547] EXPR --n VAL [--n=1, \old(siz)=2, d={5:0}, dst={5:0}, dst={5:0}, n=1, s={4:0}, siz=2, src={4:0}, src={4:0}] [L547] COND TRUE --n != 0 [L548] EXPR d++ [L548] EXPR s++ VAL [\old(siz)=2, d={5:1}, d++={5:0}, dst={5:0}, dst={5:0}, n=1, s={4:1}, s++=0, s++={4:0}, siz=2, src={4:0}, src={4:0}] [L548] EXPR, FCALL *d++ = *s++ VAL [\old(siz)=2, d={5:1}, d++={5:0}, dst={5:0}, dst={5:0}, n=1, s={4:1}, s++=0, s++={4:0}, siz=2, src={4:0}, src={4:0}] [L548] COND TRUE (*d++ = *s++) == '\0' [L552] COND FALSE !(n == 0) VAL [\old(siz)=2, d={5:1}, dst={5:0}, dst={5:0}, n=1, s={4:1}, siz=2, src={4:0}, src={4:0}] [L558] RET return(s - src - 1); VAL [\old(siz)=2, \result=0, d={5:1}, dst={5:0}, dst={5:0}, n=1, s={4:1}, siz=2, src={4:0}, src={4:0}] [L573] cstrlcpy(nondetString1, nondetString2, n) VAL [__builtin_alloca (length * sizeof(char))={4:0}, __builtin_alloca (n * sizeof(char))={5:0}, cstrlcpy(nondetString1, nondetString2, n)=0, length=1, n=2, nondetString1={5:0}, nondetString2={4:0}] [L574] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 46 locations, 4 error locations. UNSAFE Result, 1.1s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 193 SDtfs, 133 SDslu, 376 SDs, 0 SdLazy, 96 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, 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, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 12087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 560]: 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, 46 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 36 SDslu, 65 SDs, 0 SdLazy, 125 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 6429 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: 547]: 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_cstrlcpy-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-59-187.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-59-187.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-59-187.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-59-187.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-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-59-187.csv Received shutdown request...