./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91 --witnessprinter.witness.filename witness --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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:09:31,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:09:31,426 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:09:31,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:09:31,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:09:31,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:09:31,468 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:09:31,469 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:09:31,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:09:31,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:09:31,474 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:09:31,475 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:09:31,477 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:09:31,479 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:09:31,480 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:09:31,481 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:09:31,482 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:09:31,483 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:09:31,487 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:09:31,488 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:09:31,488 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:09:31,489 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:09:31,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:09:31,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:09:31,491 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:09:31,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:09:31,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:09:31,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:09:31,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:09:31,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:09:31,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:09:31,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:09:31,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:09:31,496 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:09:31,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:09:31,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:09:31,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:09:31,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:09:31,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:09:31,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:09:31,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:09:31,499 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:09:31,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:09:31,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:09:31,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:09:31,500 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:09:31,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:09:31,501 INFO L153 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_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/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_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-11-25 00:09:31,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:09:31,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:09:31,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:09:31,870 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:09:31,871 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:09:31,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-11-25 00:09:35,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:09:35,412 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:09:35,413 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-11-25 00:09:35,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/data/de687e8b8/1f127ab6a844400baa497f61af5427d4/FLAG9b4bb123e [2023-11-25 00:09:35,447 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/data/de687e8b8/1f127ab6a844400baa497f61af5427d4 [2023-11-25 00:09:35,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:09:35,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:09:35,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:09:35,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:09:35,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:09:35,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:09:35" (1/1) ... [2023-11-25 00:09:35,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bac9725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:35, skipping insertion in model container [2023-11-25 00:09:35,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:09:35" (1/1) ... [2023-11-25 00:09:35,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:09:35,992 WARN L240 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_61d63e16-c3cb-4e60-84f2-0a072b648537/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-11-25 00:09:36,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:09:36,076 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:09:36,127 WARN L240 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_61d63e16-c3cb-4e60-84f2-0a072b648537/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-11-25 00:09:36,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:09:36,211 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:09:36,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36 WrapperNode [2023-11-25 00:09:36,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:09:36,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:09:36,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:09:36,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:09:36,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,267 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2023-11-25 00:09:36,268 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:09:36,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:09:36,269 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:09:36,269 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:09:36,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,323 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:09:36,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:09:36,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:09:36,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:09:36,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (1/1) ... [2023-11-25 00:09:36,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:09:36,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:36,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:09:36,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-11-25 00:09:36,438 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-11-25 00:09:36,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:09:36,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-25 00:09:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-11-25 00:09:36,441 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-11-25 00:09:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:09:36,441 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-11-25 00:09:36,442 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-11-25 00:09:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:09:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:09:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:09:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:09:36,442 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-11-25 00:09:36,443 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-11-25 00:09:36,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:09:36,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:09:36,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:09:36,640 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:09:36,642 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:09:37,105 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:09:37,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:09:37,186 INFO L309 CfgBuilder]: Removed 41 assume(true) statements. [2023-11-25 00:09:37,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:09:37 BoogieIcfgContainer [2023-11-25 00:09:37,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:09:37,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:09:37,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:09:37,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:09:37,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:09:35" (1/3) ... [2023-11-25 00:09:37,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe414d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:09:37, skipping insertion in model container [2023-11-25 00:09:37,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:09:36" (2/3) ... [2023-11-25 00:09:37,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe414d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:09:37, skipping insertion in model container [2023-11-25 00:09:37,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:09:37" (3/3) ... [2023-11-25 00:09:37,199 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-11-25 00:09:37,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:09:37,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:09:37,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:09:37,283 INFO L357 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=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@612b2a3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:09:37,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:09:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-25 00:09:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:09:37,297 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:37,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:37,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:37,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash -754496073, now seen corresponding path program 1 times [2023-11-25 00:09:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:37,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465634028] [2023-11-25 00:09:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:37,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:37,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465634028] [2023-11-25 00:09:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465634028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:09:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53360205] [2023-11-25 00:09:37,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-25 00:09:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-25 00:09:37,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:09:37,540 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 95 states have internal predecessors, (140), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:09:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:37,686 INFO L93 Difference]: Finished difference Result 206 states and 369 transitions. [2023-11-25 00:09:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-25 00:09:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-25 00:09:37,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:37,699 INFO L225 Difference]: With dead ends: 206 [2023-11-25 00:09:37,700 INFO L226 Difference]: Without dead ends: 97 [2023-11-25 00:09:37,709 INFO L412 NwaCegarLoop]: 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 [2023-11-25 00:09:37,716 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:37,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:09:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-25 00:09:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-25 00:09:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 87 states have internal predecessors, (92), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:09:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2023-11-25 00:09:37,795 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 8 [2023-11-25 00:09:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:37,796 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2023-11-25 00:09:37,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:09:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2023-11-25 00:09:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-25 00:09:37,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:37,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:37,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:09:37,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:37,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:37,800 INFO L85 PathProgramCache]: Analyzing trace with hash -896617474, now seen corresponding path program 1 times [2023-11-25 00:09:37,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:37,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187704468] [2023-11-25 00:09:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:38,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187704468] [2023-11-25 00:09:38,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187704468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:38,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:09:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401166976] [2023-11-25 00:09:38,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:09:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:09:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:09:38,130 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:38,374 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2023-11-25 00:09:38,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:09:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-25 00:09:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:38,377 INFO L225 Difference]: With dead ends: 99 [2023-11-25 00:09:38,377 INFO L226 Difference]: Without dead ends: 96 [2023-11-25 00:09:38,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:09:38,380 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 168 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:38,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:09:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-25 00:09:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-25 00:09:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-25 00:09:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-11-25 00:09:38,398 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 15 [2023-11-25 00:09:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:38,399 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-11-25 00:09:38,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-11-25 00:09:38,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:09:38,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:38,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:38,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:09:38,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:38,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1010502954, now seen corresponding path program 1 times [2023-11-25 00:09:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500377907] [2023-11-25 00:09:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:38,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500377907] [2023-11-25 00:09:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500377907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:09:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274819649] [2023-11-25 00:09:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:38,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-25 00:09:38,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-25 00:09:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:09:38,994 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:39,849 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2023-11-25 00:09:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-25 00:09:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-25 00:09:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:39,856 INFO L225 Difference]: With dead ends: 183 [2023-11-25 00:09:39,856 INFO L226 Difference]: Without dead ends: 177 [2023-11-25 00:09:39,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-11-25 00:09:39,862 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 342 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:39,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 438 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-25 00:09:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-11-25 00:09:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2023-11-25 00:09:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 145 states have internal predecessors, (166), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-25 00:09:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 196 transitions. [2023-11-25 00:09:39,898 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 196 transitions. Word has length 18 [2023-11-25 00:09:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:39,898 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 196 transitions. [2023-11-25 00:09:39,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 196 transitions. [2023-11-25 00:09:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:09:39,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:39,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:39,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:09:39,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:39,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash -734298133, now seen corresponding path program 1 times [2023-11-25 00:09:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:39,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199622633] [2023-11-25 00:09:39,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:39,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:40,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:40,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199622633] [2023-11-25 00:09:40,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199622633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:40,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:40,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:09:40,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56217521] [2023-11-25 00:09:40,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:40,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:09:40,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:40,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:09:40,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:09:40,913 INFO L87 Difference]: Start difference. First operand 159 states and 196 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:42,079 INFO L93 Difference]: Finished difference Result 253 states and 308 transitions. [2023-11-25 00:09:42,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:09:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-11-25 00:09:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:42,082 INFO L225 Difference]: With dead ends: 253 [2023-11-25 00:09:42,082 INFO L226 Difference]: Without dead ends: 250 [2023-11-25 00:09:42,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-11-25 00:09:42,084 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 296 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:42,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 147 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-25 00:09:42,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-25 00:09:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2023-11-25 00:09:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2613065326633166) internal successors, (251), 214 states have internal predecessors, (251), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:09:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2023-11-25 00:09:42,138 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 21 [2023-11-25 00:09:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:42,139 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2023-11-25 00:09:42,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2023-11-25 00:09:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-25 00:09:42,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:42,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:42,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:09:42,141 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:42,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:42,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1459497818, now seen corresponding path program 1 times [2023-11-25 00:09:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36393076] [2023-11-25 00:09:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:42,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:42,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36393076] [2023-11-25 00:09:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36393076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:42,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-25 00:09:42,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443393483] [2023-11-25 00:09:42,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:42,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-25 00:09:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-25 00:09:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:09:42,877 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:43,991 INFO L93 Difference]: Finished difference Result 252 states and 306 transitions. [2023-11-25 00:09:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:09:43,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-11-25 00:09:43,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:43,993 INFO L225 Difference]: With dead ends: 252 [2023-11-25 00:09:43,993 INFO L226 Difference]: Without dead ends: 249 [2023-11-25 00:09:43,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-25 00:09:43,995 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 335 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:43,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 147 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-25 00:09:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-11-25 00:09:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 234. [2023-11-25 00:09:44,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.256281407035176) internal successors, (250), 214 states have internal predecessors, (250), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:09:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 289 transitions. [2023-11-25 00:09:44,066 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 289 transitions. Word has length 24 [2023-11-25 00:09:44,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:44,067 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 289 transitions. [2023-11-25 00:09:44,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 289 transitions. [2023-11-25 00:09:44,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-25 00:09:44,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:44,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:09:44,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:44,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2112541078, now seen corresponding path program 1 times [2023-11-25 00:09:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:44,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044987656] [2023-11-25 00:09:44,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:44,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:09:45,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044987656] [2023-11-25 00:09:45,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044987656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:09:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:09:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-25 00:09:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546041769] [2023-11-25 00:09:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:09:45,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-25 00:09:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:09:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-25 00:09:45,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:09:45,366 INFO L87 Difference]: Start difference. First operand 234 states and 289 transitions. Second operand has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:09:47,047 INFO L93 Difference]: Finished difference Result 251 states and 304 transitions. [2023-11-25 00:09:47,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:09:47,048 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-11-25 00:09:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:09:47,050 INFO L225 Difference]: With dead ends: 251 [2023-11-25 00:09:47,051 INFO L226 Difference]: Without dead ends: 248 [2023-11-25 00:09:47,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2023-11-25 00:09:47,052 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 335 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:09:47,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 175 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-25 00:09:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-25 00:09:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 234. [2023-11-25 00:09:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 214 states have internal predecessors, (249), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-25 00:09:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 288 transitions. [2023-11-25 00:09:47,101 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 288 transitions. Word has length 27 [2023-11-25 00:09:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:09:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 288 transitions. [2023-11-25 00:09:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 10 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-25 00:09:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 288 transitions. [2023-11-25 00:09:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-25 00:09:47,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:09:47,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:09:47,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:09:47,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:09:47,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:09:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash -849953334, now seen corresponding path program 1 times [2023-11-25 00:09:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:09:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605693959] [2023-11-25 00:09:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:09:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:09:48,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:09:48,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605693959] [2023-11-25 00:09:48,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605693959] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:09:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885463595] [2023-11-25 00:09:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:09:48,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:09:48,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:09:48,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:09:48,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61d63e16-c3cb-4e60-84f2-0a072b648537/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:09:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:09:48,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-25 00:09:48,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:09:48,631 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:09:48,632 INFO L378 Elim1Store]: Elim1 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 16 treesize of output 15 [2023-11-25 00:09:48,667 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:09:48,668 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 16 [2023-11-25 00:09:48,679 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-25 00:09:49,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 90 [2023-11-25 00:09:49,138 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2023-11-25 00:09:49,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:49,296 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-25 00:09:49,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2023-11-25 00:09:49,434 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:09:49,434 INFO L378 Elim1Store]: Elim1 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 28 treesize of output 23 [2023-11-25 00:09:49,458 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-25 00:09:49,459 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 11 [2023-11-25 00:09:49,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-11-25 00:09:49,656 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-25 00:09:49,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2023-11-25 00:09:49,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-11-25 00:09:49,758 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-25 00:09:49,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2023-11-25 00:09:49,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 125 [2023-11-25 00:09:49,853 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:49,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 118 [2023-11-25 00:09:49,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:49,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2023-11-25 00:09:49,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:49,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 68 [2023-11-25 00:09:50,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:50,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 68 [2023-11-25 00:09:50,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-11-25 00:09:50,159 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-25 00:09:50,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2023-11-25 00:09:50,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-11-25 00:09:50,266 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2023-11-25 00:09:50,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 103 [2023-11-25 00:09:50,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 113 [2023-11-25 00:09:50,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 92 [2023-11-25 00:09:50,385 INFO L349 Elim1Store]: treesize reduction 42, result has 17.6 percent of original size [2023-11-25 00:09:50,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 211 [2023-11-25 00:09:50,396 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 112 [2023-11-25 00:09:50,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 115 [2023-11-25 00:09:50,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2023-11-25 00:09:50,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 127 [2023-11-25 00:09:50,590 INFO L378 Elim1Store]: Elim1 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 46 treesize of output 1 [2023-11-25 00:09:52,695 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse5 (select (select |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (let ((.cse13 (= |c_list_add_#in~head#1.base| |c_list_add_#in~new#1.base|)) (.cse17 (select |c_#memory_$Pointer$.base| |c_list_add_#in~new#1.base|)) (.cse6 (select |c_old(#memory_$Pointer$.base)| .cse5))) (let ((.cse0 (= |c_list_add_#in~head#1.base| .cse5)) (.cse28 (= |c_list_add_#in~new#1.base| .cse5)) (.cse10 (+ (- 4) |c_list_add_#in~head#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse11 (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))) (.cse22 (select |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base|)) (.cse15 (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~new#1.base| .cse17)) (.cse4 (+ |c_list_add_#in~new#1.offset| 4)) (.cse21 (not .cse13))) (or (and .cse0 (or (and (or (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_14) .cse5 v_DerPreprocessor_15)) (.cse3 (select v_DerPreprocessor_15 |c_list_add_#in~head#1.offset|))) (and (= .cse1 (store (select (store .cse2 |c_list_add_#in~new#1.base| (store (store (select .cse2 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse3) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse2 |c_list_add_#in~head#1.base|) v_DerPreprocessor_14) (exists ((v_ArrVal_375 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse3 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|))))) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse8 (select v_DerPreprocessor_13 |c_list_add_#in~head#1.offset|)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse5 v_DerPreprocessor_13))) (and (= .cse1 (store (select (store .cse7 |c_list_add_#in~new#1.base| (store (store (select .cse7 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse8) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse8 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)))) (= (select .cse7 |c_list_add_#in~head#1.base|) v_DerPreprocessor_12)))) (and (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_12) .cse5 v_DerPreprocessor_13))) (and (= .cse1 (store (select (store .cse9 |c_list_add_#in~new#1.base| (store (store (select .cse9 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse9 |c_list_add_#in~head#1.base|) v_DerPreprocessor_12)))) .cse11) (and (exists ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_14) .cse5 v_DerPreprocessor_15))) (and (= .cse1 (store (select (store .cse12 |c_list_add_#in~new#1.base| (store (store (select .cse12 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse12 |c_list_add_#in~head#1.base|) v_DerPreprocessor_14)))) .cse11)) .cse13) (and (or (exists ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse16 (+ (select v_arrayElimArr_14 |c_list_add_#in~new#1.offset|) 4))) (and (= (select v_arrayElimArr_14 .cse4) |c_list_add_#in~head#1.offset|) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_16) |c_list_add_#in~head#1.base| v_DerPreprocessor_17) |c_list_add_#in~new#1.base| v_arrayElimArr_14))) (and (= .cse1 (store (select .cse14 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (select .cse14 .cse5) v_DerPreprocessor_16)))) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse16 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= |c_list_add_#in~head#1.offset| .cse16)))) (exists ((v_arrayElimArr_14 (Array Int Int))) (let ((.cse18 (select v_arrayElimArr_14 |c_list_add_#in~new#1.offset|))) (and (= (select v_arrayElimArr_14 .cse4) |c_list_add_#in~head#1.offset|) (exists ((v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_16) |c_list_add_#in~head#1.base| v_DerPreprocessor_17) |c_list_add_#in~new#1.base| v_arrayElimArr_14))) (let ((.cse19 (select .cse20 .cse5))) (and (= .cse18 (select .cse19 |c_list_add_#in~head#1.offset|)) (= .cse1 (store (select .cse20 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= .cse19 v_DerPreprocessor_16))))) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse18 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) .cse21))) (and (let ((.cse25 (store |c_old(#memory_$Pointer$.base)| .cse5 (select |c_#memory_$Pointer$.base| .cse5)))) (or (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_19 (Array Int Int)) (v_ArrVal_375 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_19) .cse5 v_DerPreprocessor_20))) (let ((.cse24 (select (select .cse23 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (= .cse22 (store (select (store .cse23 |c_list_add_#in~new#1.base| (store (store (select .cse23 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse24) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (= (store .cse25 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse24 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|))))) .cse13) (and (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (v_DerPreprocessor_23 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~new#1.base| v_DerPreprocessor_21) |c_list_add_#in~head#1.base| v_DerPreprocessor_22) .cse5 v_DerPreprocessor_23))) (let ((.cse26 (select (select .cse27 |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset|))) (and (= |c_#memory_$Pointer$.base| (store (store .cse25 |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ 4 .cse26) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse22 (store (select (store (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_22) .cse5 v_DerPreprocessor_23) |c_list_add_#in~new#1.base| (store (store (select .cse27 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse26) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)))))) .cse21))) (not .cse28) (not .cse0)) (and .cse28 (or (and (or (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5))) (and (= v_DerPreprocessor_4 (select .cse29 |c_list_add_#in~head#1.base|)) (= .cse1 (store (select (store .cse29 |c_list_add_#in~new#1.base| (store (store (select .cse29 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|))))) .cse11) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7)) (.cse31 (select v_DerPreprocessor_7 |c_list_add_#in~head#1.offset|))) (and (= (select .cse30 |c_list_add_#in~head#1.base|) v_DerPreprocessor_6) (exists ((v_ArrVal_375 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse31 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|)) |c_#memory_$Pointer$.base|)) (= .cse1 (store (select (store .cse30 |c_list_add_#in~new#1.base| (store (store (select .cse30 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse31) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|))))) (exists ((v_DerPreprocessor_5 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_4) .cse5 v_DerPreprocessor_5)) (.cse33 (select v_DerPreprocessor_5 |c_list_add_#in~head#1.offset|))) (and (= v_DerPreprocessor_4 (select .cse32 |c_list_add_#in~head#1.base|)) (= .cse1 (store (select (store .cse32 |c_list_add_#in~new#1.base| (store (store (select .cse32 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse33) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|)) (exists ((v_ArrVal_375 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse33 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| v_ArrVal_375) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))))))) (and (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_$Pointer$.offset| |c_list_add_#in~head#1.base| v_DerPreprocessor_6) .cse5 v_DerPreprocessor_7))) (and (= (store (select (store .cse34 |c_list_add_#in~new#1.base| (store (store (select .cse34 |c_list_add_#in~new#1.base|) |c_list_add_#in~new#1.offset| .cse10) .cse4 |c_list_add_#in~head#1.offset|)) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse1) (= (select .cse34 |c_list_add_#in~head#1.base|) v_DerPreprocessor_6)))) .cse11)) .cse13) (and (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse36 (select .cse39 |c_list_add_#in~head#1.base|))) (let ((.cse38 (select .cse36 |c_list_add_#in~head#1.offset|))) (let ((.cse35 (+ .cse38 4)) (.cse37 (select .cse39 .cse5))) (and (not (= |c_list_add_#in~new#1.offset| .cse35)) (= (store .cse36 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse35 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse37 v_DerPreprocessor_8) (= |c_list_add_#in~head#1.offset| (select .cse37 .cse4)) (= (select .cse37 |c_list_add_#in~new#1.offset|) .cse38) (not (= |c_list_add_#in~new#1.offset| .cse38)))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse40 (select .cse44 |c_list_add_#in~head#1.base|))) (let ((.cse43 (select .cse40 |c_list_add_#in~head#1.offset|))) (let ((.cse42 (select .cse44 .cse5)) (.cse41 (+ .cse43 4))) (and (= (store .cse40 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 .cse41 |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse42 v_DerPreprocessor_8) (= |c_list_add_#in~head#1.offset| (select .cse42 .cse4)) (= (select .cse42 |c_list_add_#in~new#1.offset|) .cse43) (= |c_list_add_#in~new#1.offset| .cse41))))))) (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_DerPreprocessor_8) |c_list_add_#in~head#1.base| v_DerPreprocessor_9) |c_list_add_#in~new#1.base| v_DerPreprocessor_10))) (let ((.cse45 (select .cse48 |c_list_add_#in~head#1.base|))) (let ((.cse47 (select .cse48 .cse5)) (.cse46 (select .cse45 |c_list_add_#in~head#1.offset|))) (and (= (store .cse45 |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.offset|) .cse22) (= |c_#memory_$Pointer$.base| (store .cse15 |c_list_add_#in~head#1.base| (store (select (store (store |c_old(#memory_$Pointer$.base)| .cse5 (store .cse6 (+ .cse46 4) |c_list_add_#in~new#1.base|)) |c_list_add_#in~new#1.base| .cse17) |c_list_add_#in~head#1.base|) |c_list_add_#in~head#1.offset| |c_list_add_#in~new#1.base|))) (= .cse47 v_DerPreprocessor_8) (= |c_list_add_#in~new#1.offset| .cse46) (= |c_list_add_#in~head#1.offset| (select .cse47 .cse4)) (= (select .cse47 |c_list_add_#in~new#1.offset|) .cse46))))))) .cse21))))))) (= |c_~#gl_list~0.offset| 0) (= 3 |c_~#gl_list~0.base|)) is different from false [2023-11-25 00:09:53,227 INFO L349 Elim1Store]: treesize reduction 308, result has 4.6 percent of original size [2023-11-25 00:09:53,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 680 treesize of output 1127 [2023-11-25 00:09:53,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:53,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:53,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:53,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:53,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:53,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:53,648 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:53,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:53,780 INFO L349 Elim1Store]: treesize reduction 5093, result has 0.0 percent of original size [2023-11-25 00:09:53,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 19 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 23 new quantified variables, introduced 60 case distinctions, treesize of input 4419 treesize of output 11418 [2023-11-25 00:09:55,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 8759 treesize of output 8100 [2023-11-25 00:09:55,962 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:09:56,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:56,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:09:56,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:56,066 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:56,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:09:56,101 INFO L349 Elim1Store]: treesize reduction 245, result has 0.4 percent of original size [2023-11-25 00:09:56,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 1081 treesize of output 1064 [2023-11-25 00:09:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2055 treesize of output 1666 [2023-11-25 00:10:00,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:00,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1235 treesize of output 1218 [2023-11-25 00:10:01,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:01,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1043 treesize of output 1128 [2023-11-25 00:10:04,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:05,248 INFO L349 Elim1Store]: treesize reduction 526, result has 4.9 percent of original size [2023-11-25 00:10:05,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5262 treesize of output 4942 [2023-11-25 00:10:07,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:08,204 INFO L349 Elim1Store]: treesize reduction 526, result has 4.9 percent of original size [2023-11-25 00:10:08,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5330 treesize of output 4990 [2023-11-25 00:10:09,014 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:10:11,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:10:12,434 INFO L349 Elim1Store]: treesize reduction 510, result has 7.8 percent of original size [2023-11-25 00:10:12,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 5310 treesize of output 5006 [2023-11-25 00:10:17,431 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:10:17,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2229 treesize of output 1810