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/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:30:34,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:30:34,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:30:34,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:30:34,881 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:30:34,882 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:30:34,883 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:30:34,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:30:34,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:30:34,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:30:34,889 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:30:34,889 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:30:34,890 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:30:34,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:30:34,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:30:34,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:30:34,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:30:34,900 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:30:34,901 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:30:34,902 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:30:34,905 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:30:34,905 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:30:34,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:30:34,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:30:34,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:30:34,909 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:30:34,909 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:30:34,910 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:30:34,910 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:30:34,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:30:34,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:30:34,911 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:30:34,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:30:34,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:30:34,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:30:34,921 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:30:34,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:30:34,921 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:30:34,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:30:34,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:30:34,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:30:34,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:30:34,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:30:34,922 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:30:34,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:30:34,924 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:30:34,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:30:34,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:30:34,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:30:34,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:30:34,924 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:30:34,925 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:30:34,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:30:34,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:30:34,925 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:30:34,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:30:34,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:30:34,926 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:30:34,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:30:34,927 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:30:34,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:30:34,972 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:30:34,976 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:30:34,978 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:30:34,978 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:30:34,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:35,160 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:30:35,165 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:30:35,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:35,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:30:35,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:30:35,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793dbc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35, skipping insertion in model container [2018-01-21 00:30:35,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,197 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:35,237 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:30:35,365 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:35,380 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:30:35,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35 WrapperNode [2018-01-21 00:30:35,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:30:35,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:30:35,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:30:35,389 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:30:35,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (1/1) ... [2018-01-21 00:30:35,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:30:35,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:30:35,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:30:35,421 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:30:35,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (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:30:35,467 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:30:35,467 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:30:35,467 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-01-21 00:30:35,467 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:30:35,467 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:30:35,468 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:30:35,650 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:30:35,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:35 BoogieIcfgContainer [2018-01-21 00:30:35,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:30:35,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:30:35,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:30:35,654 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:30:35,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:30:35" (1/3) ... [2018-01-21 00:30:35,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b2206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:35, skipping insertion in model container [2018-01-21 00:30:35,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:30:35" (2/3) ... [2018-01-21 00:30:35,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b2206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:30:35, skipping insertion in model container [2018-01-21 00:30:35,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:30:35" (3/3) ... [2018-01-21 00:30:35,657 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-01-21 00:30:35,665 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:30:35,672 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:30:35,717 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:35,717 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:35,717 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:35,717 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:35,717 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:35,718 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:35,718 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:35,718 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:30:35,718 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 00:30:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:30:35,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:35,746 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:30:35,746 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:30:35,750 INFO L82 PathProgramCache]: Analyzing trace with hash 97063, now seen corresponding path program 1 times [2018-01-21 00:30:35,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:35,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:35,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:35,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:35,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:35,856 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:35,862 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:35,869 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:35,869 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:35,869 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:35,869 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:35,870 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:35,870 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:35,870 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:35,870 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == cstrcspnErr0EnsuresViolation======== [2018-01-21 00:30:35,870 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 00:30:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:30:35,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:35,873 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:30:35,873 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr0EnsuresViolation]=== [2018-01-21 00:30:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 945947687, now seen corresponding path program 1 times [2018-01-21 00:30:35,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:35,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:35,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:35,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:35,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:35,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:35,965 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:30:35,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:35,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:35,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:35,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:36,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:36,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:36,064 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 00:30:36,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:36,082 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-01-21 00:30:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:36,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 00:30:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:36,091 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:30:36,091 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:36,094 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:30:36,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:36,114 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 00:30:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:36,114 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:36,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:36,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:36,117 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:36,118 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:36,118 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:36,118 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:36,118 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:36,118 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:36,118 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:36,118 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:30:36,119 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 00:30:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:30:36,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:36,122 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:30:36,122 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:36,123 INFO L82 PathProgramCache]: Analyzing trace with hash 725300169, now seen corresponding path program 1 times [2018-01-21 00:30:36,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:36,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:36,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:36,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:36,170 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:30:36,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:36,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:36,170 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:36,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:36,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:36,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:36,171 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 00:30:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:36,177 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-01-21 00:30:36,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:36,178 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:30:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:36,181 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:30:36,181 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 00:30:36,182 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:30:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 00:30:36,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-21 00:30:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 00:30:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2018-01-21 00:30:36,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 27 [2018-01-21 00:30:36,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:36,195 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-01-21 00:30:36,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-01-21 00:30:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:30:36,196 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:36,196 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 00:30:36,197 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:30:36,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1576766648, now seen corresponding path program 1 times [2018-01-21 00:30:36,197 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:36,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:36,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,199 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:30:36,296 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:30:36,306 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:36,311 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:36,313 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:36,314 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:30:36,323 WARN L312 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2018-01-21 00:30:36,330 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:30:36,331 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:30:36,331 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:30:36,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:30:36,331 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:30:36,331 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:30:36,331 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:30:36,331 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:30:36,332 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:30:36,333 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-21 00:30:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:30:36,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:36,335 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:30:36,335 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:36,335 INFO L82 PathProgramCache]: Analyzing trace with hash -736674615, now seen corresponding path program 1 times [2018-01-21 00:30:36,335 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:36,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:36,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:36,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:36,365 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:30:36,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:36,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:30:36,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:36,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:30:36,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:30:36,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:30:36,367 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-21 00:30:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:36,372 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-01-21 00:30:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:30:36,372 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 00:30:36,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:36,373 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:30:36,374 INFO L226 Difference]: Without dead ends: 34 [2018-01-21 00:30:36,374 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:30:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-21 00:30:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-21 00:30:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-21 00:30:36,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-21 00:30:36,378 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-01-21 00:30:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:36,378 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-21 00:30:36,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:30:36,379 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-21 00:30:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:30:36,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:30:36,380 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 00:30:36,380 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:30:36,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1415117448, now seen corresponding path program 1 times [2018-01-21 00:30:36,381 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:30:36,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,382 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:30:36,382 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:30:36,382 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:30:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:30:36,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:30:36,787 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:30:36,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:30:36,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:30:36,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:30:36,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:30:36,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:30:36,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:30:36,790 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 9 states. [2018-01-21 00:30:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:30:37,133 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-01-21 00:30:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:30:37,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-21 00:30:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:30:37,135 INFO L225 Difference]: With dead ends: 34 [2018-01-21 00:30:37,135 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:30:37,136 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:30:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:30:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:30:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:30:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:30:37,137 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-21 00:30:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:30:37,137 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:30:37,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:30:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:30:37,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:30:37,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:30:37 BoogieIcfgContainer [2018-01-21 00:30:37,140 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:30:37,141 INFO L168 Benchmark]: Toolchain (without parser) took 1980.67 ms. Allocated memory was 304.1 MB in the beginning and 461.4 MB in the end (delta: 157.3 MB). Free memory was 262.4 MB in the beginning and 347.6 MB in the end (delta: -85.2 MB). Peak memory consumption was 72.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:37,142 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:30:37,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.43 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:37,142 INFO L168 Benchmark]: Boogie Preprocessor took 31.69 ms. Allocated memory is still 304.1 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:37,143 INFO L168 Benchmark]: RCFGBuilder took 230.22 ms. Allocated memory is still 304.1 MB. Free memory was 249.3 MB in the beginning and 233.7 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:37,143 INFO L168 Benchmark]: TraceAbstraction took 1488.92 ms. Allocated memory was 304.1 MB in the beginning and 461.4 MB in the end (delta: 157.3 MB). Free memory was 232.7 MB in the beginning and 347.6 MB in the end (delta: -114.9 MB). Peak memory consumption was 42.4 MB. Max. memory is 5.3 GB. [2018-01-21 00:30:37,145 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.43 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.69 ms. Allocated memory is still 304.1 MB. Free memory was 251.3 MB in the beginning and 249.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 230.22 ms. Allocated memory is still 304.1 MB. Free memory was 249.3 MB in the beginning and 233.7 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1488.92 ms. Allocated memory was 304.1 MB in the beginning and 461.4 MB in the end (delta: 157.3 MB). Free memory was 232.7 MB in the beginning and 347.6 MB in the end (delta: -114.9 MB). Peak memory consumption was 42.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: cstrcspnErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 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=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 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: [L555] int length1 = __VERIFIER_nondet_int(); [L556] int length2 = __VERIFIER_nondet_int(); [L557] COND FALSE !(length1 < 1) VAL [length1=3, length2=0] [L560] COND TRUE length2 < 1 [L561] length2 = 1 VAL [length1=3, length2=1] [L563] EXPR, FCALL __builtin_alloca (length1 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, length1=3, length2=1] [L563] char* nondetString1 = (char*) __builtin_alloca (length1 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, length1=3, length2=1, nondetString1={5:0}] [L564] EXPR, FCALL __builtin_alloca (length2 * sizeof(char)) VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, __builtin_alloca (length2 * sizeof(char))={7:0}, length1=3, length2=1, nondetString1={5:0}] [L564] char* nondetString2 = (char*) __builtin_alloca (length2 * sizeof(char)); VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, __builtin_alloca (length2 * sizeof(char))={7:0}, length1=3, length2=1, nondetString1={5:0}, nondetString2={7:0}] [L565] FCALL nondetString1[length1-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, __builtin_alloca (length2 * sizeof(char))={7:0}, length1=3, length2=1, nondetString1={5:0}, nondetString2={7:0}] [L566] FCALL nondetString2[length2-1] = '\0' VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, __builtin_alloca (length2 * sizeof(char))={7:0}, length1=3, length2=1, nondetString1={5:0}, nondetString2={7:0}] [L567] CALL, EXPR cstrcspn(nondetString1,nondetString2) VAL [s1={5:0}, s2={7:0}] [L543] const char *p, *spanp; [L544] char c, sc; [L545] p = s1 VAL [p={5:0}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}] [L546] EXPR p++ VAL [p={5:1}, p++=0, p++={5:0}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}] [L546] c = *p++ [L547] spanp = s2 VAL [c=0, p={7:0}, p={5:1}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}] [L549] EXPR spanp++ VAL [c=0, p={7:1}, p={5:1}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}, spanp++={7:0}spanp++=0] [L549] EXPR sc = *spanp++ VAL [c=0, c=0, p={7:1}, p={5:1}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}, spanp++=0spanp++={7:0}] [L549] COND TRUE (sc = *spanp++) == c [L550] RET return (p - 1 - s1); VAL [\result=0, c=0, c=0, p={5:1}, p={7:1}, s1={5:0}, s1={5:0}, s2={7:0}, s2={7:0}] [L567] EXPR cstrcspn(nondetString1,nondetString2) VAL [__builtin_alloca (length1 * sizeof(char))={5:0}, __builtin_alloca (length2 * sizeof(char))={7:0}, cstrcspn(nondetString1,nondetString2)=0, length1=3, length2=1, nondetString1={5:0}, nondetString2={7:0}] [L567] return cstrcspn(nondetString1,nondetString2); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 42 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=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 676 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 - PositiveResult [Line: 554]: 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, 40 locations, 4 error locations. SAFE Result, 0.8s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 68 SDtfs, 21 SDslu, 30 SDs, 0 SdLazy, 148 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 7210 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-30-37-153.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-30-37-153.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-30-37-153.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-30-37-153.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-30-37-153.csv Received shutdown request...