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/list-ext-properties/960521-1_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:42:25,982 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:42:25,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:42:25,997 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:42:25,998 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:42:25,999 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:42:26,000 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:42:26,002 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:42:26,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:42:26,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:42:26,006 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:42:26,006 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:42:26,007 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:42:26,009 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:42:26,010 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:42:26,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:42:26,015 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:42:26,017 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:42:26,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:42:26,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:42:26,022 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:42:26,023 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:42:26,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:42:26,024 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:42:26,025 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:42:26,026 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:42:26,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:42:26,027 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:42:26,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:42:26,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:42:26,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:42:26,028 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:26,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:42:26,039 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:42:26,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:42:26,040 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:42:26,040 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:42:26,040 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:42:26,040 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:42:26,040 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:42:26,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:42:26,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:42:26,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:42:26,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:42:26,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:42:26,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:42:26,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:42:26,044 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:42:26,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:42:26,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:42:26,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:42:26,044 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:42:26,045 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:42:26,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:42:26,045 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:42:26,045 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:42:26,045 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:42:26,046 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:42:26,046 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:42:26,046 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:42:26,046 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:42:26,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:42:26,047 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:42:26,047 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:42:26,048 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:42:26,048 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:42:26,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:42:26,097 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:42:26,101 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:42:26,103 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:42:26,104 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:42:26,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_true-valid-memsafety.i [2018-01-21 00:42:26,267 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:42:26,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:42:26,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:26,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:42:26,278 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:42:26,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:26" (1/1) ... [2018-01-21 00:42:26,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ef8971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:26, skipping insertion in model container [2018-01-21 00:42:26,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:42:26" (1/1) ... [2018-01-21 00:42:26,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:26,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:42:26,448 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:26,463 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:42:26,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:26 WrapperNode [2018-01-21 00:42:26,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:42:26,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:42:26,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:42:26,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:42:26,483 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:26" (1/1) ... [2018-01-21 00:42:26,483 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:26" (1/1) ... [2018-01-21 00:42:26,495 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:26" (1/1) ... [2018-01-21 00:42:26,495 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:26" (1/1) ... [2018-01-21 00:42:26,499 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:26" (1/1) ... [2018-01-21 00:42:26,502 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:26" (1/1) ... [2018-01-21 00:42:26,503 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:26" (1/1) ... [2018-01-21 00:42:26,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:42:26,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:42:26,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:42:26,505 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:42:26,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:26" (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:26,556 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:42:26,556 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:42:26,556 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-21 00:42:26,556 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:42:26,556 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:42:26,556 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:42:26,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:42:26,556 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:42:26,557 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:42:26,758 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:42:26,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:26 BoogieIcfgContainer [2018-01-21 00:42:26,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:42:26,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:42:26,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:42:26,761 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:42:26,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:42:26" (1/3) ... [2018-01-21 00:42:26,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed78407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:26, skipping insertion in model container [2018-01-21 00:42:26,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:42:26" (2/3) ... [2018-01-21 00:42:26,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed78407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:42:26, skipping insertion in model container [2018-01-21 00:42:26,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:42:26" (3/3) ... [2018-01-21 00:42:26,765 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_true-valid-memsafety.i [2018-01-21 00:42:26,772 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:42:26,779 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:42:26,828 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:26,828 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:26,829 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:26,829 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:26,829 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:26,829 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:26,829 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:26,829 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:42:26,830 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 00:42:26,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:42:26,856 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:26,857 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:42:26,857 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:42:26,861 INFO L82 PathProgramCache]: Analyzing trace with hash 104751, now seen corresponding path program 1 times [2018-01-21 00:42:26,863 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:26,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:26,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:26,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:26,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:26,975 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:26,984 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:26,993 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:26,993 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:26,993 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:26,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:26,993 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:26,993 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:26,994 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:26,994 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-21 00:42:26,994 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:26,995 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 00:42:26,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 00:42:26,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:26,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:26,996 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-21 00:42:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -387558155, now seen corresponding path program 1 times [2018-01-21 00:42:26,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:26,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:26,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:26,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:26,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,019 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:27,057 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:27,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:27,059 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:27,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:27,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:27,079 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 00:42:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,177 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 00:42:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:27,178 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 00:42:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,184 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:27,184 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:27,186 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:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:27,208 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-21 00:42:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,208 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:27,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:27,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:27,210 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:27,210 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:27,210 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:27,211 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:27,211 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:27,211 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:27,211 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:27,211 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:42:27,211 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 00:42:27,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 00:42:27,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,214 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:27,214 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1865714460, now seen corresponding path program 1 times [2018-01-21 00:42:27,214 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,216 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,231 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:27,251 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:27,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:27,251 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:27,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:27,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:27,253 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 00:42:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,258 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 00:42:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:27,258 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-01-21 00:42:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,260 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:27,260 INFO L226 Difference]: Without dead ends: 40 [2018-01-21 00:42:27,260 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:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-21 00:42:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-21 00:42:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 00:42:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-01-21 00:42:27,270 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 29 [2018-01-21 00:42:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,271 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-01-21 00:42:27,271 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-01-21 00:42:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:42:27,272 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,272 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] [2018-01-21 00:42:27,272 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -880196222, now seen corresponding path program 1 times [2018-01-21 00:42:27,272 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,274 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,310 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:27,423 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:27,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:27,423 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:27,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:27,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:27,426 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 5 states. [2018-01-21 00:42:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,504 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-01-21 00:42:27,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:42:27,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 00:42:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,507 INFO L225 Difference]: With dead ends: 45 [2018-01-21 00:42:27,507 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 00:42:27,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:42:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 00:42:27,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 00:42:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 00:42:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 00:42:27,513 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 33 [2018-01-21 00:42:27,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,514 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 00:42:27,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:27,514 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 00:42:27,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-21 00:42:27,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,515 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] [2018-01-21 00:42:27,516 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1506938106, now seen corresponding path program 1 times [2018-01-21 00:42:27,516 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,517 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,536 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:27,581 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:27,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,582 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:27,582 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:27,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:27,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:27,583 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-21 00:42:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,703 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-01-21 00:42:27,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:42:27,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-21 00:42:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,706 INFO L225 Difference]: With dead ends: 65 [2018-01-21 00:42:27,707 INFO L226 Difference]: Without dead ends: 48 [2018-01-21 00:42:27,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:42:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-21 00:42:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-01-21 00:42:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-21 00:42:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-01-21 00:42:27,712 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-01-21 00:42:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,712 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-01-21 00:42:27,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-01-21 00:42:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:42:27,713 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,713 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:27,713 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:42:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1981787469, now seen corresponding path program 1 times [2018-01-21 00:42:27,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,715 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:42:27,778 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:42:27,789 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:27,797 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:27,800 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:27,801 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:42:27,817 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:42:27,817 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:42:27,817 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:42:27,818 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:42:27,818 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:42:27,818 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:42:27,818 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:42:27,818 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:42:27,818 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:42:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-01-21 00:42:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:42:27,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,821 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:42:27,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1942190490, now seen corresponding path program 1 times [2018-01-21 00:42:27,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,823 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,823 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,830 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:27,840 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:27,840 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:42:27,841 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:42:27,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:42:27,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:42:27,842 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-01-21 00:42:27,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,846 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2018-01-21 00:42:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:42:27,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:42:27,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,848 INFO L225 Difference]: With dead ends: 77 [2018-01-21 00:42:27,848 INFO L226 Difference]: Without dead ends: 38 [2018-01-21 00:42:27,849 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:27,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-21 00:42:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-21 00:42:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 00:42:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-21 00:42:27,854 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 27 [2018-01-21 00:42:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,854 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-21 00:42:27,854 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:42:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-21 00:42:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:42:27,855 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,856 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] [2018-01-21 00:42:27,856 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash -215440820, now seen corresponding path program 1 times [2018-01-21 00:42:27,856 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,858 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:27,872 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:27,925 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:27,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:27,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:27,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:27,926 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:27,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:27,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:27,926 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 5 states. [2018-01-21 00:42:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:27,986 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 00:42:27,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-21 00:42:27,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 00:42:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:27,988 INFO L225 Difference]: With dead ends: 41 [2018-01-21 00:42:27,988 INFO L226 Difference]: Without dead ends: 36 [2018-01-21 00:42:27,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:42:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-21 00:42:27,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-21 00:42:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-21 00:42:27,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-21 00:42:27,994 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2018-01-21 00:42:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:27,995 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-21 00:42:27,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-21 00:42:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 00:42:27,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:27,996 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] [2018-01-21 00:42:27,997 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash -211623728, now seen corresponding path program 1 times [2018-01-21 00:42:27,997 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:27,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,998 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:27,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:27,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:28,012 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:28,060 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:28,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:28,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:42:28,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:28,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 00:42:28,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 00:42:28,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 00:42:28,062 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-21 00:42:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:28,128 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-21 00:42:28,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:42:28,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-21 00:42:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:28,129 INFO L225 Difference]: With dead ends: 61 [2018-01-21 00:42:28,130 INFO L226 Difference]: Without dead ends: 46 [2018-01-21 00:42:28,130 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:42:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-21 00:42:28,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2018-01-21 00:42:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-21 00:42:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-21 00:42:28,134 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2018-01-21 00:42:28,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:28,134 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-21 00:42:28,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 00:42:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-21 00:42:28,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:42:28,135 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:42:28,135 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:42:28,135 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:42:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1396474071, now seen corresponding path program 1 times [2018-01-21 00:42:28,135 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:42:28,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:28,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:42:28,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:42:28,136 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:42:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:42:28,152 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:28,567 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 25 DAG size of output 17 [2018-01-21 00:42:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 00:42:28,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:42:28,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:42:28,784 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:42:28,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-21 00:42:28,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-21 00:42:28,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-01-21 00:42:28,785 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 9 states. [2018-01-21 00:42:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:42:29,068 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-21 00:42:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-21 00:42:29,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-21 00:42:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:42:29,069 INFO L225 Difference]: With dead ends: 38 [2018-01-21 00:42:29,069 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:42:29,070 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-21 00:42:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:42:29,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:42:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:42:29,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:42:29,071 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-01-21 00:42:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:42:29,071 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:42:29,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-21 00:42:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:42:29,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:42:29,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:42:29 BoogieIcfgContainer [2018-01-21 00:42:29,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:42:29,076 INFO L168 Benchmark]: Toolchain (without parser) took 2808.54 ms. Allocated memory was 303.6 MB in the beginning and 481.8 MB in the end (delta: 178.3 MB). Free memory was 261.7 MB in the beginning and 400.7 MB in the end (delta: -139.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:29,077 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.6 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:42:29,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.46 ms. Allocated memory is still 303.6 MB. Free memory was 260.7 MB in the beginning and 250.8 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:29,078 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 ms. Allocated memory is still 303.6 MB. Free memory was 250.8 MB in the beginning and 248.7 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:29,078 INFO L168 Benchmark]: RCFGBuilder took 253.63 ms. Allocated memory is still 303.6 MB. Free memory was 248.7 MB in the beginning and 231.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:29,079 INFO L168 Benchmark]: TraceAbstraction took 2315.67 ms. Allocated memory was 303.6 MB in the beginning and 481.8 MB in the end (delta: 178.3 MB). Free memory was 231.6 MB in the beginning and 400.7 MB in the end (delta: -169.0 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:42:29,081 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.19 ms. Allocated memory is still 303.6 MB. Free memory is still 267.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.46 ms. Allocated memory is still 303.6 MB. Free memory was 260.7 MB in the beginning and 250.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.21 ms. Allocated memory is still 303.6 MB. Free memory was 250.8 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.63 ms. Allocated memory is still 303.6 MB. Free memory was 248.7 MB in the beginning and 231.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2315.67 ms. Allocated memory was 303.6 MB in the beginning and 481.8 MB in the end (delta: 178.3 MB). Free memory was 231.6 MB in the beginning and 400.7 MB in the end (delta: -169.0 MB). Peak memory consumption was 9.2 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=4, \old(a)=7, \old(b)=3, \old(b)=2, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 44 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=44occurred 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: 622]: 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: fooErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 46 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=44occurred 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, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L636] a = malloc (n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc (n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L637] b = malloc (n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L639] CALL foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo () VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[-1] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] EXPR, FCALL b[n - 2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b[-1]=1, b[n - 2]=1, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L640] COND FALSE !(b[-1] - b[n - 2]) [L643] FCALL free(a) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L643] FCALL free(b-1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc (n * sizeof(*a))={7:0}, malloc (n * sizeof(*b))={13:0}, n=1] [L644] return 0; VAL [a={7:0}, b={13:4}, n=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 44 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 107 SDtfs, 74 SDslu, 114 SDs, 0 SdLazy, 67 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 4688 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 630]: 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, 44 locations, 4 error locations. SAFE Result, 1.2s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 129 SDtfs, 97 SDslu, 149 SDs, 0 SdLazy, 239 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 14824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 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/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-42-29-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-42-29-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-42-29-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-42-29-091.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-42-29-091.csv Received shutdown request...