./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/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_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/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_ea55eb07-50ca-4116-9d06-6af610a24a16/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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:02:59,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:02:59,185 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:02:59,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:02:59,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:02:59,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:02:59,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:02:59,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:02:59,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:02:59,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:02:59,231 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:02:59,231 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:02:59,232 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:02:59,233 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:02:59,234 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:02:59,234 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:02:59,235 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:02:59,236 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:02:59,236 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:02:59,237 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:02:59,238 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:02:59,239 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:02:59,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:02:59,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:02:59,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:02:59,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:02:59,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:02:59,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:02:59,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:02:59,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:02:59,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:02:59,246 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:02:59,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:02:59,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:02:59,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:02:59,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:02:59,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:02:59,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:02:59,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:02:59,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:02:59,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:02:59,280 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:02:59,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:02:59,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:02:59,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:02:59,281 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:02:59,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:02:59,282 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_ea55eb07-50ca-4116-9d06-6af610a24a16/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_ea55eb07-50ca-4116-9d06-6af610a24a16/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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2023-11-25 00:02:59,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:02:59,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:02:59,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:02:59,714 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:02:59,715 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:02:59,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-25 00:03:02,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:03:03,239 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:03:03,240 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2023-11-25 00:03:03,275 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/data/002f31c87/ac37c7e9959548828cddfc51d0385c79/FLAG70043b3e0 [2023-11-25 00:03:03,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/data/002f31c87/ac37c7e9959548828cddfc51d0385c79 [2023-11-25 00:03:03,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:03:03,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:03:03,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:03,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:03:03,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:03:03,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a015894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03, skipping insertion in model container [2023-11-25 00:03:03,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,404 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:03:03,724 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_ea55eb07-50ca-4116-9d06-6af610a24a16/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-25 00:03:03,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:03,748 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:03:03,828 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_ea55eb07-50ca-4116-9d06-6af610a24a16/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2023-11-25 00:03:03,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:03,863 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:03:03,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03 WrapperNode [2023-11-25 00:03:03,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:03,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:03,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:03:03,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:03:03,874 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:03:03" (1/1) ... [2023-11-25 00:03:03,888 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:03:03" (1/1) ... [2023-11-25 00:03:03,912 INFO L138 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2023-11-25 00:03:03,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:03,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:03:03,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:03:03,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:03:03,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:03:03,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:03:03,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:03:03,950 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:03:03,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (1/1) ... [2023-11-25 00:03:03,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:03,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:03,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/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:03:04,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/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:03:04,048 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-25 00:03:04,048 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-25 00:03:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:03:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:03:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:03:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:03:04,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:03:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:03:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:03:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:03:04,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:03:04,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:03:04,210 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:03:04,217 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:03:04,258 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-25 00:03:04,401 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:03:04,448 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:03:04,449 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-25 00:03:04,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:04 BoogieIcfgContainer [2023-11-25 00:03:04,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:03:04,454 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:03:04,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:03:04,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:03:04,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:03:03" (1/3) ... [2023-11-25 00:03:04,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0caa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:04, skipping insertion in model container [2023-11-25 00:03:04,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:03" (2/3) ... [2023-11-25 00:03:04,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0caa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:04, skipping insertion in model container [2023-11-25 00:03:04,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:04" (3/3) ... [2023-11-25 00:03:04,463 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2023-11-25 00:03:04,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:03:04,487 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:03:04,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:03:04,551 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;@6a363860, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:03:04,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:03:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 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:03:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-25 00:03:04,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:04,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:04,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:04,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash 545307248, now seen corresponding path program 1 times [2023-11-25 00:03:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:04,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108482266] [2023-11-25 00:03:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:04,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:04,891 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:03:04,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108482266] [2023-11-25 00:03:04,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108482266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:04,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:04,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266726905] [2023-11-25 00:03:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:04,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:04,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:04,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:04,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:04,937 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 2 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:04,984 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-25 00:03:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-25 00:03:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:04,994 INFO L225 Difference]: With dead ends: 38 [2023-11-25 00:03:04,994 INFO L226 Difference]: Without dead ends: 18 [2023-11-25 00:03:04,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:05,002 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:05,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:03:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-25 00:03:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-25 00:03:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-25 00:03:05,041 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2023-11-25 00:03:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:05,042 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-25 00:03:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:05,042 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-25 00:03:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-25 00:03:05,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:05,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:05,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:03:05,044 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:05,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 76022282, now seen corresponding path program 1 times [2023-11-25 00:03:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:05,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349190871] [2023-11-25 00:03:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:05,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:05,323 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:05,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349190871] [2023-11-25 00:03:05,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349190871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:05,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651354770] [2023-11-25 00:03:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:05,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:05,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:05,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:05,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:03:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:05,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-25 00:03:05,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:05,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651354770] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:03:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1866555923] [2023-11-25 00:03:05,593 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-25 00:03:05,593 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:03:05,598 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:03:05,605 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:03:05,606 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:03:07,542 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:03:09,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1866555923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:09,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:03:09,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 11 [2023-11-25 00:03:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468074636] [2023-11-25 00:03:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:09,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-25 00:03:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-25 00:03:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=95, Unknown=3, NotChecked=0, Total=132 [2023-11-25 00:03:09,650 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:11,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-25 00:03:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:12,479 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2023-11-25 00:03:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:03:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-25 00:03:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:12,481 INFO L225 Difference]: With dead ends: 20 [2023-11-25 00:03:12,481 INFO L226 Difference]: Without dead ends: 18 [2023-11-25 00:03:12,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=42, Invalid=111, Unknown=3, NotChecked=0, Total=156 [2023-11-25 00:03:12,484 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:12,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 9 Unknown, 0 Unchecked, 2.6s Time] [2023-11-25 00:03:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-25 00:03:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-25 00:03:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-25 00:03:12,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2023-11-25 00:03:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:12,499 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-25 00:03:12,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-11-25 00:03:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-25 00:03:12,503 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:12,504 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:12,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-25 00:03:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:12,712 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:12,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1332973642, now seen corresponding path program 1 times [2023-11-25 00:03:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452101916] [2023-11-25 00:03:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-25 00:03:12,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:12,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452101916] [2023-11-25 00:03:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452101916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:12,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338831092] [2023-11-25 00:03:12,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:12,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:12,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:12,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:12,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:03:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:12,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-25 00:03:12,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-25 00:03:12,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-25 00:03:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338831092] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:03:13,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [213478428] [2023-11-25 00:03:13,027 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-25 00:03:13,027 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:03:13,028 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:03:13,028 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:03:13,029 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:03:14,845 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:03:15,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '290#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_20| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem7#1_20| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_20|))) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-25 00:03:15,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:03:15,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:03:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-25 00:03:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114811592] [2023-11-25 00:03:15,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:03:15,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:03:15,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:03:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:03:15,308 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:15,362 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-11-25 00:03:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:03:15,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-25 00:03:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:15,364 INFO L225 Difference]: With dead ends: 38 [2023-11-25 00:03:15,365 INFO L226 Difference]: Without dead ends: 27 [2023-11-25 00:03:15,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:03:15,367 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:15,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:03:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-25 00:03:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-25 00:03:15,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-25 00:03:15,382 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 13 [2023-11-25 00:03:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:15,383 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-25 00:03:15,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:15,384 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-25 00:03:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-25 00:03:15,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:15,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:15,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:15,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:15,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:15,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:15,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1756795556, now seen corresponding path program 2 times [2023-11-25 00:03:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589983079] [2023-11-25 00:03:15,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:03:17,876 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589983079] [2023-11-25 00:03:17,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589983079] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:17,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793909906] [2023-11-25 00:03:17,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-25 00:03:17,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:17,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:17,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:17,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:03:18,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-25 00:03:18,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:03:18,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-25 00:03:18,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:18,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:03:18,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-25 00:03:18,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-25 00:03:18,546 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-25 00:03:18,546 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 20 treesize of output 23 [2023-11-25 00:03:18,686 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-25 00:03:18,687 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 31 treesize of output 30 [2023-11-25 00:03:18,699 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 27 treesize of output 15 [2023-11-25 00:03:18,724 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-25 00:03:18,724 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 19 treesize of output 18 [2023-11-25 00:03:18,979 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:03:18,980 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 1 case distinctions, treesize of input 50 treesize of output 37 [2023-11-25 00:03:19,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:19,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 34 [2023-11-25 00:03:19,023 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:03:19,023 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 1 case distinctions, treesize of input 45 treesize of output 36 [2023-11-25 00:03:19,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:19,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 30 [2023-11-25 00:03:19,082 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-25 00:03:19,083 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 27 treesize of output 26 [2023-11-25 00:03:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:03:19,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:19,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:19,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 548 [2023-11-25 00:03:20,843 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse0 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_303 Int)) (let ((.cse3 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_310 .cse2)) (= (select .cse3 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_310 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_310 .cse2)) (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_303 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse5 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or .cse6 (and (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 .cse2))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (= (select .cse8 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse8 .cse2))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (= (select (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_303 Int)) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_310 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse4) (or (and (or (and (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4))) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) (forall ((v_prenex_5 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_5 .cse2)) (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4)))) .cse6) (or (forall ((v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_310 .cse2)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1)))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_310 .cse2)))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse13 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse13 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse13 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse4))) is different from false [2023-11-25 00:03:21,875 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select v_ArrVal_310 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) .cse1) (or .cse1 (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_303 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse2 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_310 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse2 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (or (and (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) (forall ((v_prenex_5 (Array Int Int))) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse3 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse3 4))))) (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse4 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse4 4))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4))) (or (and (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse5 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4))))) (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_6 Int) (v_prenex_4 Int) (v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_prenex_5 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 4)))))) .cse1) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4))) (forall ((v_prenex_4 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_4) (forall ((v_prenex_6 Int) (v_ArrVal_298 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (select (store (store |c_#memory_int| v_prenex_4 (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) v_prenex_4) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_prenex_6)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse7) (or (and (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse8 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse8 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (= (select (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (or (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| v_prenex_4 v_prenex_5) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_5 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse1 .cse7) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse10 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse11 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_310 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_303 Int)) (or (= (select v_ArrVal_310 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_310 (Array Int Int)) (v_ArrVal_303 Int)) (or (= (select v_ArrVal_310 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~data_init~0#1|))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_310 (Array Int Int))) (or (= (select v_ArrVal_310 4) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_298 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_303 Int)) (let ((.cse12 (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_298) |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_303)) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_310) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 .cse0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))))))) is different from false [2023-11-25 00:03:22,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:22,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2023-11-25 00:03:22,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:03:22,127 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:03:22,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:22,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2023-11-25 00:03:22,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2023-11-25 00:03:22,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-25 00:03:22,195 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-25 00:03:22,212 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2023-11-25 00:03:22,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:22,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-11-25 00:03:22,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2023-11-25 00:03:22,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-25 00:03:22,260 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-25 00:03:22,279 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-25 00:03:22,292 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 1 [2023-11-25 00:03:22,304 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-25 00:03:22,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 1 [2023-11-25 00:03:22,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:22,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2023-11-25 00:03:22,325 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-25 00:03:22,335 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-25 00:03:22,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 72 [2023-11-25 00:03:22,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:03:22,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-11-25 00:03:22,366 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:03:22,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-25 00:03:22,375 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:03:22,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 1 [2023-11-25 00:03:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-11-25 00:03:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793909906] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:03:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241216860] [2023-11-25 00:03:22,519 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-11-25 00:03:22,520 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:03:22,520 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:03:22,521 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:03:22,521 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:03:24,652 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:03:25,099 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~len~0#1| 5)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse3 (= 5 |c_ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse9 (<= 1 |c_#StackHeapBarrier|)) (.cse5 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse6 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse7 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse8 (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1))) (or (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (exists ((|v_#memory_$Pointer$.offset_61| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_41| Int)) (let ((.cse4 (= |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_41| 0))) (and (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_61| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_61| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_41|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |c_ULTIMATE.start_sll_circular_create_~len#1| 4)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 3) .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7 (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 4) .cse8))))) (exists ((|v_#memory_$Pointer$.base_61| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.base_41| Int)) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_61| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_61| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.base_41|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0))))) (exists ((|v_#memory_int_9| (Array Int (Array Int Int))) (|v_#memory_int_84| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_#memory_int| (store |v_#memory_int_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse10 .cse0 |c_ULTIMATE.start_sll_circular_create_~data#1|))) (= (store |v_#memory_int_84| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |v_#memory_int_84| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |v_#memory_int_9|)))))) (and .cse1 (exists ((|v_#memory_int_5| (Array Int (Array Int Int))) (|v_#memory_int_80| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_int_80| 1)) (.cse12 (select |v_#memory_int_5| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (= (select .cse11 1) 0) (= 48 (select .cse11 0)) (= |v_#memory_int_5| (store |v_#memory_int_80| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |v_#memory_int_80| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 (select .cse12 0)))) (= (store |v_#memory_int_5| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store .cse12 4 1)) |c_#memory_int|)))) .cse2 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) .cse3 .cse9 (exists ((|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (store (select |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4))))) (<= (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_40| (Array Int Int))) (and (= (select |v_#valid_40| 1) 1) (= (select |v_#valid_40| 2) 1) (= (select |v_#valid_40| 0) 0) (= |c_#valid| (store |v_#valid_40| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 1)) (= (select |v_#valid_40| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0))) (exists ((|v_#length_28| (Array Int Int))) (and (= 2 (select |v_#length_28| 1)) (= (select |v_#length_28| 2) 27) (= (store |v_#length_28| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 8) |c_#length|))) .cse5 .cse6 .cse7 (= |c_ULTIMATE.start_sll_circular_create_~len#1| 5) .cse8 (exists ((|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (= (store |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0 0) 4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 4))) |c_#memory_$Pointer$.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) is different from true [2023-11-25 00:03:26,707 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '537#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (<= 1 |ULTIMATE.start_main_~data_new~0#1|) (= |ULTIMATE.start_main_~len~0#1| 5) (exists ((|v_ULTIMATE.start_main_#t~mem7#1_28| Int)) (and (not (= |v_ULTIMATE.start_main_#t~mem7#1_28| 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |v_ULTIMATE.start_main_#t~mem7#1_28|))) (= |ULTIMATE.start_main_~head~1#1.offset| 0))' at error location [2023-11-25 00:03:26,707 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:03:26,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:03:26,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-25 00:03:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765396591] [2023-11-25 00:03:26,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:03:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-25 00:03:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-25 00:03:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1005, Unknown=10, NotChecked=198, Total=1332 [2023-11-25 00:03:26,712 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:28,772 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2023-11-25 00:03:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-25 00:03:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-25 00:03:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:28,774 INFO L225 Difference]: With dead ends: 41 [2023-11-25 00:03:28,774 INFO L226 Difference]: Without dead ends: 39 [2023-11-25 00:03:28,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=261, Invalid=1720, Unknown=11, NotChecked=264, Total=2256 [2023-11-25 00:03:28,777 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:28,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 76 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 61 Unchecked, 0.3s Time] [2023-11-25 00:03:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-25 00:03:28,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2023-11-25 00:03:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-25 00:03:28,802 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-11-25 00:03:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:28,803 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-25 00:03:28,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 28 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-25 00:03:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:03:28,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:28,809 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:28,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:29,017 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:29,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1375297979, now seen corresponding path program 1 times [2023-11-25 00:03:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:29,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342057899] [2023-11-25 00:03:29,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:29,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:03:29,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342057899] [2023-11-25 00:03:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342057899] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:29,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574204215] [2023-11-25 00:03:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:29,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:29,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-25 00:03:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:30,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-25 00:03:30,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:30,056 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 6 treesize of output 5 [2023-11-25 00:03:30,090 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:03:30,091 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:03:30,120 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:03:30,120 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:03:30,145 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:03:30,146 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-25 00:03:30,192 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-25 00:03:30,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-11-25 00:03:30,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-25 00:03:30,255 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 17 treesize of output 12 [2023-11-25 00:03:30,319 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 24 treesize of output 12 [2023-11-25 00:03:30,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-25 00:03:30,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-25 00:03:30,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:03:30,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_461) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2023-11-25 00:03:30,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:03:30,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2023-11-25 00:03:30,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-25 00:03:30,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-25 00:03:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2023-11-25 00:03:30,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574204215] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:03:30,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [70081685] [2023-11-25 00:03:30,615 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2023-11-25 00:03:30,616 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:03:30,616 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:03:30,616 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:03:30,617 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:03:31,259 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:03:32,743 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '807#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| Int) (|v_#memory_$Pointer$.base_81| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int)))) (and (= (select (select |v_#memory_int_112| |ULTIMATE.start_main_~head~1#1.base|) 4) 1) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| (store (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0 0)) |ULTIMATE.start_main_~head~1#1.base| (store (select (store |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| (store (select |v_#memory_$Pointer$.offset_78| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0 0)) |ULTIMATE.start_main_~head~1#1.base|) 4 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) 4)))) (= (store |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| (store (select |v_#memory_int_111| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0 (select (select |v_#memory_int_112| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0))) |v_#memory_int_112|) (= |#memory_int| (store |v_#memory_int_112| |ULTIMATE.start_main_~head~1#1.base| (store (select |v_#memory_int_112| |ULTIMATE.start_main_~head~1#1.base|) 4 1))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| (store (select |v_#memory_$Pointer$.base_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~head~1#1.base| (store (select (store |v_#memory_$Pointer$.base_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23| (store (select |v_#memory_$Pointer$.base_81| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_23|) 0 |ULTIMATE.start_sll_circular_create_#res#1.base|)) |ULTIMATE.start_main_~head~1#1.base|) 4 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) 4)))))) (= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 5) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) 0) 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) 0)) (= (+ 3 |ULTIMATE.start_main_~data_new~0#1|) 0) (= |ULTIMATE.start_main_~head~1#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-25 00:03:32,744 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:03:32,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:03:32,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2023-11-25 00:03:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669430941] [2023-11-25 00:03:32,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:03:32,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-25 00:03:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-25 00:03:32,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=534, Unknown=1, NotChecked=46, Total=650 [2023-11-25 00:03:32,747 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:33,069 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-11-25 00:03:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-25 00:03:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-25 00:03:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:33,080 INFO L225 Difference]: With dead ends: 36 [2023-11-25 00:03:33,080 INFO L226 Difference]: Without dead ends: 30 [2023-11-25 00:03:33,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=101, Invalid=658, Unknown=1, NotChecked=52, Total=812 [2023-11-25 00:03:33,086 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:33,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2023-11-25 00:03:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-25 00:03:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-25 00:03:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:33,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-11-25 00:03:33,103 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 23 [2023-11-25 00:03:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-11-25 00:03:33,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 16 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-11-25 00:03:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-25 00:03:33,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:33,105 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:33,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:03:33,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:33,316 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:03:33,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1774124688, now seen corresponding path program 3 times [2023-11-25 00:03:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:33,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964952784] [2023-11-25 00:03:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:33,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-25 00:03:36,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964952784] [2023-11-25 00:03:36,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964952784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:03:36,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458700681] [2023-11-25 00:03:36,630 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-25 00:03:36,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:03:36,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:36,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:03:36,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ea55eb07-50ca-4116-9d06-6af610a24a16/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-25 00:03:37,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-25 00:03:37,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-25 00:03:37,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-25 00:03:37,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:03:37,262 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 6 treesize of output 5 [2023-11-25 00:03:37,346 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-25 00:03:37,349 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:03:37,402 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-25 00:03:37,403 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 17 treesize of output 21 [2023-11-25 00:03:37,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-25 00:03:37,586 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-25 00:03:37,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-25 00:03:37,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2023-11-25 00:03:37,707 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 9 treesize of output 12 [2023-11-25 00:03:37,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-25 00:03:37,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-25 00:03:37,980 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-25 00:03:37,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-11-25 00:03:38,030 INFO L349 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2023-11-25 00:03:38,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 60 [2023-11-25 00:03:38,068 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-11-25 00:03:38,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 41 [2023-11-25 00:03:38,079 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 10 treesize of output 9 [2023-11-25 00:03:38,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-11-25 00:03:38,134 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:03:38,361 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-25 00:03:38,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 95 [2023-11-25 00:03:38,447 INFO L349 Elim1Store]: treesize reduction 104, result has 25.7 percent of original size [2023-11-25 00:03:38,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 92 [2023-11-25 00:03:38,476 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-25 00:03:38,477 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 2 case distinctions, treesize of input 26 treesize of output 28 [2023-11-25 00:03:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-11-25 00:03:38,708 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-25 00:03:39,742 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-11-25 00:03:39,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 273 treesize of output 203 [2023-11-25 00:03:40,019 INFO L349 Elim1Store]: treesize reduction 304, result has 33.2 percent of original size [2023-11-25 00:03:40,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 273 treesize of output 369 [2023-11-25 00:03:40,056 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2023-11-25 00:03:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 236 treesize of output 239