./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/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 1f270b702de634d3ad2ee5a400388c6410a4cf10 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:56:52,109 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:56:52,110 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:56:52,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:56:52,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:56:52,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:56:52,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:56:52,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:56:52,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:56:52,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:56:52,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:56:52,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:56:52,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:56:52,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:56:52,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:56:52,125 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:56:52,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:56:52,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:56:52,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:56:52,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:56:52,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:56:52,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:56:52,132 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:56:52,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:56:52,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:56:52,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:56:52,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:56:52,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:56:52,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:56:52,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:56:52,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:56:52,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:56:52,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:56:52,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:56:52,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:56:52,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:56:52,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 17:56:52,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:56:52,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:56:52,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:56:52,149 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:56:52,149 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:56:52,149 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:56:52,149 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:56:52,149 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:56:52,150 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:56:52,150 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:56:52,150 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:56:52,150 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:56:52,150 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:56:52,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:56:52,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:56:52,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:56:52,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:56:52,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:56:52,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:56:52,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:56:52,154 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_bdffa058-9e90-4676-832b-1868d3d5f3b4/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 -> 1f270b702de634d3ad2ee5a400388c6410a4cf10 [2018-11-18 17:56:52,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:56:52,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:56:52,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:56:52,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:56:52,185 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:56:52,185 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 17:56:52,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/data/7b69ffe2c/bf775450c8124c4a8e5190ca31caa865/FLAGb62075e97 [2018-11-18 17:56:52,646 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:56:52,646 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 17:56:52,653 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/data/7b69ffe2c/bf775450c8124c4a8e5190ca31caa865/FLAGb62075e97 [2018-11-18 17:56:52,660 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/data/7b69ffe2c/bf775450c8124c4a8e5190ca31caa865 [2018-11-18 17:56:52,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:56:52,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:56:52,664 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:56:52,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:56:52,667 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:56:52,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:52,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249d3f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52, skipping insertion in model container [2018-11-18 17:56:52,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:52,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:56:52,703 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:56:52,888 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:56:52,895 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:56:52,923 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:56:52,997 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:56:52,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52 WrapperNode [2018-11-18 17:56:52,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:56:52,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:56:52,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:56:52,998 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:56:53,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:56:53,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:56:53,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:56:53,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:56:53,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... [2018-11-18 17:56:53,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:56:53,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:56:53,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:56:53,040 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:56:53,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/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 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:56:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:56:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:56:53,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:56:53,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:56:53,275 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:56:53,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:53 BoogieIcfgContainer [2018-11-18 17:56:53,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:56:53,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:56:53,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:56:53,278 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:56:53,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:56:52" (1/3) ... [2018-11-18 17:56:53,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a7cec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:56:53, skipping insertion in model container [2018-11-18 17:56:53,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:56:52" (2/3) ... [2018-11-18 17:56:53,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a7cec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:56:53, skipping insertion in model container [2018-11-18 17:56:53,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:53" (3/3) ... [2018-11-18 17:56:53,280 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2018-11-18 17:56:53,286 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:56:53,290 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-18 17:56:53,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-18 17:56:53,319 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:56:53,319 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:56:53,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:56:53,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:56:53,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:56:53,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:56:53,319 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:56:53,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:56:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 17:56:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 17:56:53,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,333 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:56:53,335 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2031652267, now seen corresponding path program 1 times [2018-11-18 17:56:53,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,422 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 17:56:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 17:56:53,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 17:56:53,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 17:56:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 17:56:53,436 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 17:56:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,449 INFO L93 Difference]: Finished difference Result 66 states and 97 transitions. [2018-11-18 17:56:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 17:56:53,450 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 17:56:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,458 INFO L225 Difference]: With dead ends: 66 [2018-11-18 17:56:53,458 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 17:56:53,460 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 17:56:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 17:56:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 17:56:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 17:56:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-18 17:56:53,482 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2018-11-18 17:56:53,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,482 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-18 17:56:53,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 17:56:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-18 17:56:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-18 17:56:53,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:56:53,483 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,484 INFO L82 PathProgramCache]: Analyzing trace with hash 920212841, now seen corresponding path program 1 times [2018-11-18 17:56:53,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,549 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 17:56:53,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 17:56:53,549 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 17:56:53,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 17:56:53,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 17:56:53,551 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 4 states. [2018-11-18 17:56:53,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,611 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-18 17:56:53,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 17:56:53,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-18 17:56:53,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,612 INFO L225 Difference]: With dead ends: 39 [2018-11-18 17:56:53,612 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 17:56:53,612 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 17:56:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 17:56:53,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-11-18 17:56:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 17:56:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-18 17:56:53,615 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2018-11-18 17:56:53,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,615 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-18 17:56:53,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 17:56:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-18 17:56:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 17:56:53,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,616 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:56:53,616 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -711552762, now seen corresponding path program 1 times [2018-11-18 17:56:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,706 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 17:56:53,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:53,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:56:53,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:53,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:56:53,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:56:53,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:56:53,707 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-18 17:56:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:53,792 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-11-18 17:56:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:56:53,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 17:56:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:53,793 INFO L225 Difference]: With dead ends: 59 [2018-11-18 17:56:53,793 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 17:56:53,793 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 17:56:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 17:56:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 38. [2018-11-18 17:56:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-18 17:56:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-18 17:56:53,797 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 16 [2018-11-18 17:56:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:53,797 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-18 17:56:53,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:56:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-18 17:56:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 17:56:53,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:53,798 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 17:56:53,798 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:53,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1214585581, now seen corresponding path program 1 times [2018-11-18 17:56:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:53,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:53,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:53,918 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 17:56:53,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:56:53,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:56:53,919 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-18 17:56:53,921 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [21], [26], [30], [37], [41], [49], [52], [53], [124], [125], [126] [2018-11-18 17:56:53,948 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:56:53,948 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:56:54,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 17:56:54,043 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 37 variables. [2018-11-18 17:56:54,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:54,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 17:56:54,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:56:54,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/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 17:56:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:54,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 17:56:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:54,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:56:54,105 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 17:56:54,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,117 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 17:56:54,119 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 17:56:54,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,126 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 17:56:54,126 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2018-11-18 17:56:54,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,160 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 17:56:54,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-18 17:56:54,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 17:56:54,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-18 17:56:54,209 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 17:56:54,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,216 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 17:56:54,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,224 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:62, output treesize:27 [2018-11-18 17:56:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,257 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 17:56:54,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,282 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 103 treesize of output 97 [2018-11-18 17:56:54,285 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 17:56:54,285 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:56:54,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 131 [2018-11-18 17:56:54,306 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 40 treesize of output 39 [2018-11-18 17:56:54,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,316 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,322 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 17:56:54,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-18 17:56:54,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 17:56:54,367 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-18 17:56:54,374 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 17 treesize of output 9 [2018-11-18 17:56:54,375 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,378 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 17:56:54,389 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:125, output treesize:43 [2018-11-18 17:56:54,462 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 17:56:54,465 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 17:56:54,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,473 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 17:56:54,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,478 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 17:56:54,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,484 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 17:56:54,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:45, output treesize:3 [2018-11-18 17:56:54,487 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 17:56:54,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:56:54,496 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 77 [2018-11-18 17:56:54,522 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 9 treesize of output 8 [2018-11-18 17:56:54,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 56 treesize of output 50 [2018-11-18 17:56:54,533 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 50 treesize of output 39 [2018-11-18 17:56:54,533 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 17:56:54,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:46 [2018-11-18 17:56:54,562 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 105 [2018-11-18 17:56:54,584 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 9 treesize of output 8 [2018-11-18 17:56:54,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 64 treesize of output 54 [2018-11-18 17:56:54,597 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 54 treesize of output 39 [2018-11-18 17:56:54,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 17:56:54,609 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:175, output treesize:55 [2018-11-18 17:56:54,632 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-18 17:56:54,632 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:91, output treesize:1 [2018-11-18 17:56:54,638 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 17:56:54,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 17:56:54,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-18 17:56:54,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 17:56:54,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 17:56:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:56:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:56:54,654 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 11 states. [2018-11-18 17:56:56,743 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-18 17:56:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:56,933 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-11-18 17:56:56,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 17:56:56,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-18 17:56:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:56,935 INFO L225 Difference]: With dead ends: 80 [2018-11-18 17:56:56,935 INFO L226 Difference]: Without dead ends: 78 [2018-11-18 17:56:56,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-11-18 17:56:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-18 17:56:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 26. [2018-11-18 17:56:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 17:56:56,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-18 17:56:56,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 20 [2018-11-18 17:56:56,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:56,939 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-18 17:56:56,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 17:56:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-18 17:56:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:56:56,940 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:56,941 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 17:56:56,941 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:56,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:56,941 INFO L82 PathProgramCache]: Analyzing trace with hash -65265866, now seen corresponding path program 1 times [2018-11-18 17:56:56,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:56,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:56,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:56,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:56:57,017 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 17:56:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:56:57,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:56:57,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:56:57,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:56:57,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:56:57,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:56:57,018 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 5 states. [2018-11-18 17:56:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:56:57,055 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-18 17:56:57,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:56:57,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-18 17:56:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:56:57,056 INFO L225 Difference]: With dead ends: 44 [2018-11-18 17:56:57,056 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 17:56:57,056 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 17:56:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 17:56:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-11-18 17:56:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 17:56:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-18 17:56:57,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2018-11-18 17:56:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:56:57,060 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-18 17:56:57,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:56:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-18 17:56:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 17:56:57,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:56:57,061 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 17:56:57,061 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:56:57,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:56:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash -65206284, now seen corresponding path program 1 times [2018-11-18 17:56:57,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:56:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:57,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:56:57,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:56:57,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:56:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:56:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 17:56:57,082 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 17:56:57,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:56:57 BoogieIcfgContainer [2018-11-18 17:56:57,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:56:57,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:56:57,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:56:57,103 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:56:57,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:56:53" (3/4) ... [2018-11-18 17:56:57,105 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 17:56:57,134 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bdffa058-9e90-4676-832b-1868d3d5f3b4/bin-2019/utaipan/witness.graphml [2018-11-18 17:56:57,135 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:56:57,135 INFO L168 Benchmark]: Toolchain (without parser) took 4472.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.4 MB in the beginning and 826.4 MB in the end (delta: 130.1 MB). Peak memory consumption was 274.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,136 INFO L168 Benchmark]: CDTParser took 0.12 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 17:56:57,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,137 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.24 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,137 INFO L168 Benchmark]: Boogie Preprocessor took 24.73 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,137 INFO L168 Benchmark]: RCFGBuilder took 235.68 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,138 INFO L168 Benchmark]: TraceAbstraction took 3826.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.7 MB in the end (delta: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,138 INFO L168 Benchmark]: Witness Printer took 31.92 ms. Allocated memory is still 1.2 GB. Free memory was 829.7 MB in the beginning and 826.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:56:57,140 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.12 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 333.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.24 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.73 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.68 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: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3826.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 829.7 MB in the end (delta: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 11.5 GB. * Witness Printer took 31.92 ms. Allocated memory is still 1.2 GB. Free memory was 829.7 MB in the beginning and 826.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1040]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L994] EXPR, FCALL malloc(sizeof(SLL)) [L994] SLL* list = malloc(sizeof(SLL)); [L995] FCALL list->next = ((void*)0) [L996] FCALL list->prev = ((void*)0) [L997] FCALL list->colour = BLACK [L999] SLL* end = list; VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1025] end = ((void*)0) [L1026] end = list VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(!(((void*)0) != end)) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1029] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1030] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1030] COND FALSE !(!(BLACK == end->colour)) [L1030] COND FALSE !(0) VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1032] COND TRUE ((void*)0) != end [L1034] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1034] COND FALSE !(RED == end->colour) [L1040] EXPR, FCALL end->next VAL [end={14:0}, end->next={0:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] [L1040] COND TRUE !(end->next) [L1040] __VERIFIER_error() VAL [end={14:0}, list={14:0}, malloc(sizeof(SLL))={14:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. UNSAFE Result, 3.7s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 164 SDtfs, 161 SDslu, 331 SDs, 0 SdLazy, 240 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.4s 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.8s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 115 ConstructedInterpolants, 12 QuantifiedInterpolants, 20436 SizeOfPredicates, 19 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...