./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/shared_mem1.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_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/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_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/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_c2bf1679-ee49-438f-83cc-070f61077879/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 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:07:50,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:07:50,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-25 00:07:50,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:07:50,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:07:50,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:07:50,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:07:50,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:07:50,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:07:50,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:07:50,909 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:07:50,910 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:07:50,911 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:07:50,912 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:07:50,913 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:07:50,913 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:07:50,914 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:07:50,914 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:07:50,914 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:07:50,915 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:07:50,915 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:07:50,916 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:07:50,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:07:50,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-25 00:07:50,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:07:50,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:07:50,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:07:50,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:07:50,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-25 00:07:50,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:07:50,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-25 00:07:50,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:07:50,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-25 00:07:50,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:07:50,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:07:50,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:07:50,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:07:50,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:07:50,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:07:50,924 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:07:50,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-25 00:07:50,925 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:07:50,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:07:50,925 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:07:50,926 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-25 00:07:50,926 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:07:50,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:07:50,927 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_c2bf1679-ee49-438f-83cc-070f61077879/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_c2bf1679-ee49-438f-83cc-070f61077879/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 -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2023-11-25 00:07:51,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:07:51,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:07:51,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:07:51,246 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:07:51,246 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:07:51,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-25 00:07:54,417 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:07:54,748 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:07:54,748 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/sv-benchmarks/c/heap-data/shared_mem1.i [2023-11-25 00:07:54,763 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/data/1ac54bb43/3b15c20208814a9f9d957c19cd220b18/FLAG33a39af67 [2023-11-25 00:07:54,776 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/data/1ac54bb43/3b15c20208814a9f9d957c19cd220b18 [2023-11-25 00:07:54,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:07:54,781 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:07:54,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:07:54,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:07:54,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:07:54,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:07:54" (1/1) ... [2023-11-25 00:07:54,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d91b65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:54, skipping insertion in model container [2023-11-25 00:07:54,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:07:54" (1/1) ... [2023-11-25 00:07:54,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:07:55,192 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_c2bf1679-ee49-438f-83cc-070f61077879/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-25 00:07:55,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:07:55,209 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:07:55,253 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_c2bf1679-ee49-438f-83cc-070f61077879/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2023-11-25 00:07:55,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:07:55,293 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:07:55,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55 WrapperNode [2023-11-25 00:07:55,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:07:55,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:07:55,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:07:55,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:07:55,303 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:07:55" (1/1) ... [2023-11-25 00:07:55,324 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:07:55" (1/1) ... [2023-11-25 00:07:55,350 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 83 [2023-11-25 00:07:55,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:07:55,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:07:55,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:07:55,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:07:55,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:07:55,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:07:55,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:07:55,387 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:07:55,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (1/1) ... [2023-11-25 00:07:55,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:07:55,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:55,425 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/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:07:55,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/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:07:55,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-25 00:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-25 00:07:55,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:07:55,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-25 00:07:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-25 00:07:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:07:55,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:07:55,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:07:55,630 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:07:55,633 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:07:55,848 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:07:56,006 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:07:56,006 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-25 00:07:56,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:07:56 BoogieIcfgContainer [2023-11-25 00:07:56,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:07:56,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:07:56,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:07:56,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:07:56,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:07:54" (1/3) ... [2023-11-25 00:07:56,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8d5d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:07:56, skipping insertion in model container [2023-11-25 00:07:56,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:07:55" (2/3) ... [2023-11-25 00:07:56,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8d5d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:07:56, skipping insertion in model container [2023-11-25 00:07:56,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:07:56" (3/3) ... [2023-11-25 00:07:56,028 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2023-11-25 00:07:56,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:07:56,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-25 00:07:56,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:07:56,117 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;@7d413127, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:07:56,117 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-25 00:07:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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:07:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-25 00:07:56,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:56,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-25 00:07:56,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:07:56,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1698198648, now seen corresponding path program 1 times [2023-11-25 00:07:56,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:56,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611981567] [2023-11-25 00:07:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:56,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:56,402 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:07:56,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:56,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611981567] [2023-11-25 00:07:56,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611981567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:07:56,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:07:56,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:07:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201759593] [2023-11-25 00:07:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:07:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-25 00:07:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:56,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-25 00:07:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:07:56,452 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:56,495 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-25 00:07:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-25 00:07:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-11-25 00:07:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:56,507 INFO L225 Difference]: With dead ends: 15 [2023-11-25 00:07:56,508 INFO L226 Difference]: Without dead ends: 8 [2023-11-25 00:07:56,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-25 00:07:56,517 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:56,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-25 00:07:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-25 00:07:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-25 00:07:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:07:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-11-25 00:07:56,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-11-25 00:07:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:56,553 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-11-25 00:07:56,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:07:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-11-25 00:07:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-25 00:07:56,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:56,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:56,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:07:56,556 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:07:56,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1518656950, now seen corresponding path program 1 times [2023-11-25 00:07:56,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:56,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667237248] [2023-11-25 00:07:56,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:56,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:57,749 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:07:57,749 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:57,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667237248] [2023-11-25 00:07:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667237248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:07:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:07:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:07:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994559180] [2023-11-25 00:07:57,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:07:57,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:07:57,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:07:57,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:07:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:07:57,756 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:07:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:07:57,876 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-11-25 00:07:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:07:57,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:07:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:07:57,877 INFO L225 Difference]: With dead ends: 15 [2023-11-25 00:07:57,878 INFO L226 Difference]: Without dead ends: 13 [2023-11-25 00:07:57,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:07:57,879 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:07:57,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:07:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-25 00:07:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-25 00:07:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:07:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-11-25 00:07:57,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2023-11-25 00:07:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:07:57,888 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-11-25 00:07:57,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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:07:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-11-25 00:07:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-25 00:07:57,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:07:57,890 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:07:57,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:07:57,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:07:57,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:07:57,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2058731945, now seen corresponding path program 1 times [2023-11-25 00:07:57,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:07:57,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600755837] [2023-11-25 00:07:57,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:07:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:07:59,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:07:59,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600755837] [2023-11-25 00:07:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600755837] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:07:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613714831] [2023-11-25 00:07:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:07:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:07:59,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:07:59,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:07:59,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-25 00:07:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:07:59,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-25 00:07:59,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:07:59,654 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-25 00:07:59,656 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 1 case distinctions, treesize of input 34 treesize of output 19 [2023-11-25 00:07:59,667 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:07:59,668 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 34 treesize of output 25 [2023-11-25 00:07:59,696 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:07:59,724 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:07:59,725 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 19 treesize of output 18 [2023-11-25 00:07:59,749 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:08:00,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:00,317 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 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-25 00:08:00,349 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:08:00,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:00,371 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 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-25 00:08:00,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:00,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:00,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:00,459 INFO L349 Elim1Store]: treesize reduction 30, result has 14.3 percent of original size [2023-11-25 00:08:00,459 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 33 treesize of output 33 [2023-11-25 00:08:00,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2023-11-25 00:08:00,516 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-11-25 00:08:00,517 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 65 treesize of output 75 [2023-11-25 00:08:00,862 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-25 00:08:00,863 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 145 [2023-11-25 00:08:01,048 INFO L349 Elim1Store]: treesize reduction 100, result has 54.8 percent of original size [2023-11-25 00:08:01,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 140 treesize of output 228 [2023-11-25 00:08:01,127 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-25 00:08:01,128 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 206 [2023-11-25 00:08:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:01,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:02,026 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-11-25 00:08:02,027 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 1 case distinctions, treesize of input 18 treesize of output 7 [2023-11-25 00:08:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613714831] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:05,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [300399557] [2023-11-25 00:08:05,263 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-25 00:08:05,263 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:05,267 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:08:05,273 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:08:05,274 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:08:09,766 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:08:14,278 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~m~0#1.base|) 0))) (and (or (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_#memory_$Pointer$.base_72| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse2 (select |v_#memory_int_78| .cse1)) (.cse3 (select (select |v_#memory_$Pointer$.offset_72| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse0 (select .cse2 .cse3))) (and (<= 101 .cse0) (= |c_#memory_int| (store |v_#memory_int_78| .cse1 (store .cse2 .cse3 (+ (* (- 1) (select (select |v_#memory_int_78| |c_ULTIMATE.start_main_~head~0#1.base|) 0)) .cse0)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| .cse1 (store (select |v_#memory_$Pointer$.offset_72| .cse1) .cse3 (select (select |c_#memory_$Pointer$.offset| .cse1) .cse3)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_72| .cse1 (store (select |v_#memory_$Pointer$.base_72| .cse1) .cse3 (select (select |c_#memory_$Pointer$.base| .cse1) .cse3))))))))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (let ((.cse4 (select (select |v_#memory_$Pointer$.base_72| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse6 (select |v_#memory_int_78| .cse4)) (.cse5 (select (select |v_#memory_$Pointer$.offset_72| |c_ULTIMATE.start_main_~head~0#1.base|) 4))) (let ((.cse7 (select .cse6 .cse5))) (and (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| .cse4 (store (select |v_#memory_$Pointer$.offset_72| .cse4) .cse5 (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)))) (= (store |v_#memory_int_78| .cse4 (store .cse6 .cse5 (+ (select (select |v_#memory_int_78| |c_ULTIMATE.start_main_~head~0#1.base|) 0) .cse7))) |c_#memory_int|) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_72| .cse4 (store (select |v_#memory_$Pointer$.base_72| .cse4) .cse5 (select (select |c_#memory_$Pointer$.base| .cse4) .cse5)))) (<= .cse7 100))))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (<= 1 |c_#StackHeapBarrier|) (= .cse8 |c_ULTIMATE.start_main_#t~mem17#1|) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (let ((.cse9 (not |v_ULTIMATE.start_main_#t~short19#1_20|))) (and (or (and (<= |c_ULTIMATE.start_main_#t~mem17#1| 90) .cse9) (and |v_ULTIMATE.start_main_#t~short19#1_20| (<= 91 |c_ULTIMATE.start_main_#t~mem17#1|))) (let ((.cse10 (not |c_ULTIMATE.start_main_#t~short19#1|))) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_19| |c_ULTIMATE.start_main_#t~mem18#1|) .cse9 .cse10) (and |v_ULTIMATE.start_main_#t~short19#1_20| (= |c_ULTIMATE.start_main_#t~mem18#1| .cse8) (or (and |c_ULTIMATE.start_main_#t~short19#1| (<= |c_ULTIMATE.start_main_#t~mem18#1| 109)) (and .cse10 (<= 110 |c_ULTIMATE.start_main_#t~mem18#1|))))))))) (= |c_ULTIMATE.start_main_~m~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 8) |c_ULTIMATE.start_main_~list~0#1.offset|))) is different from true [2023-11-25 00:08:14,281 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '145#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~mem18#1_20| Int) (|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_19| Int)) (and (or |v_ULTIMATE.start_main_#t~short19#1_20| (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0) 91)) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| |v_ULTIMATE.start_main_#t~mem18#1_19|) (not |v_ULTIMATE.start_main_#t~short19#1_20|)) (and (= |v_ULTIMATE.start_main_#t~mem18#1_20| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) 0)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_20|))))) (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.offset|) (or (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (<= 101 (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (= |#memory_int| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (* (- 1) (select (select |v_#memory_int_78| |ULTIMATE.start_main_~head~0#1.base|) 0)) (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4)))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4))))))) (exists ((|v_#memory_$Pointer$.offset_72| (Array Int (Array Int Int))) (|v_#memory_int_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_72| (Array Int (Array Int Int)))) (and (<= (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) 100) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4))))) (= |#memory_int| (store |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (+ (select (select |v_#memory_int_78| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_int_78| |ULTIMATE.start_main_~head~0#1.base|) 0))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_72| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_72| |ULTIMATE.start_main_~head~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_72| |ULTIMATE.start_main_~head~0#1.base|) 4)))))))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) 8) |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~m~0#1.offset| 0))' at error location [2023-11-25 00:08:14,282 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:08:14,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-25 00:08:14,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819766787] [2023-11-25 00:08:14,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:14,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-25 00:08:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:14,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-25 00:08:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=215, Unknown=7, NotChecked=30, Total=306 [2023-11-25 00:08:14,292 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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:08:15,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-25 00:08:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:15,690 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2023-11-25 00:08:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:08:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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 9 [2023-11-25 00:08:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:15,692 INFO L225 Difference]: With dead ends: 17 [2023-11-25 00:08:15,692 INFO L226 Difference]: Without dead ends: 15 [2023-11-25 00:08:15,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=54, Invalid=215, Unknown=7, NotChecked=30, Total=306 [2023-11-25 00:08:15,695 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:15,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 19 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-25 00:08:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-25 00:08:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2023-11-25 00:08:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:08:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-11-25 00:08:15,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2023-11-25 00:08:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:15,701 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-11-25 00:08:15,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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:08:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-11-25 00:08:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-25 00:08:15,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:15,703 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:15,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:15,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:15,910 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:15,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash 859689689, now seen corresponding path program 1 times [2023-11-25 00:08:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004868098] [2023-11-25 00:08:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:17,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004868098] [2023-11-25 00:08:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004868098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244178687] [2023-11-25 00:08:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:17,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:17,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-25 00:08:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:17,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-25 00:08:17,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:17,346 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 18 treesize of output 16 [2023-11-25 00:08:17,356 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 14 treesize of output 15 [2023-11-25 00:08:17,369 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 14 treesize of output 15 [2023-11-25 00:08:17,419 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 45 treesize of output 7 [2023-11-25 00:08:17,823 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:08:17,824 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 144 [2023-11-25 00:08:17,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 149 [2023-11-25 00:08:17,873 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 108 [2023-11-25 00:08:17,888 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 76 [2023-11-25 00:08:17,904 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 52 treesize of output 30 [2023-11-25 00:08:18,241 INFO L349 Elim1Store]: treesize reduction 38, result has 19.1 percent of original size [2023-11-25 00:08:18,242 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 300 treesize of output 233 [2023-11-25 00:08:18,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 183 [2023-11-25 00:08:18,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 179 [2023-11-25 00:08:18,308 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 0 case distinctions, treesize of input 137 treesize of output 94 [2023-11-25 00:08:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:18,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:21,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse62 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse62))) (let ((.cse29 (select |c_#memory_int| .cse10)) (.cse30 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse62))) (let ((.cse31 (select .cse29 .cse30)) (.cse9 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (let ((.cse0 (store |c_#memory_int| .cse10 (store .cse29 .cse30 (+ .cse31 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (<= (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse8 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse7 (+ .cse5 4))) (let ((.cse1 (select (select .cse8 .cse4) .cse7))) (store .cse0 .cse1 (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse6 .cse4) .cse7))) (store .cse2 .cse3 (+ (* (- 1) (select (select .cse0 .cse4) .cse5)) (select .cse2 .cse3))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (<= 91 (select (select (let ((.cse16 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse18 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse14 (select (select .cse18 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse17 (+ .cse15 4))) (let ((.cse11 (select (select .cse18 .cse14) .cse17))) (store .cse0 .cse11 (let ((.cse12 (select .cse0 .cse11)) (.cse13 (select (select .cse16 .cse14) .cse17))) (store .cse12 .cse13 (+ (* (- 1) (select (select .cse0 .cse14) .cse15)) (select .cse12 .cse13))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12)) (.cse23 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse22 (+ (select (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9) 4))) (let ((.cse19 (select (select .cse23 .cse21) .cse22))) (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (<= 91 (select (select (store .cse0 .cse19 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse0 .cse19) (select (select .cse20 .cse21) .cse22)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12)) (.cse28 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9) 4))) (let ((.cse24 (select (select .cse28 .cse26) .cse27))) (or (< 100 (select (select .cse0 .cse24) (select (select .cse25 .cse26) .cse27))) (forall ((v_prenex_51 (Array Int Int))) (<= (select (select (store .cse0 .cse24 v_prenex_51) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))))) (< 100 .cse31)) (or (< .cse31 101) (and (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14)) (.cse37 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse35 (select (select .cse37 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse36 (+ (select (select .cse34 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9) 4))) (let ((.cse32 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse33 (select (select .cse37 .cse35) .cse36))) (or (< 100 (select (select .cse32 .cse33) (select (select .cse34 .cse35) .cse36))) (forall ((v_prenex_52 (Array Int Int))) (<= (select (select (store .cse32 .cse33 v_prenex_52) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (<= 91 (select (select (let ((.cse44 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14))) (let ((.cse43 (select (select .cse44 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse46 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse42 (select (select .cse46 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse45 (+ .cse43 4))) (let ((.cse38 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse39 (select (select .cse46 .cse42) .cse45))) (store .cse38 .cse39 (let ((.cse40 (select .cse38 .cse39)) (.cse41 (select (select .cse44 .cse42) .cse45))) (store .cse40 .cse41 (+ (select .cse40 .cse41) (* (- 1) (select (select .cse38 .cse42) .cse43)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (let ((.cse53 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14))) (let ((.cse52 (select (select .cse53 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse55 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse51 (select (select .cse55 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse54 (+ .cse52 4))) (let ((.cse47 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse48 (select (select .cse55 .cse51) .cse54))) (store .cse47 .cse48 (let ((.cse49 (select .cse47 .cse48)) (.cse50 (select (select .cse53 .cse51) .cse54))) (store .cse49 .cse50 (+ (select .cse49 .cse50) (* (- 1) (select (select .cse47 .cse51) .cse52)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse58 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14)) (.cse61 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9)) (.cse60 (+ (select (select .cse58 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9) 4))) (let ((.cse56 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse57 (select (select .cse61 .cse59) .cse60))) (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (<= 91 (select (select (store .cse56 .cse57 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse56 .cse57) (select (select .cse58 .cse59) .cse60))))))))))))))) is different from false [2023-11-25 00:08:21,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse62 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse62))) (let ((.cse60 (select |c_#memory_int| .cse10)) (.cse61 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse62))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) (.cse0 (select .cse60 .cse61))) (and (or (< .cse0 101) (and (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (<= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse9 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse8 (+ .cse6 4))) (let ((.cse1 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse2 (select (select .cse9 .cse5) .cse8))) (store .cse1 .cse2 (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse7 .cse5) .cse8))) (store .cse3 .cse4 (+ (select .cse3 .cse4) (* (- 1) (select (select .cse1 .cse5) .cse6)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14)) (.cse17 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse16 (+ (select (select .cse14 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse12 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse13 (select (select .cse17 .cse15) .cse16))) (or (< 100 (select (select .cse12 .cse13) (select (select .cse14 .cse15) .cse16))) (forall ((v_DerPreprocessor_10 (Array Int Int))) (<= 91 (select (select (store .cse12 .cse13 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (<= 91 (select (select (let ((.cse24 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14))) (let ((.cse23 (select (select .cse24 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse26 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse22 (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse25 (+ .cse23 4))) (let ((.cse18 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse19 (select (select .cse26 .cse22) .cse25))) (store .cse18 .cse19 (let ((.cse20 (select .cse18 .cse19)) (.cse21 (select (select .cse24 .cse22) .cse25))) (store .cse20 .cse21 (+ (select .cse20 .cse21) (* (- 1) (select (select .cse18 .cse22) .cse23)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_14)) (.cse32 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_13))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse31 (+ (select (select .cse29 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse27 (store |c_#memory_int| .cse10 v_DerPreprocessor_15)) (.cse28 (select (select .cse32 .cse30) .cse31))) (or (< 100 (select (select .cse27 .cse28) (select (select .cse29 .cse30) .cse31))) (forall ((v_prenex_52 (Array Int Int))) (<= (select (select (store .cse27 .cse28 v_prenex_52) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))))) (or (< 100 .cse0) (let ((.cse33 (store |c_#memory_int| .cse10 (store .cse60 .cse61 (+ .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (and (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (<= (select (select (let ((.cse39 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse41 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse37 (select (select .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse40 (+ .cse38 4))) (let ((.cse34 (select (select .cse41 .cse37) .cse40))) (store .cse33 .cse34 (let ((.cse35 (select .cse33 .cse34)) (.cse36 (select (select .cse39 .cse37) .cse40))) (store .cse35 .cse36 (+ (select .cse35 .cse36) (* (- 1) (select (select .cse33 .cse37) .cse38)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12)) (.cse46 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse44 (select (select .cse46 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse45 (+ (select (select .cse43 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse42 (select (select .cse46 .cse44) .cse45))) (or (forall ((v_prenex_51 (Array Int Int))) (<= (select (select (store .cse33 .cse42 v_prenex_51) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse33 .cse42) (select (select .cse43 .cse44) .cse45)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12)) (.cse51 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse49 (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse50 (+ (select (select .cse48 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11) 4))) (let ((.cse47 (select (select .cse51 .cse49) .cse50))) (or (forall ((v_DerPreprocessor_10 (Array Int Int))) (<= 91 (select (select (store .cse33 .cse47 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))) (< 100 (select (select .cse33 .cse47) (select (select .cse48 .cse49) .cse50)))))))) (forall ((v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (<= 91 (select (select (let ((.cse57 (store |c_#memory_$Pointer$.offset| .cse10 v_DerPreprocessor_12))) (let ((.cse56 (select (select .cse57 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse59 (store |c_#memory_$Pointer$.base| .cse10 v_DerPreprocessor_11))) (let ((.cse55 (select (select .cse59 |c_ULTIMATE.start_main_~head~0#1.base|) .cse11)) (.cse58 (+ .cse56 4))) (let ((.cse52 (select (select .cse59 .cse55) .cse58))) (store .cse33 .cse52 (let ((.cse53 (select .cse33 .cse52)) (.cse54 (select (select .cse57 .cse55) .cse58))) (store .cse53 .cse54 (+ (select .cse53 .cse54) (* (- 1) (select (select .cse33 .cse55) .cse56)))))))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|))))))))))) is different from false [2023-11-25 00:08:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-25 00:08:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244178687] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-25 00:08:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1683829895] [2023-11-25 00:08:21,718 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-25 00:08:21,718 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:21,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:08:21,718 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:08:21,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:08:25,999 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-25 00:08:28,166 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '247#(and (exists ((|v_#memory_$Pointer$.base_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem10#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem13#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem15#1_31| Int) (|v_ULTIMATE.start_main_#t~mem11#1_31| Int) (|v_ULTIMATE.start_main_~list~0#1.base_43| Int) (|v_ULTIMATE.start_main_#t~mem13#1.offset_31| Int) (|v_ULTIMATE.start_main_#t~mem14#1_31| Int) (|v_#memory_$Pointer$.offset_85| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem10#1.base_31| Int) (|v_ULTIMATE.start_main_#t~mem12#1_31| Int) (|v_#memory_int_90| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~list~0#1.offset_44| Int)) (and (or (and (= |ULTIMATE.start_main_#t~mem11#1| |v_ULTIMATE.start_main_#t~mem11#1_31|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (= |#memory_int| (store |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (* (- 1) (select (select |v_#memory_int_90| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))))) (<= 101 (select (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))) (= |ULTIMATE.start_main_#t~mem10#1.offset| |v_ULTIMATE.start_main_#t~mem10#1.offset_31|) (= |ULTIMATE.start_main_#t~mem12#1| |v_ULTIMATE.start_main_#t~mem12#1_31|) (= (store |v_#memory_$Pointer$.base_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))) |#memory_$Pointer$.base|) (= |ULTIMATE.start_main_#t~mem10#1.base| |v_ULTIMATE.start_main_#t~mem10#1.base_31|)) (and (= |ULTIMATE.start_main_#t~mem15#1| |v_ULTIMATE.start_main_#t~mem15#1_31|) (= |ULTIMATE.start_main_#t~mem13#1.offset| |v_ULTIMATE.start_main_#t~mem13#1.offset_31|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.offset_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)))))) (<= (select (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) 100) (= |ULTIMATE.start_main_#t~mem14#1| |v_ULTIMATE.start_main_#t~mem14#1_31|) (= |#memory_int| (store |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (+ (select (select |v_#memory_int_90| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_int_90| |v_ULTIMATE.start_main_~list~0#1.base_43|) |v_ULTIMATE.start_main_~list~0#1.offset_44|))))) (= |ULTIMATE.start_main_#t~mem13#1.base| |v_ULTIMATE.start_main_#t~mem13#1.base_31|) (= (store |v_#memory_$Pointer$.base_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (store (select |v_#memory_$Pointer$.base_85| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))) (select (select |v_#memory_$Pointer$.offset_85| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 4 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))) |#memory_$Pointer$.base|))) (or (not (= |v_ULTIMATE.start_main_~list~0#1.offset_44| 0)) (not (= |v_ULTIMATE.start_main_~list~0#1.base_43| 0))) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|)) |ULTIMATE.start_main_~list~0#1.offset|) (= |ULTIMATE.start_main_~list~0#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~list~0#1.base_43|) (+ 8 |v_ULTIMATE.start_main_~list~0#1.offset_44|))))) (exists ((|v_ULTIMATE.start_main_#t~short19#1_20| Bool) (|v_ULTIMATE.start_main_#t~mem18#1_28| Int) (|v_ULTIMATE.start_main_#t~mem18#1_29| Int)) (and (or (< (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|) 91) |v_ULTIMATE.start_main_#t~short19#1_20|) (or (and (= |v_ULTIMATE.start_main_#t~mem18#1_29| (select (select |#memory_int| |ULTIMATE.start_main_~m~0#1.base|) |ULTIMATE.start_main_~m~0#1.offset|)) (<= 110 |v_ULTIMATE.start_main_#t~mem18#1_29|)) (and (not |v_ULTIMATE.start_main_#t~short19#1_20|) (= |v_ULTIMATE.start_main_#t~mem18#1_29| |v_ULTIMATE.start_main_#t~mem18#1_28|))))))' at error location [2023-11-25 00:08:28,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-25 00:08:28,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-25 00:08:28,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-25 00:08:28,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049923814] [2023-11-25 00:08:28,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-25 00:08:28,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-25 00:08:28,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:08:28,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-25 00:08:28,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=167, Unknown=5, NotChecked=54, Total=272 [2023-11-25 00:08:28,169 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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:08:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:08:29,343 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2023-11-25 00:08:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:08:29,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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 9 [2023-11-25 00:08:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:08:29,350 INFO L225 Difference]: With dead ends: 21 [2023-11-25 00:08:29,350 INFO L226 Difference]: Without dead ends: 12 [2023-11-25 00:08:29,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=93, Invalid=290, Unknown=5, NotChecked=74, Total=462 [2023-11-25 00:08:29,351 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:08:29,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 43 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2023-11-25 00:08:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-25 00:08:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-25 00:08:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:08:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-11-25 00:08:29,358 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2023-11-25 00:08:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:08:29,358 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-11-25 00:08:29,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 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:08:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-11-25 00:08:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-25 00:08:29,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:08:29,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:08:29,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:29,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:29,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-25 00:08:29,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:08:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1538386312, now seen corresponding path program 1 times [2023-11-25 00:08:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:08:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062289363] [2023-11-25 00:08:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:08:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:32,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:08:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062289363] [2023-11-25 00:08:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062289363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-25 00:08:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440431447] [2023-11-25 00:08:32,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:08:32,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:08:32,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-25 00:08:32,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-25 00:08:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:08:32,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-25 00:08:32,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:08:32,905 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-25 00:08:32,905 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 1 case distinctions, treesize of input 41 treesize of output 19 [2023-11-25 00:08:32,938 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 14 treesize of output 15 [2023-11-25 00:08:33,003 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-25 00:08:33,004 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 19 treesize of output 18 [2023-11-25 00:08:33,061 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 14 treesize of output 15 [2023-11-25 00:08:33,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2023-11-25 00:08:33,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:33,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2023-11-25 00:08:33,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:33,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:33,666 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 0 case distinctions, treesize of input 33 treesize of output 28 [2023-11-25 00:08:33,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-11-25 00:08:33,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:33,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:33,792 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 0 case distinctions, treesize of input 37 treesize of output 32 [2023-11-25 00:08:33,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2023-11-25 00:08:34,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:34,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-25 00:08:34,083 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-25 00:08:34,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 21 [2023-11-25 00:08:34,225 INFO L349 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2023-11-25 00:08:34,226 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 163 treesize of output 165 [2023-11-25 00:08:35,373 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-25 00:08:35,374 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 292 treesize of output 261 [2023-11-25 00:08:35,540 INFO L349 Elim1Store]: treesize reduction 300, result has 5.7 percent of original size [2023-11-25 00:08:35,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 278 treesize of output 269 [2023-11-25 00:08:35,638 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2023-11-25 00:08:35,639 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 245 treesize of output 232 [2023-11-25 00:08:35,682 INFO L349 Elim1Store]: treesize reduction 55, result has 5.2 percent of original size [2023-11-25 00:08:35,683 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 231 treesize of output 211 [2023-11-25 00:08:36,013 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 16 treesize of output 1 [2023-11-25 00:08:37,083 INFO L349 Elim1Store]: treesize reduction 73, result has 41.6 percent of original size [2023-11-25 00:08:37,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 322 treesize of output 324 [2023-11-25 00:08:37,796 INFO L349 Elim1Store]: treesize reduction 516, result has 21.2 percent of original size [2023-11-25 00:08:37,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 258 treesize of output 374 [2023-11-25 00:08:38,100 INFO L349 Elim1Store]: treesize reduction 102, result has 34.2 percent of original size [2023-11-25 00:08:38,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 219 treesize of output 248 [2023-11-25 00:08:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:08:38,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-25 00:08:39,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse64 (select |c_#memory_int| .cse6)) (.cse65 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse66))) (let ((.cse34 (select .cse64 .cse65))) (let ((.cse35 (store |c_#memory_int| .cse6 (store .cse64 .cse65 (+ .cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (.cse7 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (or (and (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_24)) (.cse5 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_23))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse4 (+ (select (select .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse0 (store |c_#memory_int| .cse6 v_DerPreprocessor_25)) (.cse1 (select (select .cse5 .cse3) .cse4))) (or (< 100 (select (select .cse0 .cse1) (select (select .cse2 .cse3) .cse4))) (forall ((v_DerPreprocessor_20 (Array Int Int))) (<= 91 (select (select (store .cse0 .cse1 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_24))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse17 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_23))) (let ((.cse12 (select (select .cse17 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse16 (+ .cse13 4))) (let ((.cse8 (store |c_#memory_int| .cse6 v_DerPreprocessor_25)) (.cse9 (select (select .cse17 .cse12) .cse16))) (let ((.cse10 (select .cse8 .cse9)) (.cse11 (select (select .cse15 .cse12) .cse16))) (let ((.cse14 (select .cse10 .cse11))) (or (< 90 (select (select (store .cse8 .cse9 (store .cse10 .cse11 (+ (* (- 1) (select (select .cse8 .cse12) .cse13)) .cse14))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse14 101))))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_24)) (.cse23 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_23))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse22 (+ (select (select .cse20 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7) 4))) (let ((.cse18 (store |c_#memory_int| .cse6 v_DerPreprocessor_25)) (.cse19 (select (select .cse23 .cse21) .cse22))) (or (< 100 (select (select .cse18 .cse19) (select (select .cse20 .cse21) .cse22))) (forall ((v_prenex_61 (Array Int Int))) (<= (select (select (store .cse18 .cse19 v_prenex_61) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse31 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_24))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse33 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_23))) (let ((.cse28 (select (select .cse33 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse32 (+ .cse29 4))) (let ((.cse24 (store |c_#memory_int| .cse6 v_DerPreprocessor_25)) (.cse25 (select (select .cse33 .cse28) .cse32))) (let ((.cse26 (select .cse24 .cse25)) (.cse27 (select (select .cse31 .cse28) .cse32))) (let ((.cse30 (select .cse26 .cse27))) (or (< (select (select (store .cse24 .cse25 (store .cse26 .cse27 (+ (* (- 1) (select (select .cse24 .cse28) .cse29)) .cse30))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse30 101)))))))))) (< .cse34 101)) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_22)) (.cse40 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_21))) (let ((.cse38 (select (select .cse40 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse39 (+ 4 (select (select .cse37 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)))) (let ((.cse36 (select (select .cse40 .cse38) .cse39))) (or (< 100 (select (select .cse35 .cse36) (select (select .cse37 .cse38) .cse39))) (forall ((v_prenex_60 (Array Int Int))) (<= 91 (select (select (store .cse35 .cse36 v_prenex_60) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse47 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_22))) (let ((.cse45 (select (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse49 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_21))) (let ((.cse44 (select (select .cse49 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse48 (+ 4 .cse45))) (let ((.cse41 (select (select .cse49 .cse44) .cse48))) (let ((.cse42 (select .cse35 .cse41)) (.cse43 (select (select .cse47 .cse44) .cse48))) (let ((.cse46 (select .cse42 .cse43))) (or (< (select (select (store .cse35 .cse41 (store .cse42 .cse43 (+ (* (- 1) (select (select .cse35 .cse44) .cse45)) .cse46))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse46 101))))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_22)) (.cse54 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_21))) (let ((.cse52 (select (select .cse54 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse53 (+ 4 (select (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)))) (let ((.cse50 (select (select .cse54 .cse52) .cse53))) (or (< 100 (select (select .cse35 .cse50) (select (select .cse51 .cse52) .cse53))) (forall ((v_DerPreprocessor_20 (Array Int Int))) (<= (select (select (store .cse35 .cse50 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse61 (store |c_#memory_$Pointer$.offset| .cse6 v_DerPreprocessor_22))) (let ((.cse59 (select (select .cse61 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse63 (store |c_#memory_$Pointer$.base| .cse6 v_DerPreprocessor_21))) (let ((.cse58 (select (select .cse63 |c_ULTIMATE.start_main_~list~0#1.base|) .cse7)) (.cse62 (+ 4 .cse59))) (let ((.cse55 (select (select .cse63 .cse58) .cse62))) (let ((.cse56 (select .cse35 .cse55)) (.cse57 (select (select .cse61 .cse58) .cse62))) (let ((.cse60 (select .cse56 .cse57))) (or (< 90 (select (select (store .cse35 .cse55 (store .cse56 .cse57 (+ (* (- 1) (select (select .cse35 .cse58) .cse59)) .cse60))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse60 101))))))))))))))) is different from false [2023-11-25 00:08:39,418 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse66 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse64 (select |c_#memory_int| .cse11)) (.cse65 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse66))) (let ((.cse12 (select .cse64 .cse65))) (let ((.cse0 (store |c_#memory_int| .cse11 (store .cse64 .cse65 (+ .cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (.cse10 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_22))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse9 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_21))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse8 (+ .cse6 4))) (let ((.cse1 (select (select .cse9 .cse5) .cse8))) (let ((.cse2 (select .cse0 .cse1)) (.cse3 (select (select .cse7 .cse5) .cse8))) (let ((.cse4 (select .cse2 .cse3))) (or (< (select (select (store .cse0 .cse1 (store .cse2 .cse3 (+ .cse4 (* (- 1) (select (select .cse0 .cse5) .cse6))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse4 101))))))))) (or (< .cse12 101) (and (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_24)) (.cse18 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_23))) (let ((.cse16 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse17 (+ 4 (select (select .cse15 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)))) (let ((.cse13 (store |c_#memory_int| .cse11 v_DerPreprocessor_25)) (.cse14 (select (select .cse18 .cse16) .cse17))) (or (< 100 (select (select .cse13 .cse14) (select (select .cse15 .cse16) .cse17))) (forall ((v_prenex_61 (Array Int Int))) (<= (select (select (store .cse13 .cse14 v_prenex_61) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_24))) (let ((.cse24 (select (select .cse26 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse28 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_23))) (let ((.cse23 (select (select .cse28 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse27 (+ 4 .cse24))) (let ((.cse19 (store |c_#memory_int| .cse11 v_DerPreprocessor_25)) (.cse20 (select (select .cse28 .cse23) .cse27))) (let ((.cse21 (select .cse19 .cse20)) (.cse22 (select (select .cse26 .cse23) .cse27))) (let ((.cse25 (select .cse21 .cse22))) (or (< (select (select (store .cse19 .cse20 (store .cse21 .cse22 (+ (* (- 1) (select (select .cse19 .cse23) .cse24)) .cse25))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110) (< .cse25 101))))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_24))) (let ((.cse34 (select (select .cse36 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse38 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_23))) (let ((.cse33 (select (select .cse38 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse37 (+ 4 .cse34))) (let ((.cse29 (store |c_#memory_int| .cse11 v_DerPreprocessor_25)) (.cse30 (select (select .cse38 .cse33) .cse37))) (let ((.cse31 (select .cse29 .cse30)) (.cse32 (select (select .cse36 .cse33) .cse37))) (let ((.cse35 (select .cse31 .cse32))) (or (< 90 (select (select (store .cse29 .cse30 (store .cse31 .cse32 (+ (* (- 1) (select (select .cse29 .cse33) .cse34)) .cse35))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse35 101))))))))) (forall ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int)) (v_DerPreprocessor_25 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_24)) (.cse44 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_23))) (let ((.cse42 (select (select .cse44 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse43 (+ 4 (select (select .cse41 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)))) (let ((.cse39 (store |c_#memory_int| .cse11 v_DerPreprocessor_25)) (.cse40 (select (select .cse44 .cse42) .cse43))) (or (< 100 (select (select .cse39 .cse40) (select (select .cse41 .cse42) .cse43))) (forall ((v_DerPreprocessor_20 (Array Int Int))) (<= 91 (select (select (store .cse39 .cse40 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_22))) (let ((.cse50 (select (select .cse51 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse53 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_21))) (let ((.cse49 (select (select .cse53 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse52 (+ .cse50 4))) (let ((.cse45 (select (select .cse53 .cse49) .cse52))) (let ((.cse46 (select .cse0 .cse45)) (.cse47 (select (select .cse51 .cse49) .cse52))) (let ((.cse48 (select .cse46 .cse47))) (or (< 90 (select (select (store .cse0 .cse45 (store .cse46 .cse47 (+ .cse48 (* (- 1) (select (select .cse0 .cse49) .cse50))))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)) (< .cse48 101))))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_22)) (.cse58 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_21))) (let ((.cse56 (select (select .cse58 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse57 (+ (select (select .cse55 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 4))) (let ((.cse54 (select (select .cse58 .cse56) .cse57))) (or (forall ((v_DerPreprocessor_20 (Array Int Int))) (<= (select (select (store .cse0 .cse54 v_DerPreprocessor_20) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 109)) (< 100 (select (select .cse0 .cse54) (select (select .cse55 .cse56) .cse57)))))))) (forall ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.offset| .cse11 v_DerPreprocessor_22)) (.cse63 (store |c_#memory_$Pointer$.base| .cse11 v_DerPreprocessor_21))) (let ((.cse61 (select (select .cse63 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10)) (.cse62 (+ (select (select .cse60 |c_ULTIMATE.start_main_~head~0#1.base|) .cse10) 4))) (let ((.cse59 (select (select .cse63 .cse61) .cse62))) (or (< 100 (select (select .cse0 .cse59) (select (select .cse60 .cse61) .cse62))) (forall ((v_prenex_60 (Array Int Int))) (<= 91 (select (select (store .cse0 .cse59 v_prenex_60) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|)))))))))))))) is different from false [2023-11-25 00:08:40,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:08:40,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 51 [2023-11-25 00:08:41,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-25 00:08:41,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 45 [2023-11-25 00:08:41,483 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Complicated and unsupported kind of self-update: (store |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_99| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) v_arrayElimArr_24) [2023-11-25 00:08:41,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1389065047] [2023-11-25 00:08:41,485 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2023-11-25 00:08:41,486 INFO L166 IcfgInterpreter]: Building call graph [2023-11-25 00:08:41,486 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-25 00:08:41,486 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-25 00:08:41,486 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-25 00:08:41,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:08:41,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-25 00:08:41,707 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1deb9259 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.newQuantifier(SymbolicTools.java:284) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$TermDomainOperationProviderWithLightElimination.projectExistentially(SymbolicTools.java:270) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:117) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-25 00:08:41,711 INFO L158 Benchmark]: Toolchain (without parser) took 46929.99ms. Allocated memory was 138.4MB in the beginning and 293.6MB in the end (delta: 155.2MB). Free memory was 95.7MB in the beginning and 227.9MB in the end (delta: -132.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,711 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 104.9MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:08:41,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.51ms. Allocated memory is still 138.4MB. Free memory was 95.7MB in the beginning and 78.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.34ms. Allocated memory is still 138.4MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,712 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 138.4MB. Free memory was 76.3MB in the beginning and 74.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,712 INFO L158 Benchmark]: RCFGBuilder took 626.84ms. Allocated memory is still 138.4MB. Free memory was 74.7MB in the beginning and 93.8MB in the end (delta: -19.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,712 INFO L158 Benchmark]: TraceAbstraction took 45693.64ms. Allocated memory was 138.4MB in the beginning and 293.6MB in the end (delta: 155.2MB). Free memory was 93.3MB in the beginning and 227.9MB in the end (delta: -134.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2023-11-25 00:08:41,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 104.9MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.51ms. Allocated memory is still 138.4MB. Free memory was 95.7MB in the beginning and 78.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.34ms. Allocated memory is still 138.4MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 138.4MB. Free memory was 76.3MB in the beginning and 74.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 626.84ms. Allocated memory is still 138.4MB. Free memory was 74.7MB in the beginning and 93.8MB in the end (delta: -19.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45693.64ms. Allocated memory was 138.4MB in the beginning and 293.6MB in the end (delta: 155.2MB). Free memory was 93.3MB in the beginning and 227.9MB in the end (delta: -134.6MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1deb9259 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Script currently locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@1deb9259: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertScriptNotLocked(ManagedScript.java:109) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-25 00:08:41,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2bf1679-ee49-438f-83cc-070f61077879/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...