./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-5842f4b [2018-11-18 11:12:29,443 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:12:29,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:12:29,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:12:29,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:12:29,451 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:12:29,452 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:12:29,453 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:12:29,454 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:12:29,455 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:12:29,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:12:29,456 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:12:29,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:12:29,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:12:29,458 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:12:29,458 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:12:29,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:12:29,460 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:12:29,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:12:29,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:12:29,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:12:29,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:12:29,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:12:29,465 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:12:29,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:12:29,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:12:29,466 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:12:29,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:12:29,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:12:29,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:12:29,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:12:29,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:12:29,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:12:29,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:12:29,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:12:29,470 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:12:29,470 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 11:12:29,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:12:29,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:12:29,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 11:12:29,480 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 11:12:29,480 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 11:12:29,481 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 11:12:29,481 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 11:12:29,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:12:29,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:12:29,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:12:29,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:12:29,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:12:29,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 11:12:29,484 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan 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 -> Taipan 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 -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2018-11-18 11:12:29,507 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:12:29,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:12:29,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:12:29,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:12:29,520 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:12:29,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 11:12:29,564 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/data/bc42d48d6/af248326f980461e86f9194020e1fafc/FLAG8a2af8fcc [2018-11-18 11:12:29,942 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:12:29,943 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 11:12:29,949 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/data/bc42d48d6/af248326f980461e86f9194020e1fafc/FLAG8a2af8fcc [2018-11-18 11:12:30,330 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/data/bc42d48d6/af248326f980461e86f9194020e1fafc [2018-11-18 11:12:30,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:12:30,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:12:30,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:12:30,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:12:30,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:12:30,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600c9fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30, skipping insertion in model container [2018-11-18 11:12:30,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:12:30,379 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:12:30,574 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:12:30,581 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:12:30,618 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:12:30,691 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:12:30,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30 WrapperNode [2018-11-18 11:12:30,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:12:30,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:12:30,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:12:30,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:12:30,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:12:30,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:12:30,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:12:30,713 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:12:30,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... [2018-11-18 11:12:30,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:12:30,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:12:30,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:12:30,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:12:30,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/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-18 11:12:30,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:12:30,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:12:30,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 11:12:30,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:12:30,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:12:30,982 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:12:30,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:30 BoogieIcfgContainer [2018-11-18 11:12:30,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:12:30,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:12:30,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:12:30,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:12:30,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:12:30" (1/3) ... [2018-11-18 11:12:30,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c8769c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:30, skipping insertion in model container [2018-11-18 11:12:30,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:12:30" (2/3) ... [2018-11-18 11:12:30,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c8769c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:12:30, skipping insertion in model container [2018-11-18 11:12:30,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:30" (3/3) ... [2018-11-18 11:12:30,990 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 11:12:30,997 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:12:31,002 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-18 11:12:31,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-18 11:12:31,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:12:31,031 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:12:31,031 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:12:31,031 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:12:31,031 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:12:31,031 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:12:31,031 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:12:31,032 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:12:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 11:12:31,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 11:12:31,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:31,047 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:31,049 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:31,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2031652267, now seen corresponding path program 1 times [2018-11-18 11:12:31,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:31,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:31,143 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-18 11:12:31,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:31,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:12:31,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:31,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 11:12:31,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 11:12:31,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 11:12:31,158 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 11:12:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:31,171 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2018-11-18 11:12:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 11:12:31,172 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 11:12:31,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:31,180 INFO L225 Difference]: With dead ends: 66 [2018-11-18 11:12:31,180 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 11:12:31,183 INFO L604 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-18 11:12:31,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 11:12:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 11:12:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 11:12:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-18 11:12:31,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-11-18 11:12:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:31,204 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-18 11:12:31,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 11:12:31,204 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 11:12:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 11:12:31,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:31,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:31,205 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 920212841, now seen corresponding path program 1 times [2018-11-18 11:12:31,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:31,249 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-18 11:12:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:31,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 11:12:31,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:31,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 11:12:31,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 11:12:31,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 11:12:31,252 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 4 states. [2018-11-18 11:12:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:31,317 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 11:12:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 11:12:31,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 11:12:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:31,318 INFO L225 Difference]: With dead ends: 39 [2018-11-18 11:12:31,318 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 11:12:31,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:12:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 11:12:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-11-18 11:12:31,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 11:12:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 11:12:31,323 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2018-11-18 11:12:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:31,323 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 11:12:31,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 11:12:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 11:12:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 11:12:31,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:31,324 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:31,324 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:31,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:31,324 INFO L82 PathProgramCache]: Analyzing trace with hash -711552762, now seen corresponding path program 1 times [2018-11-18 11:12:31,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:31,430 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-18 11:12:31,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:12:31,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:12:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:12:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:12:31,432 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-18 11:12:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:31,504 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 11:12:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:12:31,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 11:12:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:31,505 INFO L225 Difference]: With dead ends: 59 [2018-11-18 11:12:31,505 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 11:12:31,505 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-18 11:12:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 11:12:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2018-11-18 11:12:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 11:12:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-18 11:12:31,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 16 [2018-11-18 11:12:31,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:31,511 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-18 11:12:31,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:12:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-18 11:12:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 11:12:31,512 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:31,512 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:12:31,512 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:31,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1214585581, now seen corresponding path program 1 times [2018-11-18 11:12:31,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:31,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:31,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:31,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:12:31,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 11:12:31,680 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-18 11:12:31,681 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [21], [26], [30], [37], [41], [49], [52], [53], [124], [125], [126] [2018-11-18 11:12:31,704 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 11:12:31,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 11:12:31,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 11:12:31,798 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Performed 121 root evaluator evaluations with a maximum evaluation depth of 3. Performed 121 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-11-18 11:12:31,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:31,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 11:12:31,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 11:12:31,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/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-18 11:12:31,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:31,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 11:12:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:31,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:12:31,860 INFO L477 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-18 11:12:31,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,869 INFO L477 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-18 11:12:31,871 INFO L477 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-18 11:12:31,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,878 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-18 11:12:31,878 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-18 11:12:31,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:12:31,892 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:12:31,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-11-18 11:12:31,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-11-18 11:12:31,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:12:31,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:12:31,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:12:31,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 11:12:31,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:31,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-11-18 11:12:31,986 INFO L477 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-18 11:12:31,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-18 11:12:32,004 INFO L477 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-18 11:12:32,005 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,019 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-18 11:12:32,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 11:12:32,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:65, output treesize:43 [2018-11-18 11:12:32,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2018-11-18 11:12:32,118 INFO L477 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-18 11:12:32,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,127 INFO L477 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-18 11:12:32,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,132 INFO L477 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-18 11:12:32,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-18 11:12:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:32,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 11:12:32,248 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 11:12:32,249 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:91, output treesize:1 [2018-11-18 11:12:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:12:32,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 11:12:32,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-11-18 11:12:32,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 11:12:32,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 11:12:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 11:12:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-18 11:12:32,269 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 10 states. [2018-11-18 11:12:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:32,557 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 11:12:32,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 11:12:32,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-11-18 11:12:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:32,558 INFO L225 Difference]: With dead ends: 80 [2018-11-18 11:12:32,558 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 11:12:32,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2018-11-18 11:12:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 11:12:32,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 26. [2018-11-18 11:12:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 11:12:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 11:12:32,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-18 11:12:32,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:32,563 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 11:12:32,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 11:12:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 11:12:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:12:32,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:32,564 INFO L375 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] [2018-11-18 11:12:32,564 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:32,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash -65265866, now seen corresponding path program 1 times [2018-11-18 11:12:32,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:32,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:32,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:32,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:32,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:12:32,631 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-18 11:12:32,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:12:32,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:12:32,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 11:12:32,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 11:12:32,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:12:32,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:12:32,632 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-18 11:12:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:12:32,684 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 11:12:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 11:12:32,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 11:12:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:12:32,684 INFO L225 Difference]: With dead ends: 44 [2018-11-18 11:12:32,684 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 11:12:32,685 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 11:12:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 11:12:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-18 11:12:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 11:12:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 11:12:32,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2018-11-18 11:12:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:12:32,688 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 11:12:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 11:12:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 11:12:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 11:12:32,688 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:12:32,688 INFO L375 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] [2018-11-18 11:12:32,688 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:12:32,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:12:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash -65206284, now seen corresponding path program 1 times [2018-11-18 11:12:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 11:12:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:12:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:12:32,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 11:12:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:12:32,712 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 11:12:32,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:12:32 BoogieIcfgContainer [2018-11-18 11:12:32,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:12:32,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:12:32,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:12:32,733 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:12:32,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:12:30" (3/4) ... [2018-11-18 11:12:32,735 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 11:12:32,763 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d5f2b9e3-8359-41f4-a739-29d342a1edb1/bin-2019/utaipan/witness.graphml [2018-11-18 11:12:32,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:12:32,763 INFO L168 Benchmark]: Toolchain (without parser) took 2430.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.4 MB in the beginning and 882.8 MB in the end (delta: 72.5 MB). Peak memory consumption was 217.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:32,764 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:12:32,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:32,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:12:32,765 INFO L168 Benchmark]: Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:32,766 INFO L168 Benchmark]: RCFGBuilder took 245.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:32,766 INFO L168 Benchmark]: TraceAbstraction took 1748.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2018-11-18 11:12:32,767 INFO L168 Benchmark]: Witness Printer took 30.15 ms. Allocated memory is still 1.2 GB. Free memory is still 882.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:12:32,769 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1748.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 882.8 MB in the end (delta: 220.8 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. * Witness Printer took 30.15 ms. Allocated memory is still 1.2 GB. Free memory is still 882.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L995] EXPR, FCALL malloc(sizeof(SLL)) [L995] SLL* list = malloc(sizeof(SLL)); [L996] FCALL list->next = ((void*)0) [L997] FCALL list->colour = BLACK [L999] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1027] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1028] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1028] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1030] COND TRUE ((void*)0) != end [L1032] EXPR, FCALL end->colour VAL [end={10:0}, end->colour=1, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 1.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 151 SDslu, 318 SDs, 0 SdLazy, 229 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 86 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 115 ConstructedInterpolants, 12 QuantifiedInterpolants, 21025 SizeOfPredicates, 15 NumberOfNonLiveVariables, 100 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...