./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f270b702de634d3ad2ee5a400388c6410a4cf10 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:08:45,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:08:45,618 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:08:45,636 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:08:45,636 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:08:45,637 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:08:45,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:08:45,641 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:08:45,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:08:45,644 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:08:45,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:08:45,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:08:45,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:08:45,647 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:08:45,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:08:45,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:08:45,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:08:45,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:08:45,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:08:45,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:08:45,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:08:45,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:08:45,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:08:45,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:08:45,662 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:08:45,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:08:45,664 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:08:45,665 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:08:45,666 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:08:45,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:08:45,667 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:08:45,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:08:45,668 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:08:45,668 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:08:45,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:08:45,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:08:45,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:08:45,699 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:08:45,700 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:08:45,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:08:45,702 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:08:45,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:08:45,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:08:45,704 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:08:45,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:08:45,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:08:45,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:08:45,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:08:45,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:08:45,708 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:08:45,708 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:08:45,708 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:08:45,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:08:45,709 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:08:45,709 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:08:45,709 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:08:45,709 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:08:45,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:08:45,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:08:45,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:08:45,710 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:08:45,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:08:45,711 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2018-11-28 18:08:45,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:08:45,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:08:45,775 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:08:45,777 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:08:45,778 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:08:45,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:45,850 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccaeda/700496d8e2d3450f86f842a1f345986f/FLAG8cd390adb [2018-11-28 18:08:46,411 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:08:46,412 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:46,446 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccaeda/700496d8e2d3450f86f842a1f345986f/FLAG8cd390adb [2018-11-28 18:08:46,644 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33eccaeda/700496d8e2d3450f86f842a1f345986f [2018-11-28 18:08:46,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:08:46,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:08:46,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:46,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:08:46,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:08:46,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:46" (1/1) ... [2018-11-28 18:08:46,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a3f5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:46, skipping insertion in model container [2018-11-28 18:08:46,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:08:46" (1/1) ... [2018-11-28 18:08:46,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:08:46,735 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:08:47,094 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:47,106 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:08:47,179 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:08:47,328 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:08:47,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47 WrapperNode [2018-11-28 18:08:47,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:08:47,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:47,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:08:47,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:08:47,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:08:47,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:08:47,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:08:47,387 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:08:47,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... [2018-11-28 18:08:47,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:08:47,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:08:47,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:08:47,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:08:47,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (1/1) ... No working directory specified, using /storage/repos/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-11-28 18:08:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 18:08:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 18:08:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 18:08:47,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:08:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:08:47,513 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:08:47,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:08:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 18:08:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 18:08:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 18:08:47,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:08:47,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:08:48,115 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:08:48,115 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 18:08:48,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:48 BoogieIcfgContainer [2018-11-28 18:08:48,116 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:08:48,117 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:08:48,117 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:08:48,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:08:48,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:08:46" (1/3) ... [2018-11-28 18:08:48,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39801bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:48, skipping insertion in model container [2018-11-28 18:08:48,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:08:47" (2/3) ... [2018-11-28 18:08:48,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39801bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:08:48, skipping insertion in model container [2018-11-28 18:08:48,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:48" (3/3) ... [2018-11-28 18:08:48,126 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-28 18:08:48,137 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:08:48,148 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-28 18:08:48,167 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-28 18:08:48,200 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:08:48,201 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:08:48,201 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:08:48,202 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:08:48,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:08:48,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:08:48,202 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:08:48,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:08:48,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:08:48,227 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-28 18:08:48,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 18:08:48,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:48,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:48,237 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:48,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:48,244 INFO L82 PathProgramCache]: Analyzing trace with hash -807935886, now seen corresponding path program 1 times [2018-11-28 18:08:48,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:48,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:48,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:48,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:48,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:48,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 18:08:48,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 18:08:48,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 18:08:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 18:08:48,433 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-28 18:08:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:48,453 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2018-11-28 18:08:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 18:08:48,455 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 18:08:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:48,465 INFO L225 Difference]: With dead ends: 59 [2018-11-28 18:08:48,465 INFO L226 Difference]: Without dead ends: 27 [2018-11-28 18:08:48,469 INFO L631 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-11-28 18:08:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-28 18:08:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-28 18:08:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 18:08:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-28 18:08:48,509 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-11-28 18:08:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:48,510 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-28 18:08:48,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 18:08:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-28 18:08:48,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 18:08:48,511 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:48,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:48,511 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:48,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:48,511 INFO L82 PathProgramCache]: Analyzing trace with hash 711422280, now seen corresponding path program 1 times [2018-11-28 18:08:48,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:48,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:48,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:48,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:08:48,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:08:48,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:08:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:08:48,683 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-28 18:08:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:48,863 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-28 18:08:48,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:08:48,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-28 18:08:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:48,865 INFO L225 Difference]: With dead ends: 35 [2018-11-28 18:08:48,865 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 18:08:48,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 18:08:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-28 18:08:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 18:08:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-28 18:08:48,872 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-11-28 18:08:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:48,872 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-28 18:08:48,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:08:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-28 18:08:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 18:08:48,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:48,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:48,873 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:48,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1678513884, now seen corresponding path program 1 times [2018-11-28 18:08:48,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:48,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:48,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:49,062 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-28 18:08:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:49,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:49,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:08:49,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:08:49,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:08:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:49,224 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-11-28 18:08:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:49,452 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-28 18:08:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:08:49,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-28 18:08:49,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:49,455 INFO L225 Difference]: With dead ends: 51 [2018-11-28 18:08:49,455 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:08:49,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:08:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:08:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-11-28 18:08:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-28 18:08:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-28 18:08:49,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2018-11-28 18:08:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:49,464 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-28 18:08:49,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:08:49,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-28 18:08:49,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:08:49,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:49,465 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:49,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:49,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:49,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1763906605, now seen corresponding path program 1 times [2018-11-28 18:08:49,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:49,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:49,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:49,782 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-11-28 18:08:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:49,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 18:08:49,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 18:08:49,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:50,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 18:08:50,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 18:08:50,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 18:08:50,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:08:50,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-28 18:08:50,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:08:50,507 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:08:50,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 18:08:50,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-28 18:08:50,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 18:08:50,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 18:08:50,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:08:50,698 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,737 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:50,747 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:50,780 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:50,793 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:50,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2018-11-28 18:08:50,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 18:08:50,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 18:08:50,853 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-28 18:08:50,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:08:50,885 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:50,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-28 18:08:50,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 15 [2018-11-28 18:08:50,937 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-28 18:08:50,963 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 18:08:50,998 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 18:08:51,044 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 18:08:51,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,091 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:108, output treesize:17 [2018-11-28 18:08:51,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-28 18:08:51,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-28 18:08:51,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 18:08:51,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-11-28 18:08:51,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 18:08:51,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 18:08:51,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 18:08:51,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 18:08:51,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-11-28 18:08:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:51,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 18:08:51,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 18:08:51,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 18:08:51,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 18:08:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 18:08:51,375 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2018-11-28 18:08:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:52,302 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2018-11-28 18:08:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 18:08:52,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-11-28 18:08:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:52,310 INFO L225 Difference]: With dead ends: 93 [2018-11-28 18:08:52,310 INFO L226 Difference]: Without dead ends: 91 [2018-11-28 18:08:52,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2018-11-28 18:08:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-28 18:08:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 38. [2018-11-28 18:08:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-28 18:08:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-28 18:08:52,333 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-11-28 18:08:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:52,336 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-28 18:08:52,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 18:08:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-28 18:08:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:08:52,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:52,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:52,338 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:52,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:52,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1644345819, now seen corresponding path program 1 times [2018-11-28 18:08:52,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:52,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:52,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:52,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:52,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:08:52,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:08:52,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:08:52,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:08:52,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:08:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:08:52,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:08:52,641 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2018-11-28 18:08:52,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:08:52,758 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-11-28 18:08:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 18:08:52,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 18:08:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:08:52,761 INFO L225 Difference]: With dead ends: 54 [2018-11-28 18:08:52,761 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 18:08:52,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:08:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 18:08:52,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2018-11-28 18:08:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 18:08:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-28 18:08:52,768 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 19 [2018-11-28 18:08:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:08:52,768 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-28 18:08:52,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:08:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-28 18:08:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:08:52,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:08:52,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:08:52,770 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:08:52,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:08:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1644286237, now seen corresponding path program 1 times [2018-11-28 18:08:52,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:08:52,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:08:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:52,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:08:52,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:08:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 18:08:52,815 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 18:08:52,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:52 BoogieIcfgContainer [2018-11-28 18:08:52,850 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:08:52,850 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:08:52,850 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:08:52,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:08:52,851 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:08:48" (3/4) ... [2018-11-28 18:08:52,854 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 18:08:52,904 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:08:52,904 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:08:52,905 INFO L168 Benchmark]: Toolchain (without parser) took 6256.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 849.2 MB in the end (delta: 92.8 MB). Peak memory consumption was 207.6 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:52,909 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:52,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:52,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:52,912 INFO L168 Benchmark]: Boogie Preprocessor took 50.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:52,912 INFO L168 Benchmark]: RCFGBuilder took 678.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:52,912 INFO L168 Benchmark]: TraceAbstraction took 4732.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 849.2 MB in the end (delta: 227.1 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:08:52,913 INFO L168 Benchmark]: Witness Printer took 53.88 ms. Allocated memory is still 1.1 GB. Free memory is still 849.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:08:52,916 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -166.5 MB). Peak memory consumption was 38.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 678.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4732.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 849.2 MB in the end (delta: 227.1 MB). Peak memory consumption was 227.1 MB. Max. memory is 11.5 GB. * Witness Printer took 53.88 ms. Allocated memory is still 1.1 GB. Free memory is still 849.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] SLL* list = malloc(sizeof(SLL)); [L995] list->next = ((void*)0) [L996] list->prev = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE ((void*)0) != end [L1034] EXPR end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR end->next VAL [end={17:0}, end->next={0:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={17:0}, list={17:0}, malloc(sizeof(SLL))={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. UNSAFE Result, 4.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 189 SDslu, 294 SDs, 0 SdLazy, 230 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 84 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 82 ConstructedInterpolants, 6 QuantifiedInterpolants, 8564 SizeOfPredicates, 11 NumberOfNonLiveVariables, 90 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...