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/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:47,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:47,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:47,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:47,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:47,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:47,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:47,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:47,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:47,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:47,886 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:47,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:47,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:47,889 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:47,890 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:47,892 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:47,895 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:47,897 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:47,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:47,900 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:47,903 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:47,903 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:47,903 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:47,904 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:47,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:47,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:47,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:47,908 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:47,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:47,908 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:47,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:47,909 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:42:47,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:47,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:47,921 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:47,921 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:47,921 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:47,921 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:47,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:47,922 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:47,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:47,923 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:47,923 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:47,923 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:47,923 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:47,923 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:47,924 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:47,924 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:47,924 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:47,924 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:47,924 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:47,925 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:47,925 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:47,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:47,925 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:47,925 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:47,926 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:47,926 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:47,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:47,926 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:47,926 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:47,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:47,928 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:47,928 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:47,929 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:47,929 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:47,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:47,977 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:47,981 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:47,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:47,983 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:47,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-01-21 00:42:48,137 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:48,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:48,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:48,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:48,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:48,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98eaffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48, skipping insertion in model container [2018-01-21 00:42:48,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,178 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:48,220 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:48,357 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:48,374 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:48,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48 WrapperNode [2018-01-21 00:42:48,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:48,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:48,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:48,384 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:48,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (1/1) ... [2018-01-21 00:42:48,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:48,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:48,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:48,425 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:48,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (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:42:48,482 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:48,483 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:48,483 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-21 00:42:48,483 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:48,483 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:48,483 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:48,483 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:48,484 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:48,718 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:48,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:48 BoogieIcfgContainer [2018-01-21 00:42:48,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:48,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:48,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:48,764 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:48,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:48" (1/3) ... [2018-01-21 00:42:48,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f55c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:48, skipping insertion in model container [2018-01-21 00:42:48,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:48" (2/3) ... [2018-01-21 00:42:48,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f55c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:48, skipping insertion in model container [2018-01-21 00:42:48,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:48" (3/3) ... [2018-01-21 00:42:48,768 INFO L105 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-01-21 00:42:48,775 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:48,781 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:42:48,826 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:48,826 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:48,827 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:48,827 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:48,827 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:48,827 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:48,827 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:48,827 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:48,828 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:42:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:48,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:48,856 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:48,857 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash 96102, now seen corresponding path program 1 times [2018-01-21 00:42:48,865 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:48,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:48,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:48,931 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:48,984 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:48,990 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:48,996 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:48,996 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:48,996 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:48,996 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:48,996 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:48,996 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:48,996 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:48,996 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == test_funErr0EnsuresViolation======== [2018-01-21 00:42:48,997 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:42:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-21 00:42:48,999 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:49,000 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:42:49,000 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr0EnsuresViolation]=== [2018-01-21 00:42:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2040932450, now seen corresponding path program 1 times [2018-01-21 00:42:49,000 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:49,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:49,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:49,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:49,105 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:42:49,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:49,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:49,108 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:49,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:49,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:49,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:49,128 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 00:42:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:49,221 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-21 00:42:49,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:49,222 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-01-21 00:42:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:49,230 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:49,230 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 00:42:49,233 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:42:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 00:42:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-21 00:42:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-21 00:42:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-21 00:42:49,264 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 32 [2018-01-21 00:42:49,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:49,265 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-21 00:42:49,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-21 00:42:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:42:49,266 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:49,266 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 00:42:49,266 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr0EnsuresViolation]=== [2018-01-21 00:42:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 105536599, now seen corresponding path program 1 times [2018-01-21 00:42:49,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:49,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,268 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:49,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:49,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:49,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:50,251 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 76 DAG size of output 31 [2018-01-21 00:42:50,938 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:42:50,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:50,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-21 00:42:50,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:50,940 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 00:42:50,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 00:42:50,941 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-21 00:42:50,942 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 17 states. [2018-01-21 00:42:51,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:51,321 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-21 00:42:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-21 00:42:51,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-01-21 00:42:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:51,322 INFO L225 Difference]: With dead ends: 48 [2018-01-21 00:42:51,322 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:51,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-01-21 00:42:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:51,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:51,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 00:42:51,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:51,325 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:51,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-21 00:42:51,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:51,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:51,327 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:51,327 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:51,327 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:51,328 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:51,328 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:51,328 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:51,328 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:51,328 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:51,328 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:42:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:42:51,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:51,331 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, 1, 1] [2018-01-21 00:42:51,331 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1985299327, now seen corresponding path program 1 times [2018-01-21 00:42:51,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:51,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:51,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,332 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:51,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:51,359 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:42:51,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:51,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:51,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:51,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:51,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:51,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:51,361 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 00:42:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:51,366 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-21 00:42:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:51,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-01-21 00:42:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:51,367 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:51,368 INFO L226 Difference]: Without dead ends: 53 [2018-01-21 00:42:51,368 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:42:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-21 00:42:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-21 00:42:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-21 00:42:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-01-21 00:42:51,375 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 37 [2018-01-21 00:42:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:51,376 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-01-21 00:42:51,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-01-21 00:42:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 00:42:51,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:51,377 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, 1, 1, 1, 1, 1] [2018-01-21 00:42:51,378 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash -322848340, now seen corresponding path program 1 times [2018-01-21 00:42:51,378 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:51,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:51,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:51,429 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:51,442 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:51,453 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:51,453 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:51,454 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:51,475 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:51,475 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:51,475 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:51,476 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:51,476 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:51,476 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:51,476 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:51,476 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:51,476 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-01-21 00:42:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:42:51,479 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:51,479 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 00:42:51,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:51,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1861619211, now seen corresponding path program 1 times [2018-01-21 00:42:51,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:51,480 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:51,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,481 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:51,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:51,505 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:42:51,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:51,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:51,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:51,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:51,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:51,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:51,507 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2018-01-21 00:42:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:51,512 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-01-21 00:42:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:51,512 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-01-21 00:42:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:51,513 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:51,513 INFO L226 Difference]: Without dead ends: 51 [2018-01-21 00:42:51,514 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:42:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-21 00:42:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-21 00:42:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-21 00:42:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-21 00:42:51,520 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 35 [2018-01-21 00:42:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:51,520 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-21 00:42:51,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-21 00:42:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-21 00:42:51,522 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:51,522 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, 1, 1, 1] [2018-01-21 00:42:51,522 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash 124803574, now seen corresponding path program 1 times [2018-01-21 00:42:51,522 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:51,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:51,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:51,523 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:51,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:42:51,568 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:42:51,569 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:51,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:51,569 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:51,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:42:51,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:42:51,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:42:51,570 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 3 states. [2018-01-21 00:42:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:51,597 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-21 00:42:51,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:42:51,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-21 00:42:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:51,599 INFO L225 Difference]: With dead ends: 51 [2018-01-21 00:42:51,599 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:51,600 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 00:42:51,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:51,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-01-21 00:42:51,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:51,601 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:51,601 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:42:51,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:51,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:51,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:42:51 BoogieIcfgContainer [2018-01-21 00:42:51,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:42:51,605 INFO L168 Benchmark]: Toolchain (without parser) took 3467.73 ms. Allocated memory was 304.1 MB in the beginning and 519.0 MB in the end (delta: 215.0 MB). Free memory was 262.4 MB in the beginning and 380.2 MB in the end (delta: -117.8 MB). Peak memory consumption was 97.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:51,607 INFO L168 Benchmark]: CDTParser took 0.23 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:42:51,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.43 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:51,607 INFO L168 Benchmark]: Boogie Preprocessor took 40.24 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:51,608 INFO L168 Benchmark]: RCFGBuilder took 337.32 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 231.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:51,608 INFO L168 Benchmark]: TraceAbstraction took 2841.77 ms. Allocated memory was 304.1 MB in the beginning and 519.0 MB in the end (delta: 215.0 MB). Free memory was 231.8 MB in the beginning and 380.2 MB in the end (delta: -148.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:51,610 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 304.1 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.43 ms. Allocated memory is still 304.1 MB. Free memory was 261.4 MB in the beginning and 251.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.24 ms. Allocated memory is still 304.1 MB. Free memory was 251.4 MB in the beginning and 249.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 337.32 ms. Allocated memory is still 304.1 MB. Free memory was 249.4 MB in the beginning and 231.8 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2841.77 ms. Allocated memory was 304.1 MB in the beginning and 519.0 MB in the end (delta: 215.0 MB). Free memory was 231.8 MB in the beginning and 380.2 MB in the end (delta: -148.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 57 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=57occurred 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: test_funErr0EnsuresViolation CFG has 4 procedures, 57 locations, 4 error locations. SAFE Result, 2.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 78 SDtfs, 53 SDslu, 97 SDs, 0 SdLazy, 355 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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, 1.6s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 33635 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L561] CALL, EXPR test_fun(__VERIFIER_nondet_int(),__VERIFIER_nondet_int(),__VERIFIER_nondet_int()) VAL [\old(x)=0, \old(y)=0, \old(z)=0] [L542] EXPR, FCALL __builtin_alloca (sizeof(int)) VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={9:0}, x=0, y=0, z=0] [L542] int* x_ref = __builtin_alloca (sizeof(int)); VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={9:0}, x=0, x_ref={9:0}, y=0, z=0] [L543] EXPR, FCALL __builtin_alloca (sizeof(int)) VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={9:0}, x=0, x_ref={9:0}, y=0, z=0] [L543] int* y_ref = __builtin_alloca (sizeof(int)); VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={9:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0] [L544] EXPR, FCALL __builtin_alloca (sizeof(int)) VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0] [L544] int* z_ref = __builtin_alloca (sizeof(int)); VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L545] EXPR, FCALL __builtin_alloca (sizeof(int)) VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L545] int* c = __builtin_alloca (sizeof(int)); VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L546] FCALL *x_ref = x VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L547] FCALL *y_ref = y VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L548] FCALL *z_ref = z VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L549] FCALL *c = 0 VAL [\old(x)=0, \old(y)=0, \old(z)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L550] EXPR, FCALL \read(*x_ref) VAL [\old(x)=0, \old(y)=0, \old(z)=0, \read(*x_ref)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L550] EXPR, FCALL \read(*y_ref) VAL [\old(x)=0, \old(y)=0, \old(z)=0, \read(*x_ref)=0, \read(*y_ref)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L550] COND FALSE !(*x_ref < *y_ref) [L558] EXPR, FCALL \read(*c) VAL [\old(x)=0, \old(y)=0, \old(z)=0, \read(*c)=0, __builtin_alloca (sizeof(int))={8:0}, __builtin_alloca (sizeof(int))={7:0}, __builtin_alloca (sizeof(int))={9:0}, __builtin_alloca (sizeof(int))={6:0}, c={6:0}, x=0, x_ref={9:0}, y=0, y_ref={8:0}, z=0, z_ref={7:0}] [L558] RET return *c; [L561] EXPR test_fun(__VERIFIER_nondet_int(),__VERIFIER_nondet_int(),__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, __VERIFIER_nondet_int()=0, test_fun(__VERIFIER_nondet_int(),__VERIFIER_nondet_int(),__VERIFIER_nondet_int())=0] [L561] return test_fun(__VERIFIER_nondet_int(),__VERIFIER_nondet_int(),__VERIFIER_nondet_int()); - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 57 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58 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=57occurred 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, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 1296 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: 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, 57 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 106 SDtfs, 1 SDslu, 32 SDs, 0 SdLazy, 13 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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.0s InterpolantComputationTime, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 2895 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/c.03-alloca_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-51-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-51-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-51-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-42-51-620.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-42-51-620.csv Received shutdown request...