./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/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_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/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-635dfa2 [2018-12-08 19:04:07,853 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:04:07,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:04:07,860 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:04:07,860 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:04:07,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:04:07,861 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:04:07,862 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:04:07,863 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:04:07,863 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:04:07,864 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:04:07,864 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:04:07,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:04:07,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:04:07,865 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:04:07,866 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:04:07,866 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:04:07,867 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:04:07,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:04:07,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:04:07,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:04:07,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:04:07,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:04:07,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:04:07,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:04:07,872 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:04:07,872 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:04:07,873 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:04:07,873 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:04:07,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:04:07,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:04:07,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:04:07,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:04:07,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:04:07,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:04:07,876 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:04:07,876 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:04:07,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:04:07,884 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:04:07,884 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:04:07,884 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:04:07,884 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:04:07,884 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:04:07,884 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:04:07,884 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:04:07,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:04:07,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:04:07,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:04:07,886 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:04:07,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:04:07,887 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:04:07,887 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_14395515-beb6-4894-be05-9b97f5d02f2c/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-12-08 19:04:07,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:04:07,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:04:07,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:04:07,914 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:04:07,914 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:04:07,915 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-08 19:04:07,947 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/data/bbf01b52c/bc0ba36858094cd286c39bd6a8428d20/FLAG42dd51603 [2018-12-08 19:04:08,347 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:04:08,347 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-08 19:04:08,353 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/data/bbf01b52c/bc0ba36858094cd286c39bd6a8428d20/FLAG42dd51603 [2018-12-08 19:04:08,361 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/data/bbf01b52c/bc0ba36858094cd286c39bd6a8428d20 [2018-12-08 19:04:08,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:04:08,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:04:08,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:04:08,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:04:08,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:04:08,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3629c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08, skipping insertion in model container [2018-12-08 19:04:08,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:04:08,392 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:04:08,532 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:04:08,538 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:04:08,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:04:08,613 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:04:08,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08 WrapperNode [2018-12-08 19:04:08,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:04:08,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:04:08,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:04:08,614 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:04:08,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,632 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:04:08,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:04:08,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:04:08,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:04:08,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... [2018-12-08 19:04:08,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:04:08,652 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:04:08,652 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:04:08,652 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:04:08,653 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/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-12-08 19:04:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:04:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 19:04:08,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:04:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 19:04:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 19:04:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 19:04:08,686 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 19:04:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 19:04:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 19:04:08,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:04:08,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:04:08,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:04:08,871 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:04:08,871 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-08 19:04:08,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:04:08 BoogieIcfgContainer [2018-12-08 19:04:08,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:04:08,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:04:08,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:04:08,874 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:04:08,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:04:08" (1/3) ... [2018-12-08 19:04:08,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51231274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:04:08, skipping insertion in model container [2018-12-08 19:04:08,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:04:08" (2/3) ... [2018-12-08 19:04:08,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51231274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:04:08, skipping insertion in model container [2018-12-08 19:04:08,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:04:08" (3/3) ... [2018-12-08 19:04:08,877 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-12-08 19:04:08,885 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:04:08,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:04:08,905 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:04:08,923 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:04:08,923 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:04:08,923 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:04:08,923 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:04:08,923 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:04:08,923 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:04:08,923 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:04:08,923 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:04:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-12-08 19:04:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-08 19:04:08,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:08,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:04:08,939 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:08,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:08,942 INFO L82 PathProgramCache]: Analyzing trace with hash -807935886, now seen corresponding path program 1 times [2018-12-08 19:04:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:08,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:08,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:09,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 19:04:09,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:09,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 19:04:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 19:04:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 19:04:09,038 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-12-08 19:04:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:09,051 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2018-12-08 19:04:09,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 19:04:09,052 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-08 19:04:09,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:09,057 INFO L225 Difference]: With dead ends: 59 [2018-12-08 19:04:09,057 INFO L226 Difference]: Without dead ends: 27 [2018-12-08 19:04:09,059 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-12-08 19:04:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-08 19:04:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-08 19:04:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-08 19:04:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-12-08 19:04:09,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 10 [2018-12-08 19:04:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:09,079 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-12-08 19:04:09,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 19:04:09,079 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-08 19:04:09,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 19:04:09,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:09,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:04:09,080 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:09,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:09,080 INFO L82 PathProgramCache]: Analyzing trace with hash 711422280, now seen corresponding path program 1 times [2018-12-08 19:04:09,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:09,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:09,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:09,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:04:09,129 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:09,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:04:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:04:09,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:04:09,130 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-12-08 19:04:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:09,169 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-08 19:04:09,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:04:09,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-08 19:04:09,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:09,170 INFO L225 Difference]: With dead ends: 35 [2018-12-08 19:04:09,170 INFO L226 Difference]: Without dead ends: 33 [2018-12-08 19:04:09,170 INFO L631 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-12-08 19:04:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-08 19:04:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-12-08 19:04:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 19:04:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-08 19:04:09,173 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-12-08 19:04:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-08 19:04:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:04:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-08 19:04:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 19:04:09,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:09,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:04:09,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:09,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:09,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1678513884, now seen corresponding path program 1 times [2018-12-08 19:04:09,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:09,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:04:09,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:09,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:04:09,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:04:09,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:04:09,230 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2018-12-08 19:04:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:09,286 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-08 19:04:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:04:09,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-08 19:04:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:09,287 INFO L225 Difference]: With dead ends: 51 [2018-12-08 19:04:09,287 INFO L226 Difference]: Without dead ends: 49 [2018-12-08 19:04:09,287 INFO L631 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-12-08 19:04:09,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-08 19:04:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-12-08 19:04:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-08 19:04:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-08 19:04:09,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 14 [2018-12-08 19:04:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:09,291 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-08 19:04:09,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:04:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-08 19:04:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-08 19:04:09,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:09,292 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:04:09,292 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:09,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1763906605, now seen corresponding path program 1 times [2018-12-08 19:04:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:09,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:04:09,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 19:04:09,432 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-08 19:04:09,433 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [13], [15], [18], [25], [35], [39], [46], [49], [50], [117], [118], [119] [2018-12-08 19:04:09,452 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 19:04:09,453 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 19:04:09,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 19:04:09,532 INFO L272 AbstractInterpreter]: Visited 16 different actions 16 times. Never merged. Never widened. Performed 113 root evaluator evaluations with a maximum evaluation depth of 3. Performed 113 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-08 19:04:09,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:09,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 19:04:09,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 19:04:09,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/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-12-08 19:04:09,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:09,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 19:04:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:09,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 19:04:09,601 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-12-08 19:04:09,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,616 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-12-08 19:04:09,618 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-12-08 19:04:09,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,631 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-12-08 19:04:09,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 19:04:09,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 19:04:09,652 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-12-08 19:04:09,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,681 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 41 treesize of output 31 [2018-12-08 19:04:09,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 19:04:09,685 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-12-08 19:04:09,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,705 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 32 treesize of output 33 [2018-12-08 19:04:09,707 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 12 treesize of output 1 [2018-12-08 19:04:09,707 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,724 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:56, output treesize:17 [2018-12-08 19:04:09,740 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-12-08 19:04:09,742 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-12-08 19:04:09,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,751 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-12-08 19:04:09,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-12-08 19:04:09,788 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-12-08 19:04:09,790 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-12-08 19:04:09,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,796 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-12-08 19:04:09,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,800 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-12-08 19:04:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 19:04:09,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 19:04:09,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-12-08 19:04:09,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:87 [2018-12-08 19:04:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-08 19:04:09,926 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:53, output treesize:1 [2018-12-08 19:04:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:09,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 19:04:09,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2018-12-08 19:04:09,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 19:04:09,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 19:04:09,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 19:04:09,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:04:09,944 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 11 states. [2018-12-08 19:04:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:10,418 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2018-12-08 19:04:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 19:04:10,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2018-12-08 19:04:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:10,420 INFO L225 Difference]: With dead ends: 100 [2018-12-08 19:04:10,420 INFO L226 Difference]: Without dead ends: 98 [2018-12-08 19:04:10,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=504, Unknown=0, NotChecked=0, Total=702 [2018-12-08 19:04:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-08 19:04:10,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 36. [2018-12-08 19:04:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-08 19:04:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-12-08 19:04:10,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2018-12-08 19:04:10,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:10,425 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-08 19:04:10,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 19:04:10,425 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-12-08 19:04:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 19:04:10,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:10,425 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-12-08 19:04:10,426 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:10,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1644345819, now seen corresponding path program 1 times [2018-12-08 19:04:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:10,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:10,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:10,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:04:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:04:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:04:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:04:10,493 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:04:10,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:04:10,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:04:10,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:04:10,493 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 5 states. [2018-12-08 19:04:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:04:10,530 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-12-08 19:04:10,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:04:10,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-08 19:04:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:04:10,531 INFO L225 Difference]: With dead ends: 52 [2018-12-08 19:04:10,532 INFO L226 Difference]: Without dead ends: 44 [2018-12-08 19:04:10,532 INFO L631 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-12-08 19:04:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-08 19:04:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-12-08 19:04:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-08 19:04:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-12-08 19:04:10,535 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-12-08 19:04:10,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:04:10,535 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-12-08 19:04:10,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:04:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-12-08 19:04:10,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-08 19:04:10,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:04:10,536 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-12-08 19:04:10,536 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:04:10,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:04:10,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1644286237, now seen corresponding path program 1 times [2018-12-08 19:04:10,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:04:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:04:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:04:10,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:04:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:04:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:04:10,566 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:04:10,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:04:10 BoogieIcfgContainer [2018-12-08 19:04:10,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:04:10,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:04:10,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:04:10,583 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:04:10,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:04:08" (3/4) ... [2018-12-08 19:04:10,584 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:04:10,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_14395515-beb6-4894-be05-9b97f5d02f2c/bin-2019/utaipan/witness.graphml [2018-12-08 19:04:10,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:04:10,609 INFO L168 Benchmark]: Toolchain (without parser) took 2245.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 956.0 MB in the beginning and 773.9 MB in the end (delta: 182.1 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2018-12-08 19:04:10,610 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:04:10,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 19:04:10,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.92 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-12-08 19:04:10,610 INFO L168 Benchmark]: Boogie Preprocessor took 20.13 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-12-08 19:04:10,611 INFO L168 Benchmark]: RCFGBuilder took 219.21 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-08 19:04:10,611 INFO L168 Benchmark]: TraceAbstraction took 1710.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 773.9 MB in the end (delta: 284.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:04:10,611 INFO L168 Benchmark]: Witness Printer took 25.81 ms. Allocated memory is still 1.1 GB. Free memory is still 773.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:04:10,613 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 248.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.92 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. * Boogie Preprocessor took 20.13 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 219.21 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: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1710.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 773.9 MB in the end (delta: 284.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. * Witness Printer took 25.81 ms. Allocated memory is still 1.1 GB. Free memory is still 773.9 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] SLL* list = malloc(sizeof(SLL)); [L996] list->next = ((void*)0) [L997] list->colour = BLACK [L999] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end [L1032] EXPR end->colour VAL [end={11:0}, end->colour=1, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={11:0}, end->next={0:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] [L1038] COND TRUE !(end->next) [L1038] __VERIFIER_error() VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 34 locations, 3 error locations. UNSAFE Result, 1.6s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 220 SDslu, 326 SDs, 0 SdLazy, 253 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, 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, 93 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 98 ConstructedInterpolants, 8 QuantifiedInterpolants, 11172 SizeOfPredicates, 11 NumberOfNonLiveVariables, 88 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...