./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:14:49,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:14:49,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:14:49,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:14:49,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:14:49,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:14:49,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:14:49,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:14:49,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:14:49,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:14:49,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:14:49,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:14:49,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:14:49,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:14:49,277 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:14:49,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:14:49,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:14:49,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:14:49,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:14:49,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:14:49,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:14:49,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:14:49,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:14:49,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:14:49,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:14:49,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:14:49,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:14:49,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:14:49,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:14:49,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:14:49,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:14:49,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:14:49,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:14:49,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:14:49,304 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:14:49,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:14:49,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:14:49,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:14:49,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:14:49,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:14:49,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:14:49,310 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-20 23:14:49,334 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:14:49,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:14:49,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:14:49,335 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:14:49,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:14:49,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:14:49,336 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:14:49,336 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:14:49,336 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:14:49,336 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 23:14:49,337 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:14:49,337 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:14:49,337 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 23:14:49,337 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 23:14:49,337 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:14:49,338 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 23:14:49,338 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 23:14:49,338 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 23:14:49,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:14:49,339 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:14:49,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 23:14:49,339 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:14:49,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:14:49,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:14:49,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:14:49,340 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:14:49,340 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:14:49,340 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:14:49,341 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:14:49,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:14:49,341 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:14:49,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:14:49,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:14:49,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:14:49,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:14:49,342 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:14:49,342 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 23:14:49,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 23:14:49,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:14:49,343 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:14:49,343 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:14:49,343 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P 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(reach_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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2021-11-20 23:14:49,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:14:49,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:14:49,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:14:49,644 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:14:49,645 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:14:49,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-20 23:14:49,719 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/705376e23/373e801da1ae4d54b24a14ed3da60246/FLAG1ec610865 [2021-11-20 23:14:50,293 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:14:50,294 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-20 23:14:50,323 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/705376e23/373e801da1ae4d54b24a14ed3da60246/FLAG1ec610865 [2021-11-20 23:14:50,605 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/705376e23/373e801da1ae4d54b24a14ed3da60246 [2021-11-20 23:14:50,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:14:50,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:14:50,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:14:50,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:14:50,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:14:50,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:50" (1/1) ... [2021-11-20 23:14:50,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680a907c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:50, skipping insertion in model container [2021-11-20 23:14:50,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:50" (1/1) ... [2021-11-20 23:14:50,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:14:50,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:14:51,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-20 23:14:51,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:14:51,119 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:14:51,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-20 23:14:51,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:14:51,205 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:14:51,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51 WrapperNode [2021-11-20 23:14:51,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:14:51,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:14:51,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:14:51,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:14:51,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,257 INFO L137 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 154 [2021-11-20 23:14:51,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:14:51,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:14:51,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:14:51,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:14:51,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:14:51,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:14:51,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:14:51,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:14:51,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (1/1) ... [2021-11-20 23:14:51,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:14:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:51,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:14:51,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:14:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 23:14:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 23:14:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:14:51,381 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:14:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:14:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:14:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:14:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:14:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:14:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:14:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:14:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 23:14:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:14:51,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:14:51,559 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:14:51,560 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:14:51,908 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:14:52,017 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:14:52,018 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:14:52,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:52 BoogieIcfgContainer [2021-11-20 23:14:52,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:14:52,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:14:52,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:14:52,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:14:52,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:14:50" (1/3) ... [2021-11-20 23:14:52,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c0f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:52, skipping insertion in model container [2021-11-20 23:14:52,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:51" (2/3) ... [2021-11-20 23:14:52,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26c0f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:52, skipping insertion in model container [2021-11-20 23:14:52,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:52" (3/3) ... [2021-11-20 23:14:52,031 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2021-11-20 23:14:52,040 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:14:52,041 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:14:52,084 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:14:52,092 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:14:52,092 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 23:14:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:14:52,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 23:14:52,113 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:52,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:52,114 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:14:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash 647624886, now seen corresponding path program 1 times [2021-11-20 23:14:52,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:52,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503919944] [2021-11-20 23:14:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:52,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:52,403 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:52,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503919944] [2021-11-20 23:14:52,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503919944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:52,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:52,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 23:14:52,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393318746] [2021-11-20 23:14:52,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:52,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 23:14:52,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 23:14:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:14:52,443 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:14:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:52,554 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2021-11-20 23:14:52,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 23:14:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2021-11-20 23:14:52,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:52,586 INFO L225 Difference]: With dead ends: 32 [2021-11-20 23:14:52,586 INFO L226 Difference]: Without dead ends: 18 [2021-11-20 23:14:52,594 INFO L932 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 [2021-11-20 23:14:52,599 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:52,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 23:14:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-20 23:14:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-20 23:14:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:14:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2021-11-20 23:14:52,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 16 [2021-11-20 23:14:52,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:52,636 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2021-11-20 23:14:52,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:14:52,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2021-11-20 23:14:52,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 23:14:52,638 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:52,638 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:52,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 23:14:52,640 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:14:52,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 647610967, now seen corresponding path program 1 times [2021-11-20 23:14:52,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:52,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136054094] [2021-11-20 23:14:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:52,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-20 23:14:52,775 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:52,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136054094] [2021-11-20 23:14:52,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136054094] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:52,777 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:52,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 23:14:52,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396684123] [2021-11-20 23:14:52,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:52,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 23:14:52,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 23:14:52,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:14:52,782 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:14:53,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:53,456 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2021-11-20 23:14:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 23:14:53,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-11-20 23:14:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:53,458 INFO L225 Difference]: With dead ends: 31 [2021-11-20 23:14:53,458 INFO L226 Difference]: Without dead ends: 19 [2021-11-20 23:14:53,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 23:14:53,460 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:53,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-11-20 23:14:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-20 23:14:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-11-20 23:14:53,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:14:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-20 23:14:53,467 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2021-11-20 23:14:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:53,468 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-20 23:14:53,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 23:14:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-20 23:14:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-20 23:14:53,469 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:53,470 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:53,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 23:14:53,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:14:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:53,471 INFO L85 PathProgramCache]: Analyzing trace with hash -687658553, now seen corresponding path program 1 times [2021-11-20 23:14:53,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:53,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588998434] [2021-11-20 23:14:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:53,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-20 23:14:53,638 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:53,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588998434] [2021-11-20 23:14:53,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588998434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 23:14:53,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:14:53,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 23:14:53,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68362115] [2021-11-20 23:14:53,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 23:14:53,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:14:53,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:14:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:14:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:14:53,644 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 23:14:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:14:54,088 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-11-20 23:14:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:14:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-11-20 23:14:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:14:54,090 INFO L225 Difference]: With dead ends: 26 [2021-11-20 23:14:54,090 INFO L226 Difference]: Without dead ends: 20 [2021-11-20 23:14:54,091 INFO L932 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 [2021-11-20 23:14:54,092 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-20 23:14:54,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-20 23:14:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-20 23:14:54,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-20 23:14:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:14:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-11-20 23:14:54,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 22 [2021-11-20 23:14:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:14:54,100 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-11-20 23:14:54,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-11-20 23:14:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2021-11-20 23:14:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-20 23:14:54,101 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:14:54,101 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:14:54,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 23:14:54,102 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:14:54,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:14:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash 67418736, now seen corresponding path program 1 times [2021-11-20 23:14:54,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 23:14:54,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241089108] [2021-11-20 23:14:54,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:54,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 23:14:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:14:56,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 23:14:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241089108] [2021-11-20 23:14:56,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241089108] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 23:14:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496024330] [2021-11-20 23:14:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:14:56,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:14:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:14:56,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 23:14:56,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 23:14:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:14:56,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 111 conjunts are in the unsatisfiable core [2021-11-20 23:14:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:14:56,703 INFO L388 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 [2021-11-20 23:14:56,782 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-11-20 23:14:56,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:56,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 12 treesize of output 14 [2021-11-20 23:14:57,254 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:14:57,254 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 17 [2021-11-20 23:14:57,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2021-11-20 23:14:57,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:14:57,482 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-20 23:14:57,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-11-20 23:14:57,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2021-11-20 23:14:57,697 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 23:14:57,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 48 [2021-11-20 23:14:57,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2021-11-20 23:14:58,014 INFO L354 Elim1Store]: treesize reduction 268, result has 11.8 percent of original size [2021-11-20 23:14:58,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 310 treesize of output 154 [2021-11-20 23:14:58,058 INFO L354 Elim1Store]: treesize reduction 250, result has 12.9 percent of original size [2021-11-20 23:14:58,059 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 266 treesize of output 185 [2021-11-20 23:15:00,523 INFO L354 Elim1Store]: treesize reduction 104, result has 1.0 percent of original size [2021-11-20 23:15:00,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 173 treesize of output 63 [2021-11-20 23:15:00,536 INFO L388 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 51 treesize of output 41 [2021-11-20 23:15:00,550 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:15:00,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 32 [2021-11-20 23:15:06,980 INFO L354 Elim1Store]: treesize reduction 295, result has 10.3 percent of original size [2021-11-20 23:15:06,981 INFO L388 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 3 case distinctions, treesize of input 252 treesize of output 259 [2021-11-20 23:15:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:07,169 INFO L354 Elim1Store]: treesize reduction 663, result has 7.0 percent of original size [2021-11-20 23:15:07,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 231 treesize of output 150 [2021-11-20 23:15:07,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:07,207 INFO L354 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2021-11-20 23:15:07,208 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 220 treesize of output 184 [2021-11-20 23:15:07,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:07,241 INFO L354 Elim1Store]: treesize reduction 64, result has 28.1 percent of original size [2021-11-20 23:15:07,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 209 treesize of output 209 [2021-11-20 23:15:08,501 INFO L354 Elim1Store]: treesize reduction 242, result has 0.4 percent of original size [2021-11-20 23:15:08,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 4483 treesize of output 3291 [2021-11-20 23:15:08,623 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-11-20 23:15:08,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4908 treesize of output 4550 [2021-11-20 23:15:09,077 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-20 23:15:09,078 INFO L388 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 1 case distinctions, treesize of input 4536 treesize of output 4524 [2021-11-20 23:15:09,257 INFO L354 Elim1Store]: treesize reduction 239, result has 9.8 percent of original size [2021-11-20 23:15:09,257 INFO L388 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 3 case distinctions, treesize of input 4521 treesize of output 4495 [2021-11-20 23:15:10,650 INFO L388 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 23 treesize of output 11 [2021-11-20 23:15:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:15:10,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:10,895 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Some non-self update cases but no top-level DER relation [2021-11-20 23:15:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1125901470] [2021-11-20 23:15:10,916 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2021-11-20 23:15:10,916 INFO L166 IcfgInterpreter]: Building call graph [2021-11-20 23:15:10,921 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-20 23:15:10,927 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-20 23:15:10,928 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-20 23:15:11,008 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@301e0f1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:388) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:903) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:243) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:233) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:278) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:15:11,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-11-20 23:15:11,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-11-20 23:15:11,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770168197] [2021-11-20 23:15:11,023 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-11-20 23:15:11,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 23:15:11,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 23:15:11,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 23:15:11,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1317, Unknown=2, NotChecked=0, Total=1406 [2021-11-20 23:15:11,027 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:15:11,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 23:15:11,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=87, Invalid=1317, Unknown=2, NotChecked=0, Total=1406 [2021-11-20 23:15:11,033 INFO L933 BasicCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:11,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:15:11,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:11,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 23:15:11,237 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@301e0f1 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:359) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-20 23:15:11,240 INFO L158 Benchmark]: Toolchain (without parser) took 20630.93ms. Allocated memory was 88.1MB in the beginning and 207.6MB in the end (delta: 119.5MB). Free memory was 66.5MB in the beginning and 173.5MB in the end (delta: -107.1MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,240 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 51.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.56ms. Allocated memory is still 88.1MB. Free memory was 66.3MB in the beginning and 56.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.16ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,241 INFO L158 Benchmark]: Boogie Preprocessor took 34.05ms. Allocated memory is still 88.1MB. Free memory was 53.9MB in the beginning and 52.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,242 INFO L158 Benchmark]: RCFGBuilder took 727.47ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.1MB in the beginning and 87.9MB in the end (delta: -35.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,242 INFO L158 Benchmark]: TraceAbstraction took 19215.11ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 87.3MB in the beginning and 173.5MB in the end (delta: -86.2MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2021-11-20 23:15:11,244 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.7MB in the end (delta: 51.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 595.56ms. Allocated memory is still 88.1MB. Free memory was 66.3MB in the beginning and 56.4MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.16ms. Allocated memory is still 88.1MB. Free memory was 56.2MB in the beginning and 53.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.05ms. Allocated memory is still 88.1MB. Free memory was 53.9MB in the beginning and 52.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.47ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 52.1MB in the beginning and 87.9MB in the end (delta: -35.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19215.11ms. Allocated memory was 117.4MB in the beginning and 207.6MB in the end (delta: 90.2MB). Free memory was 87.3MB in the beginning and 173.5MB in the end (delta: -86.2MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@301e0f1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@301e0f1: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-20 23:15:11,274 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 23:15:13,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 23:15:13,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 23:15:13,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 23:15:13,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 23:15:13,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 23:15:13,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 23:15:13,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 23:15:13,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 23:15:13,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 23:15:13,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 23:15:13,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 23:15:13,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 23:15:13,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 23:15:13,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 23:15:13,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 23:15:13,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 23:15:13,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 23:15:13,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 23:15:13,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 23:15:13,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 23:15:13,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 23:15:13,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 23:15:13,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 23:15:13,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 23:15:13,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 23:15:13,857 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 23:15:13,858 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 23:15:13,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 23:15:13,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 23:15:13,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 23:15:13,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 23:15:13,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 23:15:13,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 23:15:13,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 23:15:13,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 23:15:13,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 23:15:13,867 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 23:15:13,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 23:15:13,868 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 23:15:13,869 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 23:15:13,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-20 23:15:13,896 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 23:15:13,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 23:15:13,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 23:15:13,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 23:15:13,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 23:15:13,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 23:15:13,901 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 23:15:13,901 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 23:15:13,901 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 23:15:13,901 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 23:15:13,902 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 23:15:13,903 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 23:15:13,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 23:15:13,905 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 23:15:13,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 23:15:13,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 23:15:13,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 23:15:13,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 23:15:13,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 23:15:13,906 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 23:15:13,906 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 23:15:13,906 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 23:15:13,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 23:15:13,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 23:15:13,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 23:15:13,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 23:15:13,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 23:15:13,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 23:15:13,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:15:13,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 23:15:13,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 23:15:13,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 23:15:13,909 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-20 23:15:13,909 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 23:15:13,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 23:15:13,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 23:15:13,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 23:15:13,911 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P 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(reach_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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2021-11-20 23:15:14,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 23:15:14,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 23:15:14,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 23:15:14,318 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 23:15:14,319 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 23:15:14,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-20 23:15:14,401 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/b5b278213/3414ebbb87af4dfaac8a16e2be3291d3/FLAGe3570e08e [2021-11-20 23:15:15,055 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 23:15:15,056 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2021-11-20 23:15:15,069 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/b5b278213/3414ebbb87af4dfaac8a16e2be3291d3/FLAGe3570e08e [2021-11-20 23:15:15,299 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/data/b5b278213/3414ebbb87af4dfaac8a16e2be3291d3 [2021-11-20 23:15:15,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 23:15:15,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 23:15:15,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 23:15:15,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 23:15:15,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 23:15:15,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5111fcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15, skipping insertion in model container [2021-11-20 23:15:15,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 23:15:15,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 23:15:15,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-20 23:15:15,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:15:15,712 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 23:15:15,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2021-11-20 23:15:15,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 23:15:15,800 INFO L208 MainTranslator]: Completed translation [2021-11-20 23:15:15,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15 WrapperNode [2021-11-20 23:15:15,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 23:15:15,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 23:15:15,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 23:15:15,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 23:15:15,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,860 INFO L137 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 155 [2021-11-20 23:15:15,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 23:15:15,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 23:15:15,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 23:15:15,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 23:15:15,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 23:15:15,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 23:15:15,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 23:15:15,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 23:15:15,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (1/1) ... [2021-11-20 23:15:15,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 23:15:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 23:15:15,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 23:15:15,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 23:15:16,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-11-20 23:15:16,011 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-11-20 23:15:16,011 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-11-20 23:15:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 23:15:16,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 23:15:16,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 23:15:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 23:15:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 23:15:16,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 23:15:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-11-20 23:15:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-20 23:15:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 23:15:16,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 23:15:16,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 23:15:16,152 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 23:15:16,154 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 23:15:16,830 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 23:15:16,838 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 23:15:16,838 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-20 23:15:16,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:16 BoogieIcfgContainer [2021-11-20 23:15:16,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 23:15:16,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 23:15:16,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 23:15:16,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 23:15:16,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:15:15" (1/3) ... [2021-11-20 23:15:16,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c47cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:16, skipping insertion in model container [2021-11-20 23:15:16,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:15" (2/3) ... [2021-11-20 23:15:16,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c47cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:16, skipping insertion in model container [2021-11-20 23:15:16,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:16" (3/3) ... [2021-11-20 23:15:16,851 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2021-11-20 23:15:16,857 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 23:15:16,857 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 23:15:16,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 23:15:16,934 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 23:15:16,934 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 23:15:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:15:16,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:15:16,959 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:16,960 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:16,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:15:16,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1237252285, now seen corresponding path program 1 times [2021-11-20 23:15:16,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:15:16,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406068533] [2021-11-20 23:15:16,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:16,981 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:15:16,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:15:16,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:15:17,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 23:15:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:17,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-20 23:15:17,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 23:15:17,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 23:15:17,389 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:15:17,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406068533] [2021-11-20 23:15:17,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406068533] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:17,391 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:17,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 23:15:17,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28456313] [2021-11-20 23:15:17,393 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:17,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 23:15:17,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:15:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 23:15:17,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:15:17,435 INFO L87 Difference]: Start difference. First operand has 38 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:15:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:17,465 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2021-11-20 23:15:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 23:15:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2021-11-20 23:15:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:17,476 INFO L225 Difference]: With dead ends: 67 [2021-11-20 23:15:17,477 INFO L226 Difference]: Without dead ends: 30 [2021-11-20 23:15:17,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 23:15:17,483 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:17,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:15:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-20 23:15:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-20 23:15:17,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:15:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2021-11-20 23:15:17,522 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 25 [2021-11-20 23:15:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:17,523 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-11-20 23:15:17,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-20 23:15:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2021-11-20 23:15:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-20 23:15:17,526 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:17,526 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:17,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 23:15:17,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:15:17,740 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:15:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:17,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1104710801, now seen corresponding path program 1 times [2021-11-20 23:15:17,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:15:17,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111886551] [2021-11-20 23:15:17,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:17,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:15:17,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:15:17,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:15:17,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 23:15:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:17,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 23:15:17,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 23:15:18,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-20 23:15:18,124 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:15:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111886551] [2021-11-20 23:15:18,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111886551] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:18,126 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:18,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 23:15:18,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736857175] [2021-11-20 23:15:18,134 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:18,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 23:15:18,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:15:18,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 23:15:18,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:15:18,139 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 23:15:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:18,179 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2021-11-20 23:15:18,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:15:18,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2021-11-20 23:15:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:18,189 INFO L225 Difference]: With dead ends: 56 [2021-11-20 23:15:18,189 INFO L226 Difference]: Without dead ends: 35 [2021-11-20 23:15:18,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 23:15:18,192 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:18,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:15:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-11-20 23:15:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2021-11-20 23:15:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:15:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2021-11-20 23:15:18,208 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2021-11-20 23:15:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:18,209 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2021-11-20 23:15:18,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-11-20 23:15:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2021-11-20 23:15:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-20 23:15:18,213 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:18,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:18,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-20 23:15:18,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:15:18,428 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:15:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash -313226979, now seen corresponding path program 1 times [2021-11-20 23:15:18,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:15:18,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951427765] [2021-11-20 23:15:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:18,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:15:18,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:15:18,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:15:18,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 23:15:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 23:15:18,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 23:15:18,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:15:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-20 23:15:19,304 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-20 23:15:19,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951427765] [2021-11-20 23:15:19,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951427765] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 23:15:19,305 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 23:15:19,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 23:15:19,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155502795] [2021-11-20 23:15:19,305 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 23:15:19,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 23:15:19,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-20 23:15:19,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 23:15:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 23:15:19,308 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:15:19,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 23:15:19,385 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2021-11-20 23:15:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 23:15:19,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2021-11-20 23:15:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 23:15:19,387 INFO L225 Difference]: With dead ends: 43 [2021-11-20 23:15:19,388 INFO L226 Difference]: Without dead ends: 32 [2021-11-20 23:15:19,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 23:15:19,389 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 23:15:19,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 23:15:19,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-20 23:15:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-11-20 23:15:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 23:15:19,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2021-11-20 23:15:19,404 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 35 [2021-11-20 23:15:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 23:15:19,406 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2021-11-20 23:15:19,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 23:15:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2021-11-20 23:15:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 23:15:19,410 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 23:15:19,410 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 23:15:19,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-20 23:15:19,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-20 23:15:19,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 23:15:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 23:15:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 415590512, now seen corresponding path program 1 times [2021-11-20 23:15:19,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-20 23:15:19,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93323786] [2021-11-20 23:15:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 23:15:19,630 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 23:15:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-20 23:15:19,631 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 23:15:19,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_71c38065-e03b-46e6-b59d-98212e71db2f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 23:15:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 23:15:19,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 80 conjunts are in the unsatisfiable core [2021-11-20 23:15:19,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 23:15:19,956 INFO L388 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 [2021-11-20 23:15:20,018 INFO L388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-11-20 23:15:20,231 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-11-20 23:15:20,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-11-20 23:15:20,567 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 23:15:20,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2021-11-20 23:15:20,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2021-11-20 23:15:20,914 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-11-20 23:15:20,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 63 [2021-11-20 23:15:21,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-11-20 23:15:21,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 23:15:21,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 46 [2021-11-20 23:15:21,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2021-11-20 23:15:22,670 INFO L354 Elim1Store]: treesize reduction 122, result has 16.4 percent of original size [2021-11-20 23:15:22,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 194 treesize of output 130 [2021-11-20 23:15:22,746 INFO L354 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-11-20 23:15:22,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 169 treesize of output 144 [2021-11-20 23:15:22,822 INFO L354 Elim1Store]: treesize reduction 92, result has 20.0 percent of original size [2021-11-20 23:15:22,822 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 121 [2021-11-20 23:15:27,842 INFO L354 Elim1Store]: treesize reduction 93, result has 4.1 percent of original size [2021-11-20 23:15:27,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 234 treesize of output 145 [2021-11-20 23:15:27,877 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:15:27,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 117 [2021-11-20 23:15:27,900 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 23:15:27,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 32 [2021-11-20 23:15:27,913 INFO L388 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 15 treesize of output 11 [2021-11-20 23:15:31,291 INFO L354 Elim1Store]: treesize reduction 223, result has 11.2 percent of original size [2021-11-20 23:15:31,292 INFO L388 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 3 case distinctions, treesize of input 305 treesize of output 312 [2021-11-20 23:15:31,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:31,955 INFO L354 Elim1Store]: treesize reduction 757, result has 6.7 percent of original size [2021-11-20 23:15:31,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 284 treesize of output 217 [2021-11-20 23:15:32,061 INFO L354 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2021-11-20 23:15:32,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 273 treesize of output 277 [2021-11-20 23:15:32,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 23:15:32,279 INFO L354 Elim1Store]: treesize reduction 603, result has 7.7 percent of original size [2021-11-20 23:15:32,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 204 treesize of output 197 [2021-11-20 23:16:09,475 WARN L227 SmtUtils]: Spent 27.44s on a formula simplification. DAG size of input: 326 DAG size of output: 61 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 23:16:09,477 INFO L354 Elim1Store]: treesize reduction 1682, result has 5.9 percent of original size [2021-11-20 23:16:09,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 39 case distinctions, treesize of input 645 treesize of output 379 [2021-11-20 23:16:13,882 INFO L354 Elim1Store]: treesize reduction 1352, result has 6.4 percent of original size [2021-11-20 23:16:13,883 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 18 case distinctions, treesize of input 800 treesize of output 572 [2021-11-20 23:16:14,160 INFO L354 Elim1Store]: treesize reduction 797, result has 8.1 percent of original size [2021-11-20 23:16:14,160 INFO L388 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 3 case distinctions, treesize of input 899 treesize of output 806 [2021-11-20 23:16:14,230 INFO L354 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2021-11-20 23:16:14,230 INFO L388 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 1 case distinctions, treesize of input 745 treesize of output 639 [2021-11-20 23:16:21,700 INFO L354 Elim1Store]: treesize reduction 319, result has 3.0 percent of original size [2021-11-20 23:16:21,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 489 treesize of output 269 [2021-11-20 23:16:21,814 INFO L354 Elim1Store]: treesize reduction 230, result has 6.1 percent of original size [2021-11-20 23:16:21,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 217 treesize of output 99 [2021-11-20 23:16:22,155 INFO L388 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 15 treesize of output 7 [2021-11-20 23:16:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-20 23:16:22,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 23:16:24,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse3 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_DerPreprocessor_9)))) (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 v_DerPreprocessor_6))) (select (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse1 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-11-20 23:16:27,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_DerPreprocessor_9)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse8 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse4 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2021-11-20 23:16:29,264 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)))) (store .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2021-11-20 23:17:03,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_node_create_#res#1.base| (store (store (select .cse3 |c_node_create_#res#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_node_create_#res#1.base|)))) (store .cse8 |c_node_create_#res#1.base| (store (store (select .cse8 |c_node_create_#res#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_node_create_#res#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_node_create_#res#1.base| (store (store (select .cse11 |c_node_create_#res#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse20 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse21 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_12)))) (let ((.cse28 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_13))) (.cse18 (select (select .cse24 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse25 (select .cse24 .cse18)) (.cse19 (select (select .cse28 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse25 .cse19)) (.cse14 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse12 (let ((.cse15 (let ((.cse17 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse20 v_DerPreprocessor_10) .cse21 |v_node_create_~data#1_26|)))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_DerPreprocessor_9))))) (store .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_6))) (select (select (let ((.cse22 (let ((.cse23 (store .cse24 .cse18 (store .cse25 .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse18) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse13))))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse26 (let ((.cse27 (store .cse28 .cse18 (store (select .cse28 .cse18) .cse19 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse19) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse26 .cse13 (store (select .cse26 .cse13) .cse14 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:17:05,149 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_7 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse5)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse9 .cse6)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| .cse5 (store (select |c_#memory_int| .cse5) .cse6 v_DerPreprocessor_9)))) (store .cse3 |c_node_create_#res#1.base| (store (store (select .cse3 |c_node_create_#res#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 (store .cse9 .cse6 |c_node_create_#res#1.base|)))) (store .cse8 |c_node_create_#res#1.base| (store (store (select .cse8 |c_node_create_#res#1.base|) .cse4 .cse5) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |c_node_create_#res#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse5 (store (select |c_#memory_$Pointer$.offset| .cse5) .cse6 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse11 |c_node_create_#res#1.base| (store (store (select .cse11 |c_node_create_#res#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|) (exists ((v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse20 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse21 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse24 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_12)))) (let ((.cse28 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse20 (_ bv0 32)) .cse21 v_DerPreprocessor_13))) (.cse18 (select (select .cse24 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse25 (select .cse24 .cse18)) (.cse19 (select (select .cse28 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse25 .cse19)) (.cse14 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse16 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse12 (let ((.cse15 (let ((.cse17 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse20 v_DerPreprocessor_10) .cse21 |v_node_create_~data#1_26|)))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_DerPreprocessor_9))))) (store .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse15 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse12 .cse13 (store (select .cse12 .cse13) .cse14 v_DerPreprocessor_6))) (select (select (let ((.cse22 (let ((.cse23 (store .cse24 .cse18 (store .cse25 .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse23 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse18) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse13))))) (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse26 (let ((.cse27 (store .cse28 .cse18 (store (select .cse28 .cse18) .cse19 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse27 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse16 .cse19) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse26 .cse13 (store (select .cse26 .cse13) .cse14 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from true [2021-11-20 23:18:08,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |c_node_create_~temp~0#1.base| (store (store (select .cse3 |c_node_create_~temp~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |c_node_create_~temp~0#1.base|)))) (store .cse11 |c_node_create_~temp~0#1.base| (store (store (select .cse11 |c_node_create_~temp~0#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |c_node_create_~temp~0#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_~temp~0#1.base| (store (store (select .cse15 |c_node_create_~temp~0#1.base|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from false [2021-11-20 23:18:10,701 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |c_node_create_~temp~0#1.base| (store (store (store (select |c_#memory_int| |c_node_create_~temp~0#1.base|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |c_node_create_~temp~0#1.base| (store (store (select .cse3 |c_node_create_~temp~0#1.base|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |c_node_create_~temp~0#1.base|)))) (store .cse11 |c_node_create_~temp~0#1.base| (store (store (select .cse11 |c_node_create_~temp~0#1.base|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |c_node_create_~temp~0#1.base|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |c_node_create_~temp~0#1.base| (store (store (select .cse15 |c_node_create_~temp~0#1.base|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) is different from true [2021-11-20 23:20:13,425 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_29| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_29|)))) (forall ((|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~data#1| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4| (_ BitVec 32)) (|node_create_~temp~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_9 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_DerPreprocessor_7 (_ BitVec 32)) (v_DerPreprocessor_6 (_ BitVec 32)) (|ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12| (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_15 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2| (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4| (let ((.cse8 (bvadd (_ bv4 32) |node_create_~temp~0#1.offset|)) (.cse9 (bvadd |node_create_~temp~0#1.offset| (_ bv8 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_17)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| (_ bv0 32)) .cse8 (_ bv0 32)) .cse9 v_DerPreprocessor_15))) (.cse6 (select (select .cse12 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse13 (select .cse12 .cse6)) (.cse7 (select (select .cse16 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse1 (select .cse13 .cse7)) (.cse2 (bvadd (_ bv4 32) |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|)) (.cse4 (bvadd (_ bv4 32) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse3 (let ((.cse5 (store |c_#memory_int| |v_node_create_~temp~0#1.base_29| (store (store (store (select |c_#memory_int| |v_node_create_~temp~0#1.base_29|) |node_create_~temp~0#1.offset| v_DerPreprocessor_16) .cse8 v_DerPreprocessor_14) .cse9 |node_create_~data#1|)))) (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_DerPreprocessor_9))))) (store .cse3 |v_node_create_~temp~0#1.base_29| (store (store (select .cse3 |v_node_create_~temp~0#1.base_29|) .cse4 v_DerPreprocessor_8) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_7))))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_DerPreprocessor_6))) (select (select (let ((.cse10 (let ((.cse11 (store .cse12 .cse6 (store .cse13 .cse7 |v_node_create_~temp~0#1.base_29|)))) (store .cse11 |v_node_create_~temp~0#1.base_29| (store (store (select .cse11 |v_node_create_~temp~0#1.base_29|) .cse4 .cse6) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| .cse1))))) (store .cse10 .cse1 (store (select .cse10 .cse1) .cse2 |v_node_create_~temp~0#1.base_29|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse14 (let ((.cse15 (store .cse16 .cse6 (store (select .cse16 .cse6) .cse7 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (store .cse15 |v_node_create_~temp~0#1.base_29| (store (store (select .cse15 |v_node_create_~temp~0#1.base_29|) .cse4 .cse7) |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_12|))))) (store .cse14 .cse1 (store (select .cse14 .cse1) .cse2 |ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|))))))))) (exists ((v_prenex_6 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_node_create_~data#1_26| (_ BitVec 32)) (|v_node_create_~temp~0#1.offset_28| (_ BitVec 32)) (v_DerPreprocessor_13 (_ BitVec 32)) (v_DerPreprocessor_11 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32))) (and (not (= (let ((.cse25 (bvadd (_ bv4 32) |v_node_create_~temp~0#1.offset_28|)) (.cse26 (bvadd (_ bv8 32) |v_node_create_~temp~0#1.offset_28|))) (let ((.cse29 (store |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_12)))) (let ((.cse33 (store |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| (_ bv0 32)) .cse25 (_ bv0 32)) .cse26 v_DerPreprocessor_13))) (.cse23 (select (select .cse29 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse30 (select .cse29 .cse23)) (.cse24 (select (select .cse33 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_dll_circular_insert_~head#1.offset_BEFORE_CALL_2|))) (let ((.cse18 (select .cse30 .cse24)) (.cse19 (bvadd (_ bv4 32) v_prenex_6)) (.cse21 (bvadd (_ bv4 32) v_prenex_5))) (select (select (let ((.cse17 (let ((.cse20 (let ((.cse22 (store |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (store (select |c_old(#memory_int)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) |v_node_create_~temp~0#1.offset_28| v_DerPreprocessor_11) .cse25 v_DerPreprocessor_10) .cse26 |v_node_create_~data#1_26|)))) (store .cse22 .cse23 (store (select .cse22 .cse23) .cse24 v_prenex_1))))) (store .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 v_prenex_2) v_prenex_5 v_prenex_3))))) (store .cse17 .cse18 (store (select .cse17 .cse18) .cse19 v_prenex_4))) (select (select (let ((.cse27 (let ((.cse28 (store .cse29 .cse23 (store .cse30 .cse24 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))) (store .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse28 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse23) v_prenex_5 .cse18))))) (store .cse27 .cse18 (store (select .cse27 .cse18) .cse19 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)) (bvadd (_ bv8 32) (select (select (let ((.cse31 (let ((.cse32 (store .cse33 .cse23 (store (select .cse33 .cse23) .cse24 v_prenex_5)))) (store .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| (store (store (select .cse32 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|) .cse21 .cse24) v_prenex_5 v_prenex_6))))) (store .cse31 .cse18 (store (select .cse31 .cse18) .cse19 v_prenex_5))) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_4|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_4|)))))))) |v_ULTIMATE.start_main_~data~0#1_BEFORE_CALL_4|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |c_old(#valid)| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18|)))))) (bvult |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_18| |c_#StackHeapBarrier|))))) (not (bvult |v_node_create_~temp~0#1.base_29| |c_#StackHeapBarrier|)))) is different from true [2021-11-20 23:20:29,529 INFO L388 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 2053627857421 treesize of output 2052515053445