./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:45:29,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:45:29,251 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:45:29,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:45:29,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:45:29,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:45:29,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:45:29,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:45:29,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:45:29,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:45:29,281 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:45:29,282 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:45:29,282 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:45:29,283 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:45:29,283 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:45:29,283 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:45:29,284 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:45:29,284 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:45:29,285 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:45:29,285 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:45:29,286 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:45:29,286 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:45:29,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:45:29,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:45:29,288 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:45:29,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:45:29,288 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:45:29,289 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:45:29,289 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:45:29,289 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:45:29,290 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:45:29,297 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:45:29,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:45:29,298 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:45:29,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:45:29,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:45:29,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:45:29,298 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:45:29,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:45:29,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:45:29,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:45:29,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:45:29,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:45:29,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:45:29,302 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:45:29,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:45:29,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:45:29,302 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:45:29,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:45:29,303 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_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/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_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2024-11-09 06:45:29,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:45:29,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:45:29,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:45:29,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:45:29,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:45:29,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-reverse.i Unable to find full path for "g++" [2024-11-09 06:45:31,953 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:45:32,210 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:45:32,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/sv-benchmarks/c/forester-heap/dll-reverse.i [2024-11-09 06:45:32,229 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/5c70b6450/26cf719bb7404baf8d22847ab59d3b04/FLAG441cf365f [2024-11-09 06:45:32,250 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/5c70b6450/26cf719bb7404baf8d22847ab59d3b04 [2024-11-09 06:45:32,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:45:32,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:45:32,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:45:32,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:45:32,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:45:32,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,266 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68961496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32, skipping insertion in model container [2024-11-09 06:45:32,266 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:45:32,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:45:32,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:45:32,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:45:32,876 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:45:32,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32 WrapperNode [2024-11-09 06:45:32,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:45:32,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:45:32,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:45:32,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:45:32,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,927 INFO L138 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-09 06:45:32,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:45:32,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:45:32,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:45:32,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:45:32,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,961 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:45:32,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:45:32,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:45:32,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:45:32,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (1/1) ... [2024-11-09 06:45:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:45:33,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:45:33,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:45:33,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:45:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:45:33,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:45:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:45:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:45:33,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:45:33,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:45:33,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:45:33,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:45:33,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:45:33,805 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-09 06:45:33,806 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:45:33,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:45:33,911 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 06:45:33,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:45:33 BoogieIcfgContainer [2024-11-09 06:45:33,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:45:33,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:45:33,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:45:33,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:45:33,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:45:32" (1/3) ... [2024-11-09 06:45:33,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200cf8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:45:33, skipping insertion in model container [2024-11-09 06:45:33,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:45:32" (2/3) ... [2024-11-09 06:45:33,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@200cf8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:45:33, skipping insertion in model container [2024-11-09 06:45:33,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:45:33" (3/3) ... [2024-11-09 06:45:33,927 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2024-11-09 06:45:33,945 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:45:33,945 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-09 06:45:34,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:45:34,009 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@5e1be81f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:45:34,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-09 06:45:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 65 states have (on average 2.3846153846153846) internal successors, (155), 132 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:45:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:45:34,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:34,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:45:34,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:34,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 10057, now seen corresponding path program 1 times [2024-11-09 06:45:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107509599] [2024-11-09 06:45:34,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:34,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:34,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107509599] [2024-11-09 06:45:34,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107509599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:34,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:45:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349069011] [2024-11-09 06:45:34,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:34,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:45:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:34,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:45:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:45:34,393 INFO L87 Difference]: Start difference. First operand has 137 states, 65 states have (on average 2.3846153846153846) internal successors, (155), 132 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 06:45:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:34,670 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2024-11-09 06:45:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:45:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-09 06:45:34,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:34,686 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:45:34,686 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 06:45:34,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:45:34,695 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 69 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:34,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 06:45:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 06:45:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 61 states have (on average 2.2459016393442623) internal successors, (137), 126 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2024-11-09 06:45:34,748 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 2 [2024-11-09 06:45:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:34,748 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2024-11-09 06:45:34,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 06:45:34,750 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2024-11-09 06:45:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 06:45:34,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:34,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 06:45:34,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:45:34,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:34,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:34,753 INFO L85 PathProgramCache]: Analyzing trace with hash 10058, now seen corresponding path program 1 times [2024-11-09 06:45:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:34,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663637980] [2024-11-09 06:45:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:34,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:34,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663637980] [2024-11-09 06:45:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663637980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:34,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:34,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 06:45:34,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759654235] [2024-11-09 06:45:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:34,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:45:34,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:34,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:45:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:45:34,948 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 06:45:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:35,181 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-09 06:45:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:45:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-11-09 06:45:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:35,184 INFO L225 Difference]: With dead ends: 125 [2024-11-09 06:45:35,184 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 06:45:35,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:45:35,186 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 69 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:35,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 119 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:35,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 06:45:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 06:45:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 61 states have (on average 2.19672131147541) internal successors, (134), 123 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2024-11-09 06:45:35,209 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 2 [2024-11-09 06:45:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:35,210 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2024-11-09 06:45:35,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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) [2024-11-09 06:45:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2024-11-09 06:45:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:45:35,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:35,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:35,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:45:35,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:35,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash 154242279, now seen corresponding path program 1 times [2024-11-09 06:45:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940597935] [2024-11-09 06:45:35,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:35,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940597935] [2024-11-09 06:45:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940597935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:35,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:45:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202803476] [2024-11-09 06:45:35,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:35,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:45:35,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:45:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:45:35,454 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2024-11-09 06:45:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:35,784 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2024-11-09 06:45:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:35,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 [2024-11-09 06:45:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:35,788 INFO L225 Difference]: With dead ends: 113 [2024-11-09 06:45:35,791 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 06:45:35,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:35,793 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 97 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:35,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 79 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:45:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 06:45:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 06:45:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.9242424242424243) internal successors, (127), 111 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2024-11-09 06:45:35,809 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 7 [2024-11-09 06:45:35,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:35,810 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2024-11-09 06:45:35,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2024-11-09 06:45:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2024-11-09 06:45:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:45:35,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:35,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:35,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:45:35,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:35,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash 154242280, now seen corresponding path program 1 times [2024-11-09 06:45:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448493813] [2024-11-09 06:45:35,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:36,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:36,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448493813] [2024-11-09 06:45:36,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448493813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:36,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:36,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:45:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599319438] [2024-11-09 06:45:36,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:36,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:45:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:36,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:45:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:45:36,211 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2024-11-09 06:45:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:36,656 INFO L93 Difference]: Finished difference Result 142 states and 162 transitions. [2024-11-09 06:45:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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 [2024-11-09 06:45:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:36,658 INFO L225 Difference]: With dead ends: 142 [2024-11-09 06:45:36,658 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 06:45:36,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:45:36,659 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 195 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:36,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 126 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:45:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 06:45:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 135. [2024-11-09 06:45:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 88 states have (on average 1.7727272727272727) internal successors, (156), 133 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:36,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2024-11-09 06:45:36,675 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 7 [2024-11-09 06:45:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:36,676 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2024-11-09 06:45:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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) [2024-11-09 06:45:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2024-11-09 06:45:36,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:45:36,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:36,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:45:36,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2096777140, now seen corresponding path program 1 times [2024-11-09 06:45:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087438518] [2024-11-09 06:45:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:36,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:36,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087438518] [2024-11-09 06:45:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087438518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:45:36,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258348221] [2024-11-09 06:45:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:36,868 INFO L87 Difference]: Start difference. First operand 135 states and 159 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2024-11-09 06:45:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:37,135 INFO L93 Difference]: Finished difference Result 134 states and 157 transitions. [2024-11-09 06:45:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) Word has length 9 [2024-11-09 06:45:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:37,137 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:45:37,137 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:45:37,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:45:37,139 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:37,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:45:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-09 06:45:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.75) internal successors, (154), 132 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:37,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 157 transitions. [2024-11-09 06:45:37,147 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 157 transitions. Word has length 9 [2024-11-09 06:45:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:37,147 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 157 transitions. [2024-11-09 06:45:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2024-11-09 06:45:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 157 transitions. [2024-11-09 06:45:37,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:45:37,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:37,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:37,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:45:37,150 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:37,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2096777139, now seen corresponding path program 1 times [2024-11-09 06:45:37,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:37,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554988806] [2024-11-09 06:45:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:37,361 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554988806] [2024-11-09 06:45:37,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554988806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:37,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:37,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:45:37,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419490715] [2024-11-09 06:45:37,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:37,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:37,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:37,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:37,363 INFO L87 Difference]: Start difference. First operand 134 states and 157 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2024-11-09 06:45:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:37,657 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-11-09 06:45:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:37,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) Word has length 9 [2024-11-09 06:45:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:37,660 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:45:37,664 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:45:37,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:45:37,665 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:37,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:45:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:45:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-09 06:45:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 131 states have internal predecessors, (152), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:37,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-11-09 06:45:37,679 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 9 [2024-11-09 06:45:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:37,679 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-11-09 06:45:37,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2024-11-09 06:45:37,680 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-11-09 06:45:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:45:37,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:37,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:37,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:45:37,686 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:37,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:37,687 INFO L85 PathProgramCache]: Analyzing trace with hash -662919436, now seen corresponding path program 1 times [2024-11-09 06:45:37,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:37,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766166955] [2024-11-09 06:45:37,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:37,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:38,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766166955] [2024-11-09 06:45:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766166955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:38,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:45:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636588894] [2024-11-09 06:45:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:38,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:45:38,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:45:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:45:38,159 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 9 states, 8 states have (on average 1.375) 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) [2024-11-09 06:45:38,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:38,795 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2024-11-09 06:45:38,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:45:38,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) 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) Word has length 11 [2024-11-09 06:45:38,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:38,797 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:45:38,797 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:45:38,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:45:38,799 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 95 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:38,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 196 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:45:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:45:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2024-11-09 06:45:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 120 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2024-11-09 06:45:38,805 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 11 [2024-11-09 06:45:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:38,806 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2024-11-09 06:45:38,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) 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) [2024-11-09 06:45:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2024-11-09 06:45:38,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 06:45:38,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:38,807 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:38,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:45:38,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:38,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -662919437, now seen corresponding path program 1 times [2024-11-09 06:45:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:38,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702831065] [2024-11-09 06:45:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:39,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:39,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702831065] [2024-11-09 06:45:39,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702831065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:39,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:39,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:45:39,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053115693] [2024-11-09 06:45:39,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:39,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:45:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:45:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:45:39,071 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2024-11-09 06:45:39,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:39,594 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2024-11-09 06:45:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:45:39,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) Word has length 11 [2024-11-09 06:45:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:39,595 INFO L225 Difference]: With dead ends: 121 [2024-11-09 06:45:39,595 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 06:45:39,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:45:39,597 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 88 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:39,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 176 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:45:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 06:45:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-09 06:45:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.6951219512195121) internal successors, (139), 119 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2024-11-09 06:45:39,602 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 11 [2024-11-09 06:45:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:39,603 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2024-11-09 06:45:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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) [2024-11-09 06:45:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2024-11-09 06:45:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:45:39,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:39,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:39,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:45:39,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 851102954, now seen corresponding path program 1 times [2024-11-09 06:45:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:39,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579683430] [2024-11-09 06:45:39,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:39,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579683430] [2024-11-09 06:45:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579683430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:39,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:45:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486822937] [2024-11-09 06:45:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:39,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:45:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:45:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:45:39,657 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:39,846 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2024-11-09 06:45:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:39,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 06:45:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:39,847 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:45:39,848 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:45:39,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:39,849 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 95 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:39,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 159 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:45:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2024-11-09 06:45:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.646341463414634) internal successors, (135), 119 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2024-11-09 06:45:39,854 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 13 [2024-11-09 06:45:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2024-11-09 06:45:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2024-11-09 06:45:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:45:39,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:39,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:39,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:45:39,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 852183948, now seen corresponding path program 1 times [2024-11-09 06:45:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625053277] [2024-11-09 06:45:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:39,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:40,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:40,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625053277] [2024-11-09 06:45:40,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625053277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:40,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:40,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:45:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154829552] [2024-11-09 06:45:40,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:40,222 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2024-11-09 06:45:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:40,487 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2024-11-09 06:45:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:45:40,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) Word has length 13 [2024-11-09 06:45:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:40,488 INFO L225 Difference]: With dead ends: 134 [2024-11-09 06:45:40,488 INFO L226 Difference]: Without dead ends: 134 [2024-11-09 06:45:40,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:45:40,489 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 19 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:40,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 270 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-09 06:45:40,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2024-11-09 06:45:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 124 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2024-11-09 06:45:40,497 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 13 [2024-11-09 06:45:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:40,497 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2024-11-09 06:45:40,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) [2024-11-09 06:45:40,498 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2024-11-09 06:45:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:45:40,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:40,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:40,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:45:40,499 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:40,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1035223121, now seen corresponding path program 1 times [2024-11-09 06:45:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:40,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876502289] [2024-11-09 06:45:40,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:40,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:40,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:40,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876502289] [2024-11-09 06:45:40,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876502289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:40,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:40,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:45:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864525602] [2024-11-09 06:45:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:40,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:40,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:40,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:40,829 INFO L87 Difference]: Start difference. First operand 126 states and 144 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-09 06:45:41,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:41,058 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2024-11-09 06:45:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:45:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-11-09 06:45:41,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:41,059 INFO L225 Difference]: With dead ends: 133 [2024-11-09 06:45:41,060 INFO L226 Difference]: Without dead ends: 133 [2024-11-09 06:45:41,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:45:41,061 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:41,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 271 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:41,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-09 06:45:41,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2024-11-09 06:45:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 129 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2024-11-09 06:45:41,066 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 16 [2024-11-09 06:45:41,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:41,066 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2024-11-09 06:45:41,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2024-11-09 06:45:41,067 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2024-11-09 06:45:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:45:41,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:41,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:41,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:45:41,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:41,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:41,069 INFO L85 PathProgramCache]: Analyzing trace with hash 2026591563, now seen corresponding path program 1 times [2024-11-09 06:45:41,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:41,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872561982] [2024-11-09 06:45:41,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:41,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:41,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872561982] [2024-11-09 06:45:41,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872561982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:41,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:41,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:45:41,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807273685] [2024-11-09 06:45:41,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:41,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:41,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:41,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:41,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:41,217 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-09 06:45:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:41,442 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-11-09 06:45:41,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:41,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-09 06:45:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:41,443 INFO L225 Difference]: With dead ends: 130 [2024-11-09 06:45:41,443 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 06:45:41,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:45:41,444 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:41,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 06:45:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-11-09 06:45:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.565217391304348) internal successors, (144), 128 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2024-11-09 06:45:41,448 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 17 [2024-11-09 06:45:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:41,450 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2024-11-09 06:45:41,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-09 06:45:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2024-11-09 06:45:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:45:41,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:41,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:41,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:45:41,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:41,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:41,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2026591564, now seen corresponding path program 1 times [2024-11-09 06:45:41,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:41,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850229794] [2024-11-09 06:45:41,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:41,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:41,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850229794] [2024-11-09 06:45:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850229794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:41,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:41,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:45:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060765533] [2024-11-09 06:45:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:45:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:45:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:45:41,699 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-09 06:45:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:41,932 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-11-09 06:45:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:45:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 17 [2024-11-09 06:45:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:41,933 INFO L225 Difference]: With dead ends: 129 [2024-11-09 06:45:41,933 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 06:45:41,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:45:41,934 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:41,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 229 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:45:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 06:45:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-09 06:45:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 92 states have (on average 1.5434782608695652) internal successors, (142), 127 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:41,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2024-11-09 06:45:41,939 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 17 [2024-11-09 06:45:41,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:41,940 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2024-11-09 06:45:41,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2024-11-09 06:45:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2024-11-09 06:45:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:45:41,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:41,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:45:41,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:41,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1934463026, now seen corresponding path program 1 times [2024-11-09 06:45:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426663826] [2024-11-09 06:45:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:42,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426663826] [2024-11-09 06:45:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426663826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:45:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811260912] [2024-11-09 06:45:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:42,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:45:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:45:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:45:42,256 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:42,813 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2024-11-09 06:45:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:45:42,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 06:45:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:42,815 INFO L225 Difference]: With dead ends: 128 [2024-11-09 06:45:42,815 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 06:45:42,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:45:42,816 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 75 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:42,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 151 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:45:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 06:45:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 06:45:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.5326086956521738) internal successors, (141), 126 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2024-11-09 06:45:42,822 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 19 [2024-11-09 06:45:42,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:42,823 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2024-11-09 06:45:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2024-11-09 06:45:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:45:42,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:42,824 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:42,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:45:42,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1934463027, now seen corresponding path program 1 times [2024-11-09 06:45:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964870737] [2024-11-09 06:45:42,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:42,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:43,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:43,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964870737] [2024-11-09 06:45:43,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964870737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:45:43,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:45:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:45:43,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978720150] [2024-11-09 06:45:43,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:45:43,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:45:43,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:45:43,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:45:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:45:43,214 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:45:43,822 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2024-11-09 06:45:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:45:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 06:45:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:45:43,823 INFO L225 Difference]: With dead ends: 126 [2024-11-09 06:45:43,823 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 06:45:43,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:45:43,824 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 73 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:45:43,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 217 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:45:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 06:45:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 06:45:43,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5108695652173914) internal successors, (139), 124 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2024-11-09 06:45:43,831 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 19 [2024-11-09 06:45:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:45:43,832 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2024-11-09 06:45:43,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:45:43,832 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2024-11-09 06:45:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:45:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:45:43,836 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:45:43,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:45:43,837 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:45:43,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:45:43,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1840353441, now seen corresponding path program 1 times [2024-11-09 06:45:43,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:45:43,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603251424] [2024-11-09 06:45:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:43,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:45:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:44,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:44,281 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:45:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603251424] [2024-11-09 06:45:44,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603251424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:45:44,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367392318] [2024-11-09 06:45:44,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:45:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:45:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:45:44,286 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:45:44,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:45:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:45:44,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 06:45:44,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:45:44,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:45:44,721 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:45:44,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 06:45:44,795 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 15 treesize of output 1 [2024-11-09 06:45:44,966 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:45:44,966 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 34 treesize of output 33 [2024-11-09 06:45:45,067 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:45:45,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:45:45,117 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:45:45,118 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 34 treesize of output 33 [2024-11-09 06:45:45,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:45:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:45,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:45:45,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:45:45,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 06:45:45,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:45:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2024-11-09 06:45:45,878 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 80 treesize of output 76 [2024-11-09 06:45:45,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:45:45,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2024-11-09 06:45:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:45:48,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367392318] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:45:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1051580250] [2024-11-09 06:45:48,171 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:45:48,171 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:45:48,176 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:45:48,183 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:45:48,184 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:45:55,515 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:46:44,983 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4280#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_169| Int)) (and (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_168| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_142| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_142|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_142|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_168|)) (= |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_168|) |v_ULTIMATE.start_main_~x~0#1.offset_142|)) (= |v_ULTIMATE.start_main_~x~0#1.base_169| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_168|) |v_ULTIMATE.start_main_~x~0#1.offset_142|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_168|) 1))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_139| Int) (|v_ULTIMATE.start_main_~x~0#1.base_165| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_165|) 1) (exists ((|v_#memory_int_84| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_105| (Array Int (Array Int Int))) (|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_int_86| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_109| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_20| Int) (|v_ULTIMATE.start_main_#t~mem4#1.offset_18| Int) (|v_#memory_$Pointer$.base_110| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_165| (store (select |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_165|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_139|) 0))) (<= 1 |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.base_109| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_$Pointer$.base_110|) (= (store |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_$Pointer$.offset_105| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_$Pointer$.offset_106|) (= (store |v_#memory_int_85| |v_ULTIMATE.start_main_~x~0#1.base_165| (store (select |v_#memory_int_85| |v_ULTIMATE.start_main_~x~0#1.base_165|) |v_ULTIMATE.start_main_~x~0#1.offset_139| (select (select |v_#memory_int_86| |v_ULTIMATE.start_main_~x~0#1.base_165|) |v_ULTIMATE.start_main_~x~0#1.offset_139|))) |v_#memory_int_86|) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~x~0#1.base_165| (store (store (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_~x~0#1.base_165|) |v_ULTIMATE.start_main_~x~0#1.offset_139| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_165|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_139|))))) (= |v_ULTIMATE.start_main_~x~0#1.offset_139| (select (select |v_#memory_$Pointer$.offset_106| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) 1) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_18|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_20|)) (= |v_ULTIMATE.start_main_~x~0#1.base_165| (select (select |v_#memory_$Pointer$.base_110| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (<= 0 (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4))) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) (<= (+ (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_110| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~x~0#1.base_165| (store (store (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~x~0#1.base_165|) |v_ULTIMATE.start_main_~x~0#1.offset_139| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_165|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_139|))))) (= (store |v_#memory_int_84| |v_ULTIMATE.start_main_#t~mem4#1.base_20| (store (select |v_#memory_int_84| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4) (select (select |v_#memory_int_85| |v_ULTIMATE.start_main_#t~mem4#1.base_20|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_18| 4)))) |v_#memory_int_85|))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_139|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_165|)))) (= |v_ULTIMATE.start_main_~x~0#1.base_169| |ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_169|) 1))))' at error location [2024-11-09 06:46:44,984 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:46:44,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:46:44,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2024-11-09 06:46:44,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388468301] [2024-11-09 06:46:44,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:46:44,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 06:46:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:46:44,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 06:46:44,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1797, Unknown=43, NotChecked=0, Total=2070 [2024-11-09 06:46:44,993 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 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) [2024-11-09 06:46:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:46:47,308 INFO L93 Difference]: Finished difference Result 211 states and 246 transitions. [2024-11-09 06:46:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:46:47,309 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 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 21 [2024-11-09 06:46:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:46:47,310 INFO L225 Difference]: With dead ends: 211 [2024-11-09 06:46:47,310 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 06:46:47,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=284, Invalid=2123, Unknown=43, NotChecked=0, Total=2450 [2024-11-09 06:46:47,312 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 500 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:46:47,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 521 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 06:46:47,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 06:46:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 141. [2024-11-09 06:46:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 139 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:46:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 160 transitions. [2024-11-09 06:46:47,318 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 160 transitions. Word has length 21 [2024-11-09 06:46:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:46:47,319 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 160 transitions. [2024-11-09 06:46:47,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0) internal successors, (58), 30 states have internal predecessors, (58), 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) [2024-11-09 06:46:47,319 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2024-11-09 06:46:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 06:46:47,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:46:47,320 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:46:47,344 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:46:47,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 06:46:47,524 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:46:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:46:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1840353442, now seen corresponding path program 1 times [2024-11-09 06:46:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:46:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020641643] [2024-11-09 06:46:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:46:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:46:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:46:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:46:48,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:46:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020641643] [2024-11-09 06:46:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020641643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:46:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798883762] [2024-11-09 06:46:48,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:46:48,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:46:48,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:46:48,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:46:48,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:46:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:46:48,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 06:46:48,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:46:48,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:46:48,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:46:48,459 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:46:48,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:46:48,506 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 15 treesize of output 1 [2024-11-09 06:46:48,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:46:48,620 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:46:48,620 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 50 treesize of output 45 [2024-11-09 06:46:48,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:46:48,704 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:46:48,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 06:46:48,725 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:46:48,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:46:48,773 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:46:48,773 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 50 treesize of output 45 [2024-11-09 06:46:48,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:46:48,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:46:48,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:46:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:46:48,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:46:49,306 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_146| Int) (v_ArrVal_587 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_146|) (< (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|))) (< |v_ULTIMATE.start_main_~x~0#1.offset_146| 0))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_146| Int) (v_ArrVal_587 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_146|) (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|) 1)) (< |v_ULTIMATE.start_main_~x~0#1.offset_146| 0)))) is different from false [2024-11-09 06:46:49,543 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_146| Int) (v_ArrVal_587 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_146|) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_582))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_583) .cse0 v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_146| 0))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_146| Int) (v_ArrVal_587 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_146|) (< |v_ULTIMATE.start_main_~x~0#1.offset_146| 0) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_583) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_587) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_146|) 1))))) is different from false [2024-11-09 06:46:49,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:46:49,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-09 06:46:49,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:46:49,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 06:46:49,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 06:46:49,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:46:49,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 161 [2024-11-09 06:46:49,802 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 56 treesize of output 54 [2024-11-09 06:46:49,812 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 54 treesize of output 50 [2024-11-09 06:46:49,820 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 74 treesize of output 68 [2024-11-09 06:46:49,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:46:49,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:46:49,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:46:49,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:46:49,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:46:49,994 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:46:50,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:46:50,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:46:50,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 06:46:50,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:46:50,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:46:50,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:46:50,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-09 06:46:50,028 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 13 treesize of output 11 [2024-11-09 06:46:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:46:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798883762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:46:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [480572849] [2024-11-09 06:46:50,381 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:46:50,382 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:46:50,382 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:46:50,382 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:46:50,383 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:46:54,665 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:48:05,114 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4808#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_184| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_156| Int)) (and (or (< |v_ULTIMATE.start_main_~x~0#1.offset_156| 0) (< (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_184|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_156|))) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_183| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_155| Int)) (and (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_183|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_183|) 1) (= |v_ULTIMATE.start_main_~x~0#1.base_184| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_183|) |v_ULTIMATE.start_main_~x~0#1.offset_155|)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_183|) |v_ULTIMATE.start_main_~x~0#1.offset_155|) |v_ULTIMATE.start_main_~x~0#1.offset_156|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_155|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_180| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_152| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_152|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|v_#memory_$Pointer$.base_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_137| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_23| Int) (|v_#memory_int_111| (Array Int (Array Int Int))) (|v_#memory_int_112| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.base_26| Int) (|v_#memory_$Pointer$.offset_136| (Array Int (Array Int Int)))) (and (= |v_#memory_$Pointer$.offset_137| (store |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_#t~mem4#1.base_26| (store (select |v_#memory_$Pointer$.offset_136| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))))) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)) (= |v_ULTIMATE.start_main_~x~0#1.base_180| (select (select |v_#memory_$Pointer$.base_141| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) (= (store |v_#memory_int_111| |v_ULTIMATE.start_main_#t~mem4#1.base_26| (store (select |v_#memory_int_111| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_int_112| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) |v_#memory_int_112|) (= (select (select |v_#memory_$Pointer$.offset_137| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) |v_ULTIMATE.start_main_~x~0#1.offset_152|) (= (store |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_main_#t~mem4#1.base_26| (store (select |v_#memory_$Pointer$.base_140| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4) (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) |v_#memory_$Pointer$.base_141|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) 1) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_23|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_26|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_~x~0#1.base_180| (store (store (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_152| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_152|) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_180|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_152|))))) (= (store |v_#memory_int_112| |v_ULTIMATE.start_main_~x~0#1.base_180| (store (select |v_#memory_int_112| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_152| (select (select |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_152|))) |v_#memory_int_113|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_~x~0#1.base_180| (store (store (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_~x~0#1.base_180|) |v_ULTIMATE.start_main_~x~0#1.offset_152| 0) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_152|) (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_180|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_152|))))) (<= (+ (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4)))) (= |#memory_int| (store |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_180| (store (select |v_#memory_int_113| |v_ULTIMATE.start_main_~x~0#1.base_180|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_152|) 0))) (<= 0 (select (select |v_#memory_$Pointer$.offset_137| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_23| 4))) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_26|) 1))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_180|) 1) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_152|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_180|)))) (= |v_ULTIMATE.start_main_~x~0#1.base_184| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_156|)))))' at error location [2024-11-09 06:48:05,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:48:05,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:48:05,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2024-11-09 06:48:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676762040] [2024-11-09 06:48:05,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:48:05,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 06:48:05,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:48:05,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 06:48:05,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1843, Unknown=45, NotChecked=178, Total=2256 [2024-11-09 06:48:05,118 INFO L87 Difference]: Start difference. First operand 141 states and 160 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 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) [2024-11-09 06:48:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:48:07,834 INFO L93 Difference]: Finished difference Result 192 states and 222 transitions. [2024-11-09 06:48:07,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 06:48:07,835 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 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 21 [2024-11-09 06:48:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:48:07,836 INFO L225 Difference]: With dead ends: 192 [2024-11-09 06:48:07,836 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 06:48:07,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=387, Invalid=2764, Unknown=49, NotChecked=222, Total=3422 [2024-11-09 06:48:07,838 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 705 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:48:07,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 646 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1466 Invalid, 0 Unknown, 399 Unchecked, 1.8s Time] [2024-11-09 06:48:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 06:48:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 137. [2024-11-09 06:48:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 109 states have (on average 1.4403669724770642) internal successors, (157), 135 states have internal predecessors, (157), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:48:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2024-11-09 06:48:07,845 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 21 [2024-11-09 06:48:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:48:07,845 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2024-11-09 06:48:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 32 states have internal predecessors, (63), 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) [2024-11-09 06:48:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2024-11-09 06:48:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:48:07,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:48:07,847 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:48:07,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:48:08,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 06:48:08,048 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:48:08,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:48:08,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1886742300, now seen corresponding path program 1 times [2024-11-09 06:48:08,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:48:08,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741044383] [2024-11-09 06:48:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:48:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:48:08,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:48:08,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741044383] [2024-11-09 06:48:08,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741044383] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:48:08,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067087706] [2024-11-09 06:48:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:48:08,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:48:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:48:08,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:48:08,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:48:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:48:08,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 06:48:08,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:48:08,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:48:08,812 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 06:48:08,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 06:48:08,879 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 15 treesize of output 1 [2024-11-09 06:48:09,038 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:48:09,038 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 34 treesize of output 33 [2024-11-09 06:48:09,132 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:48:09,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:48:09,171 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:48:09,172 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 34 treesize of output 33 [2024-11-09 06:48:09,361 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 33 treesize of output 17 [2024-11-09 06:48:09,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:48:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:48:09,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:48:09,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_159| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_159| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_159|) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_696))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_159|)) 1))) is different from false [2024-11-09 06:48:09,778 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_159| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_696))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_159|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_159| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_159|))) is different from false [2024-11-09 06:48:09,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:48:09,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 06:48:09,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:48:09,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2024-11-09 06:48:09,832 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 171 treesize of output 163 [2024-11-09 06:48:09,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:48:09,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-09 06:48:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:48:12,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067087706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:48:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1376122274] [2024-11-09 06:48:12,315 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:48:12,316 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:48:12,316 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:48:12,316 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:48:12,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:48:18,573 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:49:51,143 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 238 DAG size of output: 225 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 06:49:54,692 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5344#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_165| Int) (|v_ULTIMATE.start_main_~x~0#1.base_194| Int)) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_165|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_165|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_194|)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_194|) |v_ULTIMATE.start_main_~x~0#1.offset_165|)) 1)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_194|) |v_ULTIMATE.start_main_~x~0#1.offset_165|) |ULTIMATE.start_main_#t~mem14#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_194|) 1))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2024-11-09 06:49:54,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:49:54,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:49:54,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2024-11-09 06:49:54,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411791323] [2024-11-09 06:49:54,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:49:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 06:49:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 06:49:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1973, Unknown=39, NotChecked=186, Total=2450 [2024-11-09 06:49:54,695 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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) [2024-11-09 06:49:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:56,358 INFO L93 Difference]: Finished difference Result 187 states and 217 transitions. [2024-11-09 06:49:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:49:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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 24 [2024-11-09 06:49:56,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:56,360 INFO L225 Difference]: With dead ends: 187 [2024-11-09 06:49:56,360 INFO L226 Difference]: Without dead ends: 187 [2024-11-09 06:49:56,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 97.6s TimeCoverageRelationStatistics Valid=262, Invalid=2059, Unknown=39, NotChecked=190, Total=2550 [2024-11-09 06:49:56,361 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 217 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 362 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:56,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 641 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1482 Invalid, 0 Unknown, 362 Unchecked, 1.5s Time] [2024-11-09 06:49:56,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-09 06:49:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 144. [2024-11-09 06:49:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 142 states have internal predecessors, (166), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:49:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2024-11-09 06:49:56,366 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 24 [2024-11-09 06:49:56,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:56,366 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2024-11-09 06:49:56,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.206896551724138) internal successors, (64), 30 states have internal predecessors, (64), 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) [2024-11-09 06:49:56,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2024-11-09 06:49:56,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 06:49:56,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:56,368 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:49:56,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:49:56,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 06:49:56,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:49:56,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1886742301, now seen corresponding path program 1 times [2024-11-09 06:49:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:56,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629010419] [2024-11-09 06:49:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:49:57,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629010419] [2024-11-09 06:49:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629010419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565803297] [2024-11-09 06:49:57,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:57,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:49:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:49:57,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:49:57,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:49:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:57,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 06:49:57,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:49:57,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:49:57,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 06:49:57,561 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:49:57,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:49:57,619 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 15 treesize of output 1 [2024-11-09 06:49:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:49:57,765 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:49:57,766 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 50 treesize of output 45 [2024-11-09 06:49:57,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:49:57,857 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:49:57,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 06:49:57,885 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:49:57,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:49:57,942 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:49:57,942 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 50 treesize of output 45 [2024-11-09 06:49:57,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:49:58,142 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 33 treesize of output 17 [2024-11-09 06:49:58,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:49:58,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:49:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:49:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:49:58,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:49:58,817 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (v_ArrVal_815 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_168| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_168|) (< |v_ULTIMATE.start_main_~x~0#1.offset_168| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (< (+ 11 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_812) .cse0 v_ArrVal_816) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_168|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_815) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_168|))))))) (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int)) (v_ArrVal_816 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_168| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_168|) (< |v_ULTIMATE.start_main_~x~0#1.offset_168| 0) (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_812) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_816) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_168|)))))) is different from false [2024-11-09 06:49:59,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:49:59,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:49:59,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-09 06:49:59,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1070 [2024-11-09 06:49:59,096 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 547 treesize of output 523 [2024-11-09 06:49:59,109 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 523 treesize of output 499 [2024-11-09 06:49:59,119 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 499 treesize of output 491 [2024-11-09 06:49:59,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 447 [2024-11-09 06:49:59,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-11-09 06:49:59,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:49:59,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 06:49:59,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:49:59,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-09 06:49:59,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:49:59,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:59,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:49:59,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 06:49:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:49:59,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565803297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:49:59,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [58557253] [2024-11-09 06:49:59,923 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:49:59,923 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:49:59,924 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:49:59,924 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:49:59,924 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:50:05,786 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:51:50,774 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5868#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_204| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_174| Int)) (and (or (< (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_204|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 8) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_204|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_204|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 12))) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_174|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_204|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_204|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_174|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|))' at error location [2024-11-09 06:51:50,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:51:50,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:51:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 30 [2024-11-09 06:51:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245222513] [2024-11-09 06:51:50,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:51:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 06:51:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:51:50,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 06:51:50,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2162, Unknown=52, NotChecked=96, Total=2550 [2024-11-09 06:51:50,777 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 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) [2024-11-09 06:51:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:51:52,785 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2024-11-09 06:51:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:51:52,785 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 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 24 [2024-11-09 06:51:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:51:52,786 INFO L225 Difference]: With dead ends: 188 [2024-11-09 06:51:52,786 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 06:51:52,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=330, Invalid=2702, Unknown=52, NotChecked=108, Total=3192 [2024-11-09 06:51:52,788 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 420 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:51:52,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 650 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1578 Invalid, 0 Unknown, 178 Unchecked, 1.6s Time] [2024-11-09 06:51:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 06:51:52,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2024-11-09 06:51:52,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 142 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:51:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-11-09 06:51:52,793 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 24 [2024-11-09 06:51:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:51:52,793 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-11-09 06:51:52,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3666666666666667) internal successors, (71), 31 states have internal predecessors, (71), 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) [2024-11-09 06:51:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-11-09 06:51:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:51:52,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:51:52,794 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:51:52,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 06:51:52,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:51:52,998 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:51:52,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash -598231323, now seen corresponding path program 1 times [2024-11-09 06:51:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:51:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531746628] [2024-11-09 06:51:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:52,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:51:53,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:51:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531746628] [2024-11-09 06:51:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531746628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:51:53,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982347274] [2024-11-09 06:51:53,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:53,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:51:53,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:51:53,139 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:51:53,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:51:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:53,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 06:51:53,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:51:53,290 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 14 treesize of output 9 [2024-11-09 06:51:53,306 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 14 treesize of output 9 [2024-11-09 06:51:53,344 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:51:53,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:51:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:51:53,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:51:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 06:51:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982347274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:51:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [536315359] [2024-11-09 06:51:53,418 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 06:51:53,419 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:51:53,420 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:51:53,421 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:51:53,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:51:59,929 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 137 for LOIs [2024-11-09 06:52:00,009 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:52:42,537 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6388#(exists ((|v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| Int)) (and (<= 0 |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1|) (or (and (= (select |#valid| 0) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_215| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_185| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_215|) |v_ULTIMATE.start_main_~x~0#1.offset_185|) 0) (= 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_215|) |v_ULTIMATE.start_main_~x~0#1.offset_185|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_185|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_185|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_215|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_215|) 1))) (exists ((|v_ULTIMATE.start_main_#t~nondet7#1_13| Int) (|v_ULTIMATE.start_main_#t~short8#1_18| Bool)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))) (or (= |v_ULTIMATE.start_main_#t~nondet7#1_13| 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|)))) (<= 4 (select |#length| 0))) (and (= (select |#valid| 0) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_#t~nondet7#1_13| Int) (|v_ULTIMATE.start_main_#t~short8#1_18| Bool)) (and (or (and (or (not (= (select (select |#memory_$Pointer$.base| 0) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| 0) 0) 0))) |v_ULTIMATE.start_main_#t~short8#1_18|) (and (= (select (select |#memory_$Pointer$.offset| 0) 0) 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|) (= (select (select |#memory_$Pointer$.base| 0) 0) 0))) (or (= |v_ULTIMATE.start_main_#t~nondet7#1_13| 0) (not |v_ULTIMATE.start_main_#t~short8#1_18|)))) (= |v_ULTIMATE.start_main_~head~0#1.base_BEFORE_CALL_1| 0) (= |v_ULTIMATE.start_main_~head~0#1.offset_BEFORE_CALL_1| 0) (<= 4 (select |#length| 0)) (exists ((|v_#memory_$Pointer$.offset_214| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_215| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem4#1.offset_35| Int) (|v_ULTIMATE.start_main_#t~mem4#1.base_40| Int) (|v_#memory_$Pointer$.base_224| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_223| (Array Int (Array Int Int))) (|v_#memory_int_184| (Array Int (Array Int Int))) (|v_#memory_int_185| (Array Int (Array Int Int))) (|v_#memory_int_186| (Array Int (Array Int Int)))) (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (store (store (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) 0) (+ 8 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))))))) (<= (+ 12 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select |#length| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))))) (= (store |v_#memory_int_185| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (store (select |v_#memory_int_185| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_int_186| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))))) |v_#memory_int_186|) (= (store |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_main_#t~mem4#1.base_40| (store (select |v_#memory_$Pointer$.base_223| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4) (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) |v_#memory_$Pointer$.base_224|) (<= 0 (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)) (<= (+ 8 |v_ULTIMATE.start_main_#t~mem4#1.offset_35|) (select |#length| |v_ULTIMATE.start_main_#t~mem4#1.base_40|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (store (store (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) 0) (+ 8 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))))))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) 1) (= (select |#valid| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) 1) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) 1) (= |v_#memory_int_185| (store |v_#memory_int_184| |v_ULTIMATE.start_main_#t~mem4#1.base_40| (store (select |v_#memory_int_184| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4) (select (select |v_#memory_int_185| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))))) (= |#memory_int| (store |v_#memory_int_186| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (store (select |v_#memory_int_186| (select (select |v_#memory_$Pointer$.base_224| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (+ 8 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) 0))) (<= 0 (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (<= (+ (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) (= (store |v_#memory_$Pointer$.offset_214| |v_ULTIMATE.start_main_#t~mem4#1.base_40| (store (select |v_#memory_$Pointer$.offset_214| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4)))) |v_#memory_$Pointer$.offset_215|) (<= 0 (select (select |v_#memory_$Pointer$.offset_215| (select (select |v_#memory_$Pointer$.base_224| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))) (select (select |v_#memory_$Pointer$.offset_215| |v_ULTIMATE.start_main_#t~mem4#1.base_40|) (+ |v_ULTIMATE.start_main_#t~mem4#1.offset_35| 4))))))))))' at error location [2024-11-09 06:52:42,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 06:52:42,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:52:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 5 [2024-11-09 06:52:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951508884] [2024-11-09 06:52:42,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:52:42,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:52:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:52:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:52:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=450, Unknown=14, NotChecked=0, Total=552 [2024-11-09 06:52:42,539 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:52:42,698 INFO L93 Difference]: Finished difference Result 142 states and 163 transitions. [2024-11-09 06:52:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:52:42,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 06:52:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:52:42,699 INFO L225 Difference]: With dead ends: 142 [2024-11-09 06:52:42,699 INFO L226 Difference]: Without dead ends: 142 [2024-11-09 06:52:42,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=94, Invalid=492, Unknown=14, NotChecked=0, Total=600 [2024-11-09 06:52:42,700 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 186 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:52:42,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 53 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:52:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-09 06:52:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-09 06:52:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 136 states have internal predecessors, (157), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 158 transitions. [2024-11-09 06:52:42,705 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 158 transitions. Word has length 26 [2024-11-09 06:52:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:52:42,705 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 158 transitions. [2024-11-09 06:52:42,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:52:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 158 transitions. [2024-11-09 06:52:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:52:42,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:52:42,706 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:42,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 06:52:42,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-11-09 06:52:42,910 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:52:42,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:42,911 INFO L85 PathProgramCache]: Analyzing trace with hash -597150329, now seen corresponding path program 2 times [2024-11-09 06:52:42,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:52:42,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783730433] [2024-11-09 06:52:42,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:42,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:52:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:44,061 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:52:44,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783730433] [2024-11-09 06:52:44,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783730433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:52:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738953680] [2024-11-09 06:52:44,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:52:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:52:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:52:44,064 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:52:44,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:52:44,441 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 06:52:44,441 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:52:44,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 06:52:44,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:52:44,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:52:44,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 06:52:44,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 06:52:44,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:52:44,626 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 15 treesize of output 1 [2024-11-09 06:52:44,752 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:52:44,752 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 41 treesize of output 38 [2024-11-09 06:52:44,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:52:44,845 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 06:52:44,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 06:52:44,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:44,868 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 19 treesize of output 18 [2024-11-09 06:52:44,943 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 06:52:44,943 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-09 06:52:44,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-09 06:52:45,317 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2024-11-09 06:52:45,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 55 [2024-11-09 06:52:45,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:45,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2024-11-09 06:52:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:52:45,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:52:46,818 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8))) (and (forall ((v_ArrVal_1016 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_189| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|))) |v_ULTIMATE.start_main_~x~0#1.offset_189|) 0) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1014)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) |v_ULTIMATE.start_main_~x~0#1.offset_189|) (< |v_ULTIMATE.start_main_~x~0#1.offset_189| 1))))) (not (= v_ArrVal_1016 (store .cse3 .cse2 (select v_ArrVal_1016 .cse2)))))) (forall ((v_ArrVal_1016 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|))) 0) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1014)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) 0))) (not (= v_ArrVal_1016 (store .cse3 .cse2 (select v_ArrVal_1016 .cse2)))))) (forall ((v_ArrVal_1016 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1014)))) (or (= (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|)) 0) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (< (select (select .cse5 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) 0)))) (not (= v_ArrVal_1016 (store .cse3 .cse2 (select v_ArrVal_1016 .cse2)))))) (forall ((v_ArrVal_1016 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_189| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1014)))) (or (= (select (select .cse6 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|)) |v_ULTIMATE.start_main_~x~0#1.offset_189|) 0) (< (select (select .cse6 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) |v_ULTIMATE.start_main_~x~0#1.offset_189|) (< |v_ULTIMATE.start_main_~x~0#1.offset_189| 1)))))) (not (= v_ArrVal_1016 (store .cse3 .cse2 (select v_ArrVal_1016 .cse2)))))))) is different from false [2024-11-09 06:52:54,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1009 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1010))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse3 (+ .cse2 8))) (or (not (= v_ArrVal_1016 (store (store (select .cse0 .cse1) .cse2 0) .cse3 (select v_ArrVal_1016 .cse3)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (= (select (let ((.cse4 (store .cse0 .cse1 v_ArrVal_1016))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|))) 0) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (< (select (select (store .cse5 .cse1 (store (store (select .cse5 .cse1) .cse2 0) .cse3 v_ArrVal_1014)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) 0))))))) (< .cse2 0))))) (forall ((v_ArrVal_1009 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< .cse7 0) (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1010))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse10 (+ .cse7 8))) (or (not (= v_ArrVal_1016 (store (store (select .cse8 .cse9) .cse7 0) .cse10 (select v_ArrVal_1016 .cse10)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_189| Int)) (let ((.cse11 (store .cse12 .cse9 (store (store (select .cse12 .cse9) .cse7 0) .cse10 v_ArrVal_1014)))) (or (< (select (select .cse11 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) |v_ULTIMATE.start_main_~x~0#1.offset_189|) (< |v_ULTIMATE.start_main_~x~0#1.offset_189| 1) (= (select (select .cse11 (select (select (store .cse8 .cse9 v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|)) |v_ULTIMATE.start_main_~x~0#1.offset_189|) 0)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|))))))))))) (forall ((v_ArrVal_1009 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1010))) (let ((.cse16 (+ .cse15 8)) (.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_ArrVal_1016 (store (store (select .cse13 .cse14) .cse15 0) .cse16 (select v_ArrVal_1016 .cse16)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_189| Int)) (or (< (select (select (store .cse17 .cse14 (store (store (select .cse17 .cse14) .cse15 0) .cse16 v_ArrVal_1014)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) |v_ULTIMATE.start_main_~x~0#1.offset_189|) (= (select (let ((.cse18 (store .cse13 .cse14 v_ArrVal_1016))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|))) |v_ULTIMATE.start_main_~x~0#1.offset_189|) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_189| 1))) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|))))))) (< .cse15 0))))) (forall ((v_ArrVal_1009 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1009))) (let ((.cse19 (select (select .cse24 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< .cse19 0) (forall ((v_ArrVal_1016 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1010))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse22 (+ .cse19 8))) (or (not (= v_ArrVal_1016 (store (store (select .cse20 .cse21) .cse19 0) .cse22 (select v_ArrVal_1016 .cse22)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_190| Int) (v_ArrVal_1014 Int)) (let ((.cse23 (store .cse24 .cse21 (store (store (select .cse24 .cse21) .cse19 0) .cse22 v_ArrVal_1014)))) (or (= (select (select .cse23 (select (select (store .cse20 .cse21 v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|)) 0) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_190| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_190|) (< (select (select .cse23 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_190|) 0)))))))))))))) is different from false [2024-11-09 06:52:54,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:54,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 154 [2024-11-09 06:52:54,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:54,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 149 [2024-11-09 06:52:55,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:55,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 3885 treesize of output 3605 [2024-11-09 06:52:55,267 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:52:55,627 INFO L349 Elim1Store]: treesize reduction 137, result has 51.2 percent of original size [2024-11-09 06:52:55,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 1576 treesize of output 1552 [2024-11-09 06:52:55,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:52:55,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:55,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1229 treesize of output 1165 [2024-11-09 06:52:56,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:56,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 823 treesize of output 733 [2024-11-09 06:52:57,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:52:57,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:53:15,117 INFO L349 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2024-11-09 06:53:15,118 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 647 treesize of output 646 [2024-11-09 06:53:19,713 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 89 treesize of output 85 [2024-11-09 06:53:21,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 06:53:21,101 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:21,145 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:21,211 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 92 treesize of output 88 [2024-11-09 06:53:21,241 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 [2024-11-09 06:53:21,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,316 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,329 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:21,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,365 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:21,389 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:21,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,466 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 32 treesize of output 28 [2024-11-09 06:53:21,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:21,497 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-09 06:53:24,124 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 144 treesize of output 140 [2024-11-09 06:53:24,807 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 144 treesize of output 140 [2024-11-09 06:53:25,392 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:53:25,393 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 278 treesize of output 295 [2024-11-09 06:53:25,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:53:25,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:53:25,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:25,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:25,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 06:53:27,683 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 170 treesize of output 166 [2024-11-09 06:53:28,836 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:53:28,836 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 167 [2024-11-09 06:53:28,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:53:28,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:53:31,748 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 182 treesize of output 178 [2024-11-09 06:53:33,613 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:53:33,614 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 355 treesize of output 370 [2024-11-09 06:53:33,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:53:33,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:53:33,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 36 [2024-11-09 06:53:33,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:53:33,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:53:35,846 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 171 treesize of output 167 [2024-11-09 06:53:37,728 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 135 treesize of output 131 [2024-11-09 06:53:40,743 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 147 treesize of output 143 [2024-11-09 06:53:41,564 INFO L349 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2024-11-09 06:53:41,564 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 430 treesize of output 427 [2024-11-09 06:53:44,338 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 209 treesize of output 205 [2024-11-09 06:54:00,818 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 204 treesize of output 200 [2024-11-09 06:54:01,717 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 208 treesize of output 204 [2024-11-09 06:54:04,369 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:54:04,369 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 578 treesize of output 591 [2024-11-09 06:54:04,532 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:54:04,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:54:04,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 06:54:04,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:54:04,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:54:08,097 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 204 treesize of output 200 [2024-11-09 06:54:08,981 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 208 treesize of output 204 [2024-11-09 06:54:12,576 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 243 treesize of output 239 [2024-11-09 06:54:14,469 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 250 treesize of output 246 [2024-11-09 06:55:03,379 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:55:03,379 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 259 [2024-11-09 06:55:03,486 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:03,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:55:04,812 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:55:04,813 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 284 treesize of output 301 [2024-11-09 06:55:04,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:04,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:55:06,696 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 35 treesize of output 31 [2024-11-09 06:55:06,792 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 166 treesize of output 160 [2024-11-09 06:55:09,229 INFO L349 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2024-11-09 06:55:09,230 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 422 [2024-11-09 06:55:14,745 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:55:14,746 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 296 treesize of output 299 [2024-11-09 06:55:14,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:14,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:55:14,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:14,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:14,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2024-11-09 06:55:16,195 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 134 treesize of output 130 [2024-11-09 06:55:16,681 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 161 treesize of output 157 [2024-11-09 06:55:19,604 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 474 treesize of output 460 [2024-11-09 06:55:21,253 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 19 treesize of output 15 [2024-11-09 06:55:21,413 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 35 treesize of output 31 [2024-11-09 06:55:21,672 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 35 treesize of output 31 [2024-11-09 06:55:21,812 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 427 treesize of output 421 [2024-11-09 06:55:27,849 INFO L349 Elim1Store]: treesize reduction 50, result has 26.5 percent of original size [2024-11-09 06:55:27,849 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 924 treesize of output 911 [2024-11-09 06:55:31,186 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 67 treesize of output 63 [2024-11-09 06:55:32,243 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 42 treesize of output 38 [2024-11-09 06:55:39,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:39,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 06:55:39,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:39,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2024-11-09 06:55:40,192 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:40,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:40,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:40,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:40,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:40,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:40,969 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:40,998 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:40,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:41,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:41,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:41,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:41,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:42,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:42,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:43,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:43,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:43,512 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:43,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:43,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:43,829 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:55:43,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:43,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:44,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:44,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:44,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:44,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-09 06:55:53,205 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 517 treesize of output 513 [2024-11-09 06:55:55,260 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 199 treesize of output 195 [2024-11-09 06:55:56,215 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 131 treesize of output 127 [2024-11-09 06:55:59,241 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-09 06:55:59,242 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 1113 treesize of output 1116 [2024-11-09 06:55:59,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:55:59,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-09 06:57:25,134 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-09 06:57:25,134 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-09 06:57:25,135 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2024-11-09 06:57:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [692774637] [2024-11-09 06:57:25,137 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 06:57:25,137 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:57:25,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:57:25,137 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:57:25,138 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:57:25,142 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:132) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.checkSatTerm(SmtUtils.java:326) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.isFalse(SymbolicTools.java:220) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.RelationCheckUtil.isEqBottom_SolverAlphaSolver(RelationCheckUtil.java:56) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.ExplicitValueDomain.isEqBottom(ExplicitValueDomain.java:73) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.CompoundDomain.isEqBottom(CompoundDomain.java:84) at de.uni_freiburg.informatik.ultimate.lib.sifa.domain.StatsWrapperDomain.isEqBottom(StatsWrapperDomain.java:69) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.earlyExitAfterStep(DagInterpreter.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:125) 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:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 44 more [2024-11-09 06:57:25,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:57:25,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-09 06:57:25,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38331860] [2024-11-09 06:57:25,145 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 06:57:25,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 06:57:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:57:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 06:57:25,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1262, Unknown=23, NotChecked=146, Total=1560 [2024-11-09 06:57:25,146 INFO L87 Difference]: Start difference. First operand 138 states and 158 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 16 states have internal predecessors, (26), 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) [2024-11-09 06:57:25,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=129, Invalid=1262, Unknown=23, NotChecked=146, Total=1560 [2024-11-09 06:57:25,148 INFO L432 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:25,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:57:25,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 06:57:25,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 06:57:25,349 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) Caused by: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-09 06:57:25,356 INFO L158 Benchmark]: Toolchain (without parser) took 713101.07ms. Allocated memory was 161.5MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 116.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 284.6MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,357 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 104.9MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:57:25,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 621.32ms. Allocated memory is still 161.5MB. Free memory was 116.2MB in the beginning and 95.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.96ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,358 INFO L158 Benchmark]: Boogie Preprocessor took 47.68ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,358 INFO L158 Benchmark]: RCFGBuilder took 934.18ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 91.5MB in the beginning and 180.3MB in the end (delta: -88.8MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,358 INFO L158 Benchmark]: TraceAbstraction took 711439.07ms. Allocated memory was 220.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 180.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 286.8MB. Max. memory is 16.1GB. [2024-11-09 06:57:25,363 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.65ms. Allocated memory is still 104.9MB. Free memory is still 54.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 621.32ms. Allocated memory is still 161.5MB. Free memory was 116.2MB in the beginning and 95.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.96ms. Allocated memory is still 161.5MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.68ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 91.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 934.18ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 91.5MB in the beginning and 180.3MB in the end (delta: -88.8MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * TraceAbstraction took 711439.07ms. Allocated memory was 220.2MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 180.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 286.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:57:27,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:57:27,942 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 06:57:27,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:57:27,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:57:27,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:57:27,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:57:27,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:57:27,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:57:27,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:57:27,992 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:57:27,992 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:57:27,992 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:57:27,993 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:57:27,993 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:57:27,995 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:57:27,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:57:27,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:57:27,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:57:27,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:57:27,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:57:28,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:57:28,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:57:28,002 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:57:28,002 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:57:28,002 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:57:28,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:57:28,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:57:28,004 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:57:28,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:57:28,005 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:57:28,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:57:28,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:57:28,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:57:28,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:57:28,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:57:28,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:57:28,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:57:28,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:28,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:57:28,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:57:28,008 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:57:28,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:57:28,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:57:28,016 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:57:28,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/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_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2024-11-09 06:57:28,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:57:28,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:57:28,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:57:28,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:57:28,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:57:28,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-reverse.i Unable to find full path for "g++" [2024-11-09 06:57:30,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:57:31,069 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:57:31,073 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/sv-benchmarks/c/forester-heap/dll-reverse.i [2024-11-09 06:57:31,087 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/711b42596/49fbb0010e464d70afd67964933a9698/FLAG99ad54909 [2024-11-09 06:57:31,105 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/data/711b42596/49fbb0010e464d70afd67964933a9698 [2024-11-09 06:57:31,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:57:31,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:57:31,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:31,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:57:31,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:57:31,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574395ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31, skipping insertion in model container [2024-11-09 06:57:31,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:57:31,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:31,652 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:57:31,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:57:31,798 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:57:31,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31 WrapperNode [2024-11-09 06:57:31,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:57:31,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:31,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:57:31,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:57:31,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,895 INFO L138 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 137 [2024-11-09 06:57:31,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:57:31,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:57:31,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:57:31,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:57:31,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:31,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:57:31,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:57:31,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:57:31,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:57:31,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (1/1) ... [2024-11-09 06:57:32,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:57:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:57:32,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:57:32,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:57:32,077 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:57:32,078 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:57:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:57:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:57:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:57:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:57:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:57:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:57:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:57:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:57:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:57:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:57:32,265 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:57:32,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:57:33,315 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-09 06:57:33,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:57:33,343 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:57:33,344 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 06:57:33,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:33 BoogieIcfgContainer [2024-11-09 06:57:33,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:57:33,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:57:33,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:57:33,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:57:33,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:57:31" (1/3) ... [2024-11-09 06:57:33,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff61bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:33, skipping insertion in model container [2024-11-09 06:57:33,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:57:31" (2/3) ... [2024-11-09 06:57:33,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff61bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:57:33, skipping insertion in model container [2024-11-09 06:57:33,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:57:33" (3/3) ... [2024-11-09 06:57:33,354 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2024-11-09 06:57:33,371 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:57:33,372 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-11-09 06:57:33,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:57:33,430 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@482300d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:57:33,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-11-09 06:57:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 84 states have (on average 2.0833333333333335) internal successors, (175), 151 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 06:57:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:57:33,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:33,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:57:33,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:33,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:33,447 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2024-11-09 06:57:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:33,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150073819] [2024-11-09 06:57:33,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:33,462 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:33,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 06:57:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:33,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:57:33,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:33,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:33,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:33,668 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150073819] [2024-11-09 06:57:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150073819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:33,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:57:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793527308] [2024-11-09 06:57:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:33,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:57:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:57:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:57:33,718 INFO L87 Difference]: Start difference. First operand has 156 states, 84 states have (on average 2.0833333333333335) internal successors, (175), 151 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:57:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:34,140 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2024-11-09 06:57:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:57:34,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 06:57:34,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:34,159 INFO L225 Difference]: With dead ends: 148 [2024-11-09 06:57:34,159 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 06:57:34,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:57:34,170 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 80 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:34,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 156 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:57:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 06:57:34,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-09 06:57:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 79 states have (on average 1.9746835443037976) internal successors, (156), 144 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2024-11-09 06:57:34,225 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 3 [2024-11-09 06:57:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:34,225 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2024-11-09 06:57:34,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:57:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2024-11-09 06:57:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:57:34,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:34,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:57:34,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 06:57:34,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:34,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:34,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2024-11-09 06:57:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722541159] [2024-11-09 06:57:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:34,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:34,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:34,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:34,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 06:57:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:34,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:57:34,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:34,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:34,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:34,548 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:34,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722541159] [2024-11-09 06:57:34,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722541159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:34,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:34,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:57:34,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105893812] [2024-11-09 06:57:34,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:34,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:57:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:57:34,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:57:34,553 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:57:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:35,005 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-09 06:57:35,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:57:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-09 06:57:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:35,008 INFO L225 Difference]: With dead ends: 143 [2024-11-09 06:57:35,008 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 06:57:35,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:57:35,013 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 80 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:35,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 152 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:57:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 06:57:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-09 06:57:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 141 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-09 06:57:35,040 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 3 [2024-11-09 06:57:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:35,040 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-09 06:57:35,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2024-11-09 06:57:35,041 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-09 06:57:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:57:35,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:35,041 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:35,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 06:57:35,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:35,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 919163538, now seen corresponding path program 1 times [2024-11-09 06:57:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545533775] [2024-11-09 06:57:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:35,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:35,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:35,251 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:35,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:57:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:35,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:57:35,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:35,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:35,467 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 06:57:35,468 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 14 treesize of output 20 [2024-11-09 06:57:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:35,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:35,493 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545533775] [2024-11-09 06:57:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545533775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:35,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:35,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:57:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831203680] [2024-11-09 06:57:35,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:35,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:35,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:35,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:35,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:35,497 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-09 06:57:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:36,127 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2024-11-09 06:57:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) Word has length 9 [2024-11-09 06:57:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:36,131 INFO L225 Difference]: With dead ends: 131 [2024-11-09 06:57:36,131 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 06:57:36,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:36,135 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 118 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:36,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:57:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 06:57:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-09 06:57:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 84 states have (on average 1.7380952380952381) internal successors, (146), 129 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:36,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2024-11-09 06:57:36,156 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 9 [2024-11-09 06:57:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2024-11-09 06:57:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-09 06:57:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2024-11-09 06:57:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 06:57:36,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:36,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:36,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 06:57:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:36,360 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:36,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:36,361 INFO L85 PathProgramCache]: Analyzing trace with hash 919163539, now seen corresponding path program 1 times [2024-11-09 06:57:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:36,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739874210] [2024-11-09 06:57:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:36,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:36,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:36,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:36,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 06:57:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:36,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:57:36,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:36,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:36,621 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 06:57:36,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 06:57:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:36,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:36,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:36,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739874210] [2024-11-09 06:57:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739874210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:57:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086785588] [2024-11-09 06:57:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:36,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:36,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:36,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:36,653 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-09 06:57:37,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:37,447 INFO L93 Difference]: Finished difference Result 168 states and 190 transitions. [2024-11-09 06:57:37,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:37,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) Word has length 9 [2024-11-09 06:57:37,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:37,449 INFO L225 Difference]: With dead ends: 168 [2024-11-09 06:57:37,450 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 06:57:37,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:37,452 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 137 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:37,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 152 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:57:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 06:57:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2024-11-09 06:57:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.6194690265486726) internal successors, (183), 158 states have internal predecessors, (183), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2024-11-09 06:57:37,475 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 9 [2024-11-09 06:57:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:37,475 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2024-11-09 06:57:37,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-09 06:57:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2024-11-09 06:57:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:57:37,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:37,476 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:37,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 06:57:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:37,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514731, now seen corresponding path program 1 times [2024-11-09 06:57:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834040674] [2024-11-09 06:57:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:37,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:37,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 06:57:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:37,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:57:37,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:37,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:37,807 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 15 treesize of output 1 [2024-11-09 06:57:37,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:57:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:37,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:37,857 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:37,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834040674] [2024-11-09 06:57:37,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834040674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:37,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:37,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814902232] [2024-11-09 06:57:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:37,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:57:37,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:57:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:37,865 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 06:57:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:38,546 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2024-11-09 06:57:38,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:38,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) Word has length 12 [2024-11-09 06:57:38,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:38,549 INFO L225 Difference]: With dead ends: 159 [2024-11-09 06:57:38,549 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 06:57:38,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:38,554 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:38,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 337 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:57:38,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 06:57:38,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 06:57:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 113 states have (on average 1.6017699115044248) internal successors, (181), 157 states have internal predecessors, (181), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2024-11-09 06:57:38,563 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 12 [2024-11-09 06:57:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:38,563 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2024-11-09 06:57:38,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 06:57:38,563 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2024-11-09 06:57:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 06:57:38,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:38,564 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:38,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 06:57:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:38,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:38,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:38,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1910514730, now seen corresponding path program 1 times [2024-11-09 06:57:38,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164433781] [2024-11-09 06:57:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:38,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:38,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:38,770 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:38,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 06:57:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:38,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:57:38,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:38,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:38,954 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 15 treesize of output 1 [2024-11-09 06:57:39,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:57:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:39,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:39,050 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164433781] [2024-11-09 06:57:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164433781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268113864] [2024-11-09 06:57:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:57:39,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:39,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:57:39,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:39,053 INFO L87 Difference]: Start difference. First operand 159 states and 184 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 06:57:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:39,814 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2024-11-09 06:57:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) Word has length 12 [2024-11-09 06:57:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:39,815 INFO L225 Difference]: With dead ends: 158 [2024-11-09 06:57:39,816 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 06:57:39,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:39,817 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 2 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:39,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:57:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 06:57:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 06:57:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.584070796460177) internal successors, (179), 156 states have internal predecessors, (179), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 182 transitions. [2024-11-09 06:57:39,833 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 182 transitions. Word has length 12 [2024-11-09 06:57:39,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:39,833 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 182 transitions. [2024-11-09 06:57:39,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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) [2024-11-09 06:57:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2024-11-09 06:57:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 06:57:39,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:39,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:39,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 06:57:40,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:40,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:40,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1973403967, now seen corresponding path program 1 times [2024-11-09 06:57:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:40,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077802006] [2024-11-09 06:57:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:40,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:40,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:40,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:40,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 06:57:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:40,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:57:40,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:40,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:40,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077802006] [2024-11-09 06:57:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077802006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:40,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929151217] [2024-11-09 06:57:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:57:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:57:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:57:40,176 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:40,632 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2024-11-09 06:57:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 06:57:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:40,633 INFO L225 Difference]: With dead ends: 162 [2024-11-09 06:57:40,633 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 06:57:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:40,634 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 125 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:40,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 212 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 06:57:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 06:57:40,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2024-11-09 06:57:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5486725663716814) internal successors, (175), 156 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2024-11-09 06:57:40,642 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 17 [2024-11-09 06:57:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:40,642 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2024-11-09 06:57:40,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2024-11-09 06:57:40,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:57:40,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:40,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:40,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 06:57:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:40,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547560, now seen corresponding path program 1 times [2024-11-09 06:57:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546331116] [2024-11-09 06:57:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:40,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:40,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:40,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 06:57:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:40,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:57:40,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:41,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:41,062 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:57:41,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:57:41,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:41,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:41,146 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 15 treesize of output 1 [2024-11-09 06:57:41,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:41,300 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 50 treesize of output 45 [2024-11-09 06:57:41,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:57:41,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:57:41,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:57:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:41,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:41,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546331116] [2024-11-09 06:57:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546331116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:41,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:57:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469767182] [2024-11-09 06:57:41,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:57:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:57:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:57:41,455 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-09 06:57:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:43,420 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2024-11-09 06:57:43,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:57:43,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-09 06:57:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:43,421 INFO L225 Difference]: With dead ends: 154 [2024-11-09 06:57:43,421 INFO L226 Difference]: Without dead ends: 154 [2024-11-09 06:57:43,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-09 06:57:43,422 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 117 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:43,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 327 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 06:57:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-09 06:57:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2024-11-09 06:57:43,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.5333333333333334) internal successors, (161), 143 states have internal predecessors, (161), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 164 transitions. [2024-11-09 06:57:43,428 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 164 transitions. Word has length 16 [2024-11-09 06:57:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 164 transitions. [2024-11-09 06:57:43,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-09 06:57:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 164 transitions. [2024-11-09 06:57:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 06:57:43,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:43,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:43,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 06:57:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:43,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2139547561, now seen corresponding path program 1 times [2024-11-09 06:57:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419953278] [2024-11-09 06:57:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:43,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:43,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:43,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 06:57:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:43,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:57:43,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:43,814 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 06:57:43,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-09 06:57:43,955 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 06:57:43,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-09 06:57:44,055 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 15 treesize of output 1 [2024-11-09 06:57:44,237 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:44,237 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 52 treesize of output 49 [2024-11-09 06:57:44,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-11-09 06:57:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:44,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:44,526 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419953278] [2024-11-09 06:57:44,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419953278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:44,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:44,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:57:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451235792] [2024-11-09 06:57:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:57:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:57:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:57:44,528 INFO L87 Difference]: Start difference. First operand 145 states and 164 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-09 06:57:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:46,129 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2024-11-09 06:57:46,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:57:46,130 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2024-11-09 06:57:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:46,131 INFO L225 Difference]: With dead ends: 158 [2024-11-09 06:57:46,131 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 06:57:46,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:57:46,133 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 255 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:46,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 243 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 06:57:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 06:57:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 142. [2024-11-09 06:57:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.5047619047619047) internal successors, (158), 140 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 159 transitions. [2024-11-09 06:57:46,141 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 159 transitions. Word has length 16 [2024-11-09 06:57:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:46,142 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 159 transitions. [2024-11-09 06:57:46,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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) [2024-11-09 06:57:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 159 transitions. [2024-11-09 06:57:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 06:57:46,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:46,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:46,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 06:57:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:46,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:46,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1079315007, now seen corresponding path program 1 times [2024-11-09 06:57:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679573057] [2024-11-09 06:57:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:46,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:46,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:46,360 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:46,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 06:57:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:46,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 06:57:46,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:46,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:46,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:46,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:46,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:46,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:46,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:57:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:46,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:46,722 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679573057] [2024-11-09 06:57:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679573057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:46,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 06:57:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006735887] [2024-11-09 06:57:46,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:46,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:57:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:46,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:57:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:57:46,725 INFO L87 Difference]: Start difference. First operand 142 states and 159 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-09 06:57:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:47,435 INFO L93 Difference]: Finished difference Result 162 states and 181 transitions. [2024-11-09 06:57:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 06:57:47,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2024-11-09 06:57:47,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:47,437 INFO L225 Difference]: With dead ends: 162 [2024-11-09 06:57:47,437 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 06:57:47,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:57:47,438 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 101 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:47,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 467 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:57:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 06:57:47,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2024-11-09 06:57:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 148 states have internal predecessors, (167), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 168 transitions. [2024-11-09 06:57:47,443 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 168 transitions. Word has length 18 [2024-11-09 06:57:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:47,443 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 168 transitions. [2024-11-09 06:57:47,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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) [2024-11-09 06:57:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 168 transitions. [2024-11-09 06:57:47,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:57:47,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:47,444 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:47,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 06:57:47,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:47,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:47,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash -135639586, now seen corresponding path program 1 times [2024-11-09 06:57:47,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512784516] [2024-11-09 06:57:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:47,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:47,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:47,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 06:57:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:47,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:57:47,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:47,776 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 8 treesize of output 1 [2024-11-09 06:57:47,783 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 8 treesize of output 1 [2024-11-09 06:57:47,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 06:57:47,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 06:57:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:47,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:47,964 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512784516] [2024-11-09 06:57:47,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512784516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:47,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:47,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:57:47,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171311769] [2024-11-09 06:57:47,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:47,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:57:47,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:57:47,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:47,967 INFO L87 Difference]: Start difference. First operand 150 states and 168 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 06:57:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:48,768 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2024-11-09 06:57:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:57:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-11-09 06:57:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:48,769 INFO L225 Difference]: With dead ends: 163 [2024-11-09 06:57:48,769 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 06:57:48,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:57:48,770 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 6 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:48,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 362 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 06:57:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 06:57:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-09 06:57:48,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 123 states have (on average 1.4552845528455285) internal successors, (179), 158 states have internal predecessors, (179), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2024-11-09 06:57:48,777 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 20 [2024-11-09 06:57:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:48,777 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2024-11-09 06:57:48,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 06:57:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2024-11-09 06:57:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:57:48,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:48,778 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:48,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 06:57:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:48,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:48,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1522568374, now seen corresponding path program 1 times [2024-11-09 06:57:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:48,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714595237] [2024-11-09 06:57:48,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:48,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:48,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:48,981 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:48,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 06:57:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:49,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:57:49,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:49,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:49,129 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 15 treesize of output 1 [2024-11-09 06:57:49,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 06:57:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:49,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:49,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714595237] [2024-11-09 06:57:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714595237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:49,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043696740] [2024-11-09 06:57:49,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:57:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:49,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:57:49,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:49,163 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-09 06:57:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:49,738 INFO L93 Difference]: Finished difference Result 159 states and 178 transitions. [2024-11-09 06:57:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:57:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:49,739 INFO L225 Difference]: With dead ends: 159 [2024-11-09 06:57:49,740 INFO L226 Difference]: Without dead ends: 159 [2024-11-09 06:57:49,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:49,740 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:49,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 302 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:57:49,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-09 06:57:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-09 06:57:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 157 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 178 transitions. [2024-11-09 06:57:49,745 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 178 transitions. Word has length 22 [2024-11-09 06:57:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:49,746 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 178 transitions. [2024-11-09 06:57:49,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-09 06:57:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 178 transitions. [2024-11-09 06:57:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 06:57:49,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:49,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:49,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 06:57:49,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:49,947 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:49,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1522568373, now seen corresponding path program 1 times [2024-11-09 06:57:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:49,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351748699] [2024-11-09 06:57:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:49,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:49,949 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:49,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 06:57:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:50,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 06:57:50,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:50,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:50,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:50,120 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 15 treesize of output 1 [2024-11-09 06:57:50,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 06:57:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:50,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:50,176 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:50,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351748699] [2024-11-09 06:57:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351748699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:57:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090858416] [2024-11-09 06:57:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:50,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:57:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:57:50,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:57:50,179 INFO L87 Difference]: Start difference. First operand 159 states and 178 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-09 06:57:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:50,872 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2024-11-09 06:57:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:57:50,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 06:57:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:50,874 INFO L225 Difference]: With dead ends: 158 [2024-11-09 06:57:50,874 INFO L226 Difference]: Without dead ends: 158 [2024-11-09 06:57:50,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:57:50,874 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:50,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 292 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 06:57:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-09 06:57:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-09 06:57:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 156 states have internal predecessors, (175), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2024-11-09 06:57:50,879 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 22 [2024-11-09 06:57:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:50,880 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2024-11-09 06:57:50,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2024-11-09 06:57:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2024-11-09 06:57:50,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:57:50,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:50,881 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:50,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 06:57:51,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:51,082 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:51,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1183978700, now seen corresponding path program 1 times [2024-11-09 06:57:51,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:51,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528715169] [2024-11-09 06:57:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:51,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:51,087 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:51,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 06:57:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:51,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 06:57:51,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:51,271 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 06:57:51,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-09 06:57:51,494 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 06:57:51,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-09 06:57:51,561 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 15 treesize of output 1 [2024-11-09 06:57:51,733 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:51,733 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 52 treesize of output 49 [2024-11-09 06:57:51,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-11-09 06:57:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:51,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:51,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:51,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528715169] [2024-11-09 06:57:51,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528715169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:51,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:51,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:57:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055009601] [2024-11-09 06:57:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:51,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:57:51,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:57:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:57:51,980 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-09 06:57:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:53,579 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2024-11-09 06:57:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:57:53,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2024-11-09 06:57:53,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:53,581 INFO L225 Difference]: With dead ends: 157 [2024-11-09 06:57:53,581 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 06:57:53,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:57:53,582 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 219 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:53,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 273 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 06:57:53,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 06:57:53,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-11-09 06:57:53,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 123 states have (on average 1.4146341463414633) internal successors, (174), 155 states have internal predecessors, (174), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2024-11-09 06:57:53,587 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 26 [2024-11-09 06:57:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:53,588 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2024-11-09 06:57:53,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-09 06:57:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2024-11-09 06:57:53,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 06:57:53,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:53,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:53,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 06:57:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:53,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:53,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1183978701, now seen corresponding path program 1 times [2024-11-09 06:57:53,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:53,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095806642] [2024-11-09 06:57:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:53,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:53,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:53,792 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:53,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 06:57:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:53,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:57:53,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:53,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:54,012 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:57:54,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:57:54,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:57:54,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:57:54,067 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 15 treesize of output 1 [2024-11-09 06:57:54,176 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:54,177 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 50 treesize of output 45 [2024-11-09 06:57:54,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:57:54,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:57:54,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:57:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:54,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:57:54,266 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:57:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095806642] [2024-11-09 06:57:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095806642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:57:54,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:57:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:57:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318579863] [2024-11-09 06:57:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:57:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 06:57:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:57:54,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 06:57:54,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:57:54,268 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-09 06:57:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:57:55,386 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2024-11-09 06:57:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:57:55,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2024-11-09 06:57:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:57:55,388 INFO L225 Difference]: With dead ends: 155 [2024-11-09 06:57:55,388 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 06:57:55,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-09 06:57:55,389 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 87 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:57:55,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 264 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 06:57:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 06:57:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-09 06:57:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 153 states have internal predecessors, (172), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:57:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2024-11-09 06:57:55,393 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 26 [2024-11-09 06:57:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:57:55,394 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2024-11-09 06:57:55,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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) [2024-11-09 06:57:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2024-11-09 06:57:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:57:55,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:57:55,395 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:57:55,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 06:57:55,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:55,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:57:55,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:57:55,596 INFO L85 PathProgramCache]: Analyzing trace with hash -405293199, now seen corresponding path program 1 times [2024-11-09 06:57:55,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:57:55,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89142189] [2024-11-09 06:57:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:57:55,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:57:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:57:55,598 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:57:55,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 06:57:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:57:55,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:57:55,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:57:55,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:57:55,848 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:57:55,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 06:57:55,899 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 15 treesize of output 1 [2024-11-09 06:57:56,035 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:56,036 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 36 treesize of output 35 [2024-11-09 06:57:56,175 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:57:56,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 06:57:56,210 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:57:56,211 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 36 treesize of output 35 [2024-11-09 06:57:56,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 06:57:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:57:56,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:57:56,547 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:57:56,619 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_499) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:57:56,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:57:56,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_497 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_497))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:57:56,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:56,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:57:56,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:56,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 139 [2024-11-09 06:57:56,701 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 88 treesize of output 84 [2024-11-09 06:57:56,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:57:56,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2024-11-09 06:58:00,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse16 (store |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base| (_ bv1 1)))) (let ((.cse20 (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 v_arrayElimCell_43))))) (.cse17 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 v_arrayElimCell_46))))) (.cse8 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)))) (.cse2 (not .cse7)) (.cse22 (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| (_ bv1 1)))) (let ((.cse1 (forall ((v_arrayElimCell_46 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse22 v_arrayElimCell_46))))) (.cse5 (or .cse2 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse22 v_arrayElimCell_47)))))) (.cse10 (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ BitVec 32))) (let ((.cse23 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|))) (forall ((v_arrayElimCell_45 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse23 v_arrayElimCell_45) (_ bv1 1)))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse23 v_arrayElimCell_43)))))))) (.cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)))) (.cse4 (forall ((v_arrayElimCell_45 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse22 v_arrayElimCell_45))))) (.cse9 (or .cse20 .cse17 .cse8)) (.cse11 (forall ((v_arrayElimCell_46 (_ BitVec 32)) (v_arrayElimCell_43 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ BitVec 32))) (let ((.cse21 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ bv1 1)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse21 v_arrayElimCell_43))) (= (_ bv0 1) (bvadd (select .cse21 v_arrayElimCell_46) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|))) (forall ((v_arrayElimCell_45 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse21 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse12 (or .cse20 (forall ((v_arrayElimCell_47 (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~head~0#1.base| v_arrayElimCell_47) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 v_arrayElimCell_47))))) .cse8)) (.cse13 (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ bv1 1)) v_arrayElimCell_43))))))) (.cse14 (forall ((v_arrayElimCell_43 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ BitVec 32))) (let ((.cse19 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ bv1 1)))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse19 v_arrayElimCell_43))) (forall ((v_arrayElimCell_47 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse19 v_arrayElimCell_47)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|))) (forall ((v_arrayElimCell_45 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select .cse19 v_arrayElimCell_45) (_ bv1 1)))))))) (.cse15 (forall ((v_arrayElimCell_45 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ BitVec 32))) (let ((.cse18 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| (_ bv1 1)))) (or (= (_ bv0 1) (bvadd (select .cse18 v_arrayElimCell_45) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|))) (forall ((v_arrayElimCell_43 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse18 v_arrayElimCell_43)))))))) (.cse3 (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (forall ((v_arrayElimCell_45 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 v_arrayElimCell_45)))))) (and (or .cse0 (and (or .cse1 .cse2 .cse3) .cse4 .cse5)) (or .cse6 .cse7 .cse8) (or .cse3 (and .cse9 .cse10 .cse11 (or .cse0 (and (or .cse1 .cse2) .cse4 .cse5)) .cse12 .cse13 .cse14 .cse15)) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse16 |c_ULTIMATE.start_main_~head~0#1.base|))) .cse6 .cse8) (or (and .cse10 (or .cse0 .cse4) (or (and .cse9 .cse11) .cse3) .cse12 .cse13 .cse14 .cse15) .cse7) (or .cse17 .cse6 .cse8 .cse3) (or .cse6 .cse8))))) is different from false [2024-11-09 06:58:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 06:58:03,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89142189] [2024-11-09 06:58:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89142189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [819098200] [2024-11-09 06:58:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:03,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:58:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:58:03,391 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:58:03,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-09 06:58:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:03,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 06:58:03,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:03,715 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 06:58:03,715 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 14 treesize of output 20 [2024-11-09 06:58:03,942 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 06:58:03,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-09 06:58:04,089 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 15 treesize of output 1 [2024-11-09 06:58:04,369 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:04,370 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 44 treesize of output 41 [2024-11-09 06:58:04,663 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:04,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 06:58:04,699 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:04,699 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 44 treesize of output 41 [2024-11-09 06:58:05,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 06:58:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:05,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:05,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:05,273 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_550))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:05,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_550 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_550))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_499)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2024-11-09 06:58:05,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:05,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:58:05,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:05,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 139 [2024-11-09 06:58:05,330 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 88 treesize of output 84 [2024-11-09 06:58:05,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:05,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 82 [2024-11-09 06:58:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:16,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [819098200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43458817] [2024-11-09 06:58:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:16,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:16,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:16,928 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:16,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 06:58:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:17,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:58:17,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:17,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:58:17,145 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:58:17,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 06:58:17,184 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 15 treesize of output 1 [2024-11-09 06:58:17,255 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:17,256 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 36 treesize of output 35 [2024-11-09 06:58:17,332 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:17,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 06:58:17,362 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:17,363 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 36 treesize of output 35 [2024-11-09 06:58:17,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 06:58:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:17,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:17,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:17,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:17,656 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_603))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_605)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:17,667 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_603))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_605)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:17,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:58:17,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:17,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 139 [2024-11-09 06:58:17,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:17,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2024-11-09 06:58:17,734 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 78 treesize of output 74 [2024-11-09 06:58:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:30,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43458817] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:30,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:58:30,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 12, 13] total 45 [2024-11-09 06:58:30,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201822179] [2024-11-09 06:58:30,564 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 06:58:30,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:30,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 06:58:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=905, Unknown=27, NotChecked=900, Total=2070 [2024-11-09 06:58:30,567 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 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) [2024-11-09 06:58:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:35,926 INFO L93 Difference]: Finished difference Result 286 states and 333 transitions. [2024-11-09 06:58:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 06:58:35,927 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 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 29 [2024-11-09 06:58:35,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:35,929 INFO L225 Difference]: With dead ends: 286 [2024-11-09 06:58:35,929 INFO L226 Difference]: Without dead ends: 286 [2024-11-09 06:58:35,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 11 SemanticMatches, 52 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=353, Invalid=1390, Unknown=27, NotChecked=1092, Total=2862 [2024-11-09 06:58:35,931 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 843 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 4820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3383 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:35,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 764 Invalid, 4820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1368 Invalid, 0 Unknown, 3383 Unchecked, 4.6s Time] [2024-11-09 06:58:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-09 06:58:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 176. [2024-11-09 06:58:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 174 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2024-11-09 06:58:35,938 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 29 [2024-11-09 06:58:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2024-11-09 06:58:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.3333333333333335) internal successors, (105), 46 states have internal predecessors, (105), 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) [2024-11-09 06:58:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2024-11-09 06:58:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 06:58:35,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:35,940 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:35,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-09 06:58:36,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:36,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:36,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:36,541 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:58:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:36,542 INFO L85 PathProgramCache]: Analyzing trace with hash -405293198, now seen corresponding path program 1 times [2024-11-09 06:58:36,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634217091] [2024-11-09 06:58:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:36,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:36,543 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:36,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 06:58:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:36,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 06:58:36,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:36,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:58:36,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:58:36,796 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:58:36,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:58:36,846 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 15 treesize of output 1 [2024-11-09 06:58:36,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:58:37,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:37,011 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 50 treesize of output 45 [2024-11-09 06:58:37,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:37,169 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:37,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:58:37,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:37,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:58:37,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:37,206 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 50 treesize of output 45 [2024-11-09 06:58:37,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:37,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:58:37,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:58:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:37,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:37,753 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:37,790 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-09 06:58:37,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2024-11-09 06:58:37,863 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_658))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_659) .cse0 v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_659) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_658) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2024-11-09 06:58:37,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_658))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_659) .cse1 v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_663) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_659 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_658 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_659) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_658) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_662) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))))) is different from false [2024-11-09 06:58:37,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:37,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-11-09 06:58:37,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2024-11-09 06:58:37,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2024-11-09 06:58:37,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:37,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 119 [2024-11-09 06:58:38,007 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 74 treesize of output 66 [2024-11-09 06:58:38,013 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 96 treesize of output 84 [2024-11-09 06:58:38,026 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 58 treesize of output 54 [2024-11-09 06:58:38,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:38,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:58:38,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:38,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:58:38,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:38,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:38,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 06:58:38,211 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:38,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 06:58:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:38,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:38,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634217091] [2024-11-09 06:58:38,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634217091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109938752] [2024-11-09 06:58:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:38,486 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:58:38,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:58:38,488 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:58:38,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2024-11-09 06:58:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:38,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 06:58:38,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:38,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:58:38,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:58:38,865 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:58:38,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:58:38,891 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 15 treesize of output 1 [2024-11-09 06:58:38,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:58:38,990 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:38,990 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 50 treesize of output 45 [2024-11-09 06:58:39,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:39,117 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:39,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:58:39,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:58:39,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:58:39,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:39,167 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 50 treesize of output 45 [2024-11-09 06:58:39,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:39,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:58:39,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:58:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:39,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:39,692 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-09 06:58:39,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 06:58:39,829 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_717) .cse1 v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-09 06:58:40,031 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_720 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_717 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_721 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_716))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_717) .cse2 v_ArrVal_721) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-09 06:58:40,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:40,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:58:40,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:40,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:58:40,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 301 [2024-11-09 06:58:40,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:40,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 457 [2024-11-09 06:58:40,166 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 180 treesize of output 172 [2024-11-09 06:58:40,172 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 172 treesize of output 164 [2024-11-09 06:58:40,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:40,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 154 [2024-11-09 06:58:40,210 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 74 treesize of output 70 [2024-11-09 06:58:44,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:44,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-11-09 06:58:44,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:44,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2024-11-09 06:58:44,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2024-11-09 06:58:44,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:44,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 195 [2024-11-09 06:58:44,684 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 70 treesize of output 66 [2024-11-09 06:58:44,691 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 96 treesize of output 84 [2024-11-09 06:58:44,709 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 58 treesize of output 54 [2024-11-09 06:58:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:45,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [109938752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:45,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045532940] [2024-11-09 06:58:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:45,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:45,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:58:45,039 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:58:45,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 06:58:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:45,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 06:58:45,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:45,294 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:58:45,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2024-11-09 06:58:45,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:58:45,383 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 15 treesize of output 1 [2024-11-09 06:58:45,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:58:45,597 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:45,597 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 50 treesize of output 45 [2024-11-09 06:58:45,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:45,802 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 06:58:45,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 06:58:45,811 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 [2024-11-09 06:58:45,831 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:58:45,915 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:45,915 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 50 treesize of output 45 [2024-11-09 06:58:45,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:58:46,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:58:46,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:58:46,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:46,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:46,332 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2024-11-09 06:58:46,373 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2024-11-09 06:58:46,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 06:58:46,505 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_773))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) .cse1 v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2024-11-09 06:58:46,610 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_774) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_773) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_773 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_774 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_773))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_774) .cse2 v_ArrVal_778) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-09 06:58:46,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:46,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-11-09 06:58:46,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:46,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2024-11-09 06:58:46,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2024-11-09 06:58:46,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:46,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 119 [2024-11-09 06:58:46,693 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 74 treesize of output 66 [2024-11-09 06:58:46,698 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 96 treesize of output 84 [2024-11-09 06:58:46,717 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 58 treesize of output 54 [2024-11-09 06:58:46,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:46,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:58:46,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:46,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:58:46,851 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:46,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:46,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 06:58:46,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:58:46,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 06:58:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:46,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045532940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:58:46,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:58:46,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12, 13, 12, 13] total 42 [2024-11-09 06:58:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557972621] [2024-11-09 06:58:46,956 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:58:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 06:58:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 06:58:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=709, Unknown=18, NotChecked=938, Total=1806 [2024-11-09 06:58:46,958 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 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) [2024-11-09 06:58:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:58:52,531 INFO L93 Difference]: Finished difference Result 243 states and 273 transitions. [2024-11-09 06:58:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 06:58:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 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 29 [2024-11-09 06:58:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:58:52,533 INFO L225 Difference]: With dead ends: 243 [2024-11-09 06:58:52,533 INFO L226 Difference]: Without dead ends: 243 [2024-11-09 06:58:52,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=328, Invalid=1602, Unknown=18, NotChecked=1358, Total=3306 [2024-11-09 06:58:52,535 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 545 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2990 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:58:52,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1044 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1345 Invalid, 0 Unknown, 2990 Unchecked, 4.3s Time] [2024-11-09 06:58:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-09 06:58:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 166. [2024-11-09 06:58:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 164 states have internal predecessors, (188), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:58:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 189 transitions. [2024-11-09 06:58:52,546 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 189 transitions. Word has length 29 [2024-11-09 06:58:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:58:52,546 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 189 transitions. [2024-11-09 06:58:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 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) [2024-11-09 06:58:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 189 transitions. [2024-11-09 06:58:52,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:58:52,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:58:52,547 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:52,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-09 06:58:52,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2024-11-09 06:58:52,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-09 06:58:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:58:53,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:58:53,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1595041650, now seen corresponding path program 1 times [2024-11-09 06:58:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:58:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722549371] [2024-11-09 06:58:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:58:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:58:53,150 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:58:53,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 06:58:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:53,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:58:53,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:58:53,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:58:53,387 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:58:53,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 06:58:53,439 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 15 treesize of output 1 [2024-11-09 06:58:53,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:53,578 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 36 treesize of output 35 [2024-11-09 06:58:53,703 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:58:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 06:58:53,733 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:58:53,733 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 36 treesize of output 35 [2024-11-09 06:58:53,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-09 06:58:53,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 06:58:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:53,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:58:54,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_837) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:54,135 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_835))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:54,145 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_835))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:58:54,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:54,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:58:54,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:54,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 243 [2024-11-09 06:58:54,204 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 187 treesize of output 179 [2024-11-09 06:58:54,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:58:54,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 175 [2024-11-09 06:59:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:02,940 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:59:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722549371] [2024-11-09 06:59:02,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722549371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:02,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [959724703] [2024-11-09 06:59:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:02,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:59:02,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:59:02,942 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:59:02,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2024-11-09 06:59:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:03,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 06:59:03,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:03,345 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 06:59:03,346 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 14 treesize of output 20 [2024-11-09 06:59:03,545 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-09 06:59:03,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2024-11-09 06:59:03,666 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 15 treesize of output 1 [2024-11-09 06:59:03,926 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:03,927 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 44 treesize of output 41 [2024-11-09 06:59:04,252 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:59:04,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 32 [2024-11-09 06:59:04,304 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:04,304 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 44 treesize of output 41 [2024-11-09 06:59:04,670 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 43 treesize of output 23 [2024-11-09 06:59:04,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-09 06:59:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:04,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:04,898 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_897) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:04,971 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_895))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 1))) is different from false [2024-11-09 06:59:04,982 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_837 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_895))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:05,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:05,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:59:05,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:05,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 243 [2024-11-09 06:59:05,043 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 187 treesize of output 179 [2024-11-09 06:59:05,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:05,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 175 [2024-11-09 06:59:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [959724703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111136629] [2024-11-09 06:59:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:10,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:10,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:10,531 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:10,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 06:59:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:10,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 06:59:10,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:10,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:59:10,758 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:59:10,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 06:59:10,807 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 15 treesize of output 1 [2024-11-09 06:59:10,905 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:10,906 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 36 treesize of output 35 [2024-11-09 06:59:11,002 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:59:11,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2024-11-09 06:59:11,040 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:11,040 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 36 treesize of output 35 [2024-11-09 06:59:11,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-09 06:59:11,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 06:59:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:11,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:11,328 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_957) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:11,336 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_957) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:11,355 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_957)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:11,369 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_955 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_955))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_957)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:11,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:11,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 33 [2024-11-09 06:59:11,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:11,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 243 [2024-11-09 06:59:11,423 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 187 treesize of output 179 [2024-11-09 06:59:11,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:11,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 175 [2024-11-09 06:59:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:17,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111136629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:17,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:59:17,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 12, 11, 12] total 41 [2024-11-09 06:59:17,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88993981] [2024-11-09 06:59:17,272 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:17,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 06:59:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:59:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 06:59:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=800, Unknown=27, NotChecked=690, Total=1722 [2024-11-09 06:59:17,274 INFO L87 Difference]: Start difference. First operand 166 states and 189 transitions. Second operand has 42 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 42 states have internal predecessors, (108), 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) [2024-11-09 06:59:20,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:20,307 INFO L93 Difference]: Finished difference Result 247 states and 278 transitions. [2024-11-09 06:59:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:59:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 42 states have internal predecessors, (108), 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 31 [2024-11-09 06:59:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:20,308 INFO L225 Difference]: With dead ends: 247 [2024-11-09 06:59:20,308 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 06:59:20,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=217, Invalid=852, Unknown=27, NotChecked=710, Total=1806 [2024-11-09 06:59:20,309 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 384 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 3108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2109 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:20,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 698 Invalid, 3108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 959 Invalid, 0 Unknown, 2109 Unchecked, 2.7s Time] [2024-11-09 06:59:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 06:59:20,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 173. [2024-11-09 06:59:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 171 states have internal predecessors, (197), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2024-11-09 06:59:20,314 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 31 [2024-11-09 06:59:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:20,314 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2024-11-09 06:59:20,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.6341463414634148) internal successors, (108), 42 states have internal predecessors, (108), 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) [2024-11-09 06:59:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2024-11-09 06:59:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 06:59:20,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:20,315 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:20,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2024-11-09 06:59:20,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:20,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:20,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:59:20,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1595041649, now seen corresponding path program 1 times [2024-11-09 06:59:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:59:20,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843348972] [2024-11-09 06:59:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:20,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:20,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:59:20,928 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:59:20,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-09 06:59:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:21,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 06:59:21,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:21,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:59:21,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:59:21,203 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:59:21,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:59:21,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:59:21,259 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 15 treesize of output 1 [2024-11-09 06:59:21,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:21,404 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 50 treesize of output 45 [2024-11-09 06:59:21,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:21,583 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:59:21,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:59:21,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:21,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:59:21,631 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:21,631 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 50 treesize of output 45 [2024-11-09 06:59:21,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:21,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-09 06:59:21,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 06:59:21,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:59:21,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:59:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:21,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:22,158 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1022 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1022) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:22,194 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1022 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1022) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2024-11-09 06:59:22,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1022 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1022) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-09 06:59:22,266 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1018) .cse0 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1022) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1018) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1017) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2024-11-09 06:59:22,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1017))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1018) .cse1 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1022) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1018) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1017) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 06:59:22,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:22,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 06:59:22,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:22,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:59:22,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2024-11-09 06:59:22,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 215 [2024-11-09 06:59:22,417 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 78 treesize of output 74 [2024-11-09 06:59:22,422 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 108 treesize of output 96 [2024-11-09 06:59:22,436 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 66 treesize of output 62 [2024-11-09 06:59:22,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:22,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:59:22,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:22,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:59:22,640 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:22,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:22,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 06:59:22,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:22,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-09 06:59:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:22,969 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:59:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843348972] [2024-11-09 06:59:22,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843348972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:22,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1551632823] [2024-11-09 06:59:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:59:22,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:59:22,981 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:59:22,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2024-11-09 06:59:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:23,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-09 06:59:23,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:23,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:59:23,489 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:59:23,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:59:23,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:59:23,579 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 15 treesize of output 1 [2024-11-09 06:59:23,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:59:23,790 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:23,790 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 50 treesize of output 45 [2024-11-09 06:59:23,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:24,001 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:59:24,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:59:24,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:24,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:59:24,048 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:24,049 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 50 treesize of output 45 [2024-11-09 06:59:24,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:24,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 06:59:24,292 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 33 treesize of output 17 [2024-11-09 06:59:24,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:59:24,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:59:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:24,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:24,494 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-09 06:59:24,527 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-09 06:59:24,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 06:59:24,710 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1084))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1085) .cse0 v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1085) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2024-11-09 06:59:24,889 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1088 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1084))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1085) .cse1 v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1085) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1089) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 06:59:24,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:24,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:59:24,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:24,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:59:24,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:24,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 301 [2024-11-09 06:59:25,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:25,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 826 treesize of output 793 [2024-11-09 06:59:25,018 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 180 treesize of output 172 [2024-11-09 06:59:25,026 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 172 treesize of output 164 [2024-11-09 06:59:25,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:25,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 154 [2024-11-09 06:59:25,079 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 74 treesize of output 70 [2024-11-09 06:59:28,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:28,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 06:59:28,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:28,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:59:28,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2024-11-09 06:59:28,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:28,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2024-11-09 06:59:28,285 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 82 treesize of output 74 [2024-11-09 06:59:28,293 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 108 treesize of output 96 [2024-11-09 06:59:28,311 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 66 treesize of output 62 [2024-11-09 06:59:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:28,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1551632823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:28,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17349790] [2024-11-09 06:59:28,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:28,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:59:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:59:28,656 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:59:28,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-11-09 06:59:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:28,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 06:59:28,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:28,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:59:28,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:59:28,889 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:59:28,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:59:28,904 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 15 treesize of output 1 [2024-11-09 06:59:28,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:59:29,006 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:29,006 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 50 treesize of output 45 [2024-11-09 06:59:29,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:29,089 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 06:59:29,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 06:59:29,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:59:29,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 06:59:29,127 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:29,127 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 50 treesize of output 45 [2024-11-09 06:59:29,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:29,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-09 06:59:29,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 06:59:29,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 06:59:29,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 06:59:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:29,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:29,431 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-09 06:59:29,474 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0))))) is different from false [2024-11-09 06:59:29,515 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2024-11-09 06:59:29,629 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1151))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1152) .cse0 v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1152) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1151) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2024-11-09 06:59:29,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1152) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1151) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_1151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1151))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1152) .cse2 v_ArrVal_1156) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1155) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-09 06:59:29,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:29,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 06:59:29,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:29,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2024-11-09 06:59:29,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 72 [2024-11-09 06:59:29,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:29,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 131 [2024-11-09 06:59:29,805 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 82 treesize of output 74 [2024-11-09 06:59:29,810 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 108 treesize of output 96 [2024-11-09 06:59:29,824 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 66 treesize of output 62 [2024-11-09 06:59:29,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 06:59:29,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:59:29,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 06:59:30,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:30,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:30,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2024-11-09 06:59:30,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:59:30,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2024-11-09 06:59:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17349790] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:59:30,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:59:30,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11, 12, 11, 12] total 40 [2024-11-09 06:59:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347239853] [2024-11-09 06:59:30,212 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:59:30,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 06:59:30,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:59:30,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 06:59:30,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=561, Unknown=15, NotChecked=930, Total=1640 [2024-11-09 06:59:30,214 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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) [2024-11-09 06:59:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:34,642 INFO L93 Difference]: Finished difference Result 233 states and 263 transitions. [2024-11-09 06:59:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:59:34,643 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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 31 [2024-11-09 06:59:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:34,644 INFO L225 Difference]: With dead ends: 233 [2024-11-09 06:59:34,644 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 06:59:34,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 136 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=216, Invalid=885, Unknown=15, NotChecked=1140, Total=2256 [2024-11-09 06:59:34,645 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 202 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2664 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:34,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1009 Invalid, 3808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1118 Invalid, 0 Unknown, 2664 Unchecked, 3.5s Time] [2024-11-09 06:59:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 06:59:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 173. [2024-11-09 06:59:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 171 states have internal predecessors, (196), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:59:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 197 transitions. [2024-11-09 06:59:34,650 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 197 transitions. Word has length 31 [2024-11-09 06:59:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:34,650 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 197 transitions. [2024-11-09 06:59:34,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.6) internal successors, (104), 41 states have internal predecessors, (104), 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) [2024-11-09 06:59:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 197 transitions. [2024-11-09 06:59:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 06:59:34,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:34,652 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:34,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-11-09 06:59:34,855 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:35,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2024-11-09 06:59:35,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:59:35,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-11-09 06:59:35,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 40601215, now seen corresponding path program 2 times [2024-11-09 06:59:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:59:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513314945] [2024-11-09 06:59:35,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:59:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:59:35,255 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:59:35,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3661f0ac-bfed-4b03-9ad3-5ccabc7681b9/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-09 06:59:35,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:59:35,461 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:59:35,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-09 06:59:35,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:59:35,529 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:59:35,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:59:35,570 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 15 treesize of output 1 [2024-11-09 06:59:35,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 06:59:35,695 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 06:59:35,695 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 41 treesize of output 38 [2024-11-09 06:59:35,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 06:59:35,847 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 06:59:35,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 06:59:35,863 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 19 treesize of output 18 [2024-11-09 06:59:35,954 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-09 06:59:35,954 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2024-11-09 06:59:35,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-11-09 06:59:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:36,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:59:36,679 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1217 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1215))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1217)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (store .cse3 .cse2 (select v_ArrVal_1215 .cse2)) v_ArrVal_1215)))) (forall ((v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (store .cse3 .cse2 (select v_ArrVal_1215 .cse2)) v_ArrVal_1215)) (forall ((v_ArrVal_1217 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 .cse2 v_ArrVal_1217)))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1215) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))) is different from false [2024-11-09 06:59:38,318 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1212))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1211))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) .cse4))) (or (forall ((v_ArrVal_1217 (_ BitVec 32))) (= (let ((.cse0 (store .cse3 .cse2 (store (store (select .cse3 .cse2) .cse4 (_ bv0 32)) .cse5 v_ArrVal_1217)))) (select (select .cse0 (select (select (store .cse1 .cse2 v_ArrVal_1215) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 32))) (not (= v_ArrVal_1215 (store (store (select .cse1 .cse2) .cse4 (_ bv0 32)) .cse5 (select v_ArrVal_1215 .cse5))))))))) (forall ((v_ArrVal_1211 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1215 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1212 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1212))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1211))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse9 (bvadd (_ bv8 32) .cse8))) (or (not (= v_ArrVal_1215 (store (store (select .cse6 .cse7) .cse8 (_ bv0 32)) .cse9 (select v_ArrVal_1215 .cse9)))) (forall ((v_ArrVal_1217 (_ BitVec 32))) (= (select (let ((.cse10 (store .cse6 .cse7 v_ArrVal_1215))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store .cse11 .cse7 (store (store (select .cse11 .cse7) .cse8 (_ bv0 32)) .cse9 v_ArrVal_1217)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))))))))) is different from false