./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e3b9005361fd0095f8dbb62f5fee3acdc88198cbc01de43b11979176397f6891 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:48:54,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:54,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 02:48:54,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:54,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:54,234 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:54,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:54,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:54,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:54,236 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:54,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:54,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:54,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:54,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:54,236 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:54,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:54,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:54,237 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:54,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:54,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:54,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:54,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:54,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:54,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:54,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3b9005361fd0095f8dbb62f5fee3acdc88198cbc01de43b11979176397f6891 [2025-03-09 02:48:54,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:54,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:54,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:54,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:54,468 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:54,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-03-09 02:48:55,566 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1eea680/934ed8169c904fdeb43d850be8a100fa/FLAG9543d93e9 [2025-03-09 02:48:56,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:56,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-03-09 02:48:56,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1eea680/934ed8169c904fdeb43d850be8a100fa/FLAG9543d93e9 [2025-03-09 02:48:56,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1eea680/934ed8169c904fdeb43d850be8a100fa [2025-03-09 02:48:56,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:56,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:56,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:56,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:56,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:56,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:56" (1/1) ... [2025-03-09 02:48:56,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6069ed39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:56, skipping insertion in model container [2025-03-09 02:48:56,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:56" (1/1) ... [2025-03-09 02:48:56,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:57,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:57,398 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:57,571 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] [2025-03-09 02:48:57,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:57,643 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:57,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57 WrapperNode [2025-03-09 02:48:57,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:57,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:57,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:57,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:57,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,724 INFO L138 Inliner]: procedures = 188, calls = 660, calls flagged for inlining = 75, calls inlined = 50, statements flattened = 1355 [2025-03-09 02:48:57,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:57,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:57,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:57,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:57,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,842 INFO L175 MemorySlicer]: Split 204 memory accesses to 8 slices as follows [2, 32, 9, 21, 12, 115, 5, 8]. 56 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 9, 0, 12, 54, 0, 0]. The 38 writes are split as follows [0, 28, 0, 1, 0, 9, 0, 0]. [2025-03-09 02:48:57,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:57,904 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:57,904 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:57,904 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:57,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (1/1) ... [2025-03-09 02:48:57,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:57,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:57,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:48:57,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-09 02:48:57,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-09 02:48:57,954 INFO L130 BoogieDeclarations]: Found specification of procedure uspace_ring_map [2025-03-09 02:48:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure uspace_ring_map [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unmap_user_pages [2025-03-09 02:48:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unmap_user_pages [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure hash_64 [2025-03-09 02:48:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_64 [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_release_buffers [2025-03-09 02:48:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_release_buffers [2025-03-09 02:48:57,955 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-09 02:48:57,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_write [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_write [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_open [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_open [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_destroy [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_destroy [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_to_host [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_to_host [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_idx_inc [2025-03-09 02:48:57,956 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_idx_inc [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:48:57,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_head_event [2025-03-09 02:48:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_head_event [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_put [2025-03-09 02:48:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_put [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2025-03-09 02:48:57,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 02:48:57,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-09 02:48:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-03-09 02:48:57,959 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 02:48:57,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 02:48:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 02:48:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-09 02:48:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-09 02:48:57,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_exit [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_exit [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_destroy [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_destroy [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_init [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_init [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_free [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_free [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_poll [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_poll [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_lookup [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_lookup [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_mmap [2025-03-09 02:48:57,961 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_mmap [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:48:57,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2025-03-09 02:48:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2025-03-09 02:48:57,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:57,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:58,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:58,251 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:58,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8347: havoc vm_insert_page_#t~nondet448#1; [2025-03-09 02:48:58,336 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8213: havoc __phys_addr_#t~nondet427#1; [2025-03-09 02:48:58,343 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7298: havoc #t~mem304; [2025-03-09 02:48:58,356 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8259: havoc blk_rq_unmap_user_#t~nondet434#1; [2025-03-09 02:48:58,393 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6474: havoc #t~bitwise81; [2025-03-09 02:48:58,416 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6379: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-09 02:48:58,449 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8323: havoc #t~nondet444; [2025-03-09 02:48:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8255: havoc blk_rq_map_user_#t~nondet433#1; [2025-03-09 02:48:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc scsi_init_io_#t~nondet447#1; [2025-03-09 02:48:58,816 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6451: havoc blk_rq_bytes_#t~mem77#1; [2025-03-09 02:48:58,835 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7613: call ULTIMATE.dealloc(~#__key~3#1.base, ~#__key~3#1.offset);havoc ~#__key~3#1.base, ~#__key~3#1.offset; [2025-03-09 02:48:58,836 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8272: havoc get_zeroed_page_#t~nondet436#1; [2025-03-09 02:48:58,874 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8236: havoc #t~nondet431; [2025-03-09 02:48:58,886 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8333: havoc #t~ret446.base, #t~ret446.offset; [2025-03-09 02:48:58,902 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8232: havoc #t~nondet430; [2025-03-09 02:48:59,664 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8319: havoc noop_llseek_#t~nondet443#1; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7072: call ULTIMATE.dealloc(scsi_tgt_init_~#__key~2#1.base, scsi_tgt_init_~#__key~2#1.offset);havoc scsi_tgt_init_~#__key~2#1.base, scsi_tgt_init_~#__key~2#1.offset; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8278: havoc kmem_cache_create_#t~ret438#1.base, kmem_cache_create_#t~ret438#1.offset; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8197: havoc __alloc_workqueue_key_#t~ret426#1.base, __alloc_workqueue_key_#t~ret426#1.offset; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8288: havoc ldv_tgt_fops_release_1_#t~nondet439#1; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8305: havoc misc_register_#t~nondet441#1; [2025-03-09 02:48:59,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8301: havoc misc_deregister_#t~nondet440#1; [2025-03-09 02:48:59,669 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6769: havoc #t~mem152.base, #t~mem152.offset; [2025-03-09 02:48:59,804 INFO L? ?]: Removed 647 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:59,804 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:59,828 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:59,828 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 02:48:59,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:59 BoogieIcfgContainer [2025-03-09 02:48:59,829 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:59,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:59,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:59,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:59,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:56" (1/3) ... [2025-03-09 02:48:59,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377205a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:59, skipping insertion in model container [2025-03-09 02:48:59,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:57" (2/3) ... [2025-03-09 02:48:59,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377205a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:59, skipping insertion in model container [2025-03-09 02:48:59,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:59" (3/3) ... [2025-03-09 02:48:59,839 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2025-03-09 02:48:59,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:59,851 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i that has 32 procedures, 434 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-09 02:48:59,907 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:59,917 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48a88fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:59,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 02:48:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 434 states, 309 states have (on average 1.313915857605178) internal successors, (406), 326 states have internal predecessors, (406), 83 states have call successors, (83), 31 states have call predecessors, (83), 31 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-09 02:48:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:48:59,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:59,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:59,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:48:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -54413280, now seen corresponding path program 1 times [2025-03-09 02:48:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:59,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138033945] [2025-03-09 02:48:59,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:00,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:49:00,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:49:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:00,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:00,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:00,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138033945] [2025-03-09 02:49:00,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138033945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:00,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:00,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:00,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407861002] [2025-03-09 02:49:00,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:00,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:00,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:00,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:00,443 INFO L87 Difference]: Start difference. First operand has 434 states, 309 states have (on average 1.313915857605178) internal successors, (406), 326 states have internal predecessors, (406), 83 states have call successors, (83), 31 states have call predecessors, (83), 31 states have return successors, (83), 83 states have call predecessors, (83), 83 states have call successors, (83) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:00,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:00,574 INFO L93 Difference]: Finished difference Result 969 states and 1292 transitions. [2025-03-09 02:49:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:00,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-09 02:49:00,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:00,586 INFO L225 Difference]: With dead ends: 969 [2025-03-09 02:49:00,588 INFO L226 Difference]: Without dead ends: 504 [2025-03-09 02:49:00,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:00,598 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 135 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:00,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1082 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:49:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-09 02:49:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 499. [2025-03-09 02:49:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 359 states have (on average 1.3147632311977715) internal successors, (472), 375 states have internal predecessors, (472), 92 states have call successors, (92), 38 states have call predecessors, (92), 38 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-09 02:49:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 654 transitions. [2025-03-09 02:49:00,675 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 654 transitions. Word has length 15 [2025-03-09 02:49:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:00,676 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 654 transitions. [2025-03-09 02:49:00,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 654 transitions. [2025-03-09 02:49:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:49:00,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:00,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:00,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:49:00,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash -366635269, now seen corresponding path program 1 times [2025-03-09 02:49:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:00,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749263566] [2025-03-09 02:49:00,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:00,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:49:00,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:49:00,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:00,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:00,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:00,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749263566] [2025-03-09 02:49:00,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749263566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:00,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:00,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227373721] [2025-03-09 02:49:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:00,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:00,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:00,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:00,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:00,973 INFO L87 Difference]: Start difference. First operand 499 states and 654 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:49:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:01,688 INFO L93 Difference]: Finished difference Result 1374 states and 1803 transitions. [2025-03-09 02:49:01,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:01,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-03-09 02:49:01,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:01,696 INFO L225 Difference]: With dead ends: 1374 [2025-03-09 02:49:01,697 INFO L226 Difference]: Without dead ends: 878 [2025-03-09 02:49:01,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:01,699 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 522 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:01,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1391 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:01,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-09 02:49:01,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 855. [2025-03-09 02:49:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 626 states have (on average 1.3115015974440896) internal successors, (821), 643 states have internal predecessors, (821), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1128 transitions. [2025-03-09 02:49:01,760 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1128 transitions. Word has length 20 [2025-03-09 02:49:01,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:01,760 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1128 transitions. [2025-03-09 02:49:01,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:49:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1128 transitions. [2025-03-09 02:49:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:49:01,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:01,765 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1] [2025-03-09 02:49:01,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:49:01,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:01,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1962561092, now seen corresponding path program 1 times [2025-03-09 02:49:01,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:01,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786241871] [2025-03-09 02:49:01,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:01,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:49:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:49:01,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:01,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786241871] [2025-03-09 02:49:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786241871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:02,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736697876] [2025-03-09 02:49:02,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:02,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:02,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:02,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:02,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:02,013 INFO L87 Difference]: Start difference. First operand 855 states and 1128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:49:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:02,621 INFO L93 Difference]: Finished difference Result 1713 states and 2261 transitions. [2025-03-09 02:49:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-03-09 02:49:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:02,628 INFO L225 Difference]: With dead ends: 1713 [2025-03-09 02:49:02,628 INFO L226 Difference]: Without dead ends: 855 [2025-03-09 02:49:02,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:02,631 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 1 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:02,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1601 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:49:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-03-09 02:49:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2025-03-09 02:49:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 626 states have (on average 1.3083067092651757) internal successors, (819), 643 states have internal predecessors, (819), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1126 transitions. [2025-03-09 02:49:02,668 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1126 transitions. Word has length 38 [2025-03-09 02:49:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:02,668 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1126 transitions. [2025-03-09 02:49:02,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:49:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1126 transitions. [2025-03-09 02:49:02,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:49:02,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:02,669 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:02,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:49:02,669 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:02,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1384866723, now seen corresponding path program 1 times [2025-03-09 02:49:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178221640] [2025-03-09 02:49:02,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:02,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:02,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:49:02,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:49:02,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:02,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178221640] [2025-03-09 02:49:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178221640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:02,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527837978] [2025-03-09 02:49:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:02,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:02,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:02,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:02,968 INFO L87 Difference]: Start difference. First operand 855 states and 1126 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:03,017 INFO L93 Difference]: Finished difference Result 1727 states and 2285 transitions. [2025-03-09 02:49:03,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2025-03-09 02:49:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:03,022 INFO L225 Difference]: With dead ends: 1727 [2025-03-09 02:49:03,022 INFO L226 Difference]: Without dead ends: 875 [2025-03-09 02:49:03,025 INFO L434 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 [2025-03-09 02:49:03,027 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 4 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:03,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1064 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-09 02:49:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 867. [2025-03-09 02:49:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 638 states have (on average 1.3056426332288402) internal successors, (833), 655 states have internal predecessors, (833), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1140 transitions. [2025-03-09 02:49:03,064 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1140 transitions. Word has length 43 [2025-03-09 02:49:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:03,064 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1140 transitions. [2025-03-09 02:49:03,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1140 transitions. [2025-03-09 02:49:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 02:49:03,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:03,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:49:03,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:03,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1819840749, now seen corresponding path program 1 times [2025-03-09 02:49:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:03,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554950538] [2025-03-09 02:49:03,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:03,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:49:03,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:49:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554950538] [2025-03-09 02:49:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554950538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735861415] [2025-03-09 02:49:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:03,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:03,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:03,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:49:03,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 02:49:03,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 02:49:03,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:03,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:03,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:03,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:03,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735861415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:03,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036864772] [2025-03-09 02:49:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:03,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:03,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:03,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:03,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:03,767 INFO L87 Difference]: Start difference. First operand 867 states and 1140 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:03,818 INFO L93 Difference]: Finished difference Result 879 states and 1158 transitions. [2025-03-09 02:49:03,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:03,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2025-03-09 02:49:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:03,825 INFO L225 Difference]: With dead ends: 879 [2025-03-09 02:49:03,826 INFO L226 Difference]: Without dead ends: 878 [2025-03-09 02:49:03,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:03,828 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 7 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:03,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1073 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-09 02:49:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 866. [2025-03-09 02:49:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 638 states have (on average 1.3025078369905956) internal successors, (831), 654 states have internal predecessors, (831), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1138 transitions. [2025-03-09 02:49:03,862 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1138 transitions. Word has length 49 [2025-03-09 02:49:03,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:03,862 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1138 transitions. [2025-03-09 02:49:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1138 transitions. [2025-03-09 02:49:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-09 02:49:03,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:03,863 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:03,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:49:04,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:04,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:04,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash -580488039, now seen corresponding path program 1 times [2025-03-09 02:49:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127755959] [2025-03-09 02:49:04,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:04,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:49:04,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:49:04,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:04,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127755959] [2025-03-09 02:49:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127755959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120748848] [2025-03-09 02:49:04,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:04,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:04,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:04,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:49:04,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 02:49:04,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 02:49:04,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:04,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:04,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:04,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:04,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:49:04,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120748848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:04,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:04,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043293535] [2025-03-09 02:49:04,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:04,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:04,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:04,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:04,790 INFO L87 Difference]: Start difference. First operand 866 states and 1138 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:04,844 INFO L93 Difference]: Finished difference Result 900 states and 1190 transitions. [2025-03-09 02:49:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2025-03-09 02:49:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:04,849 INFO L225 Difference]: With dead ends: 900 [2025-03-09 02:49:04,849 INFO L226 Difference]: Without dead ends: 899 [2025-03-09 02:49:04,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:04,850 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 12 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:04,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2640 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:04,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-09 02:49:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 855. [2025-03-09 02:49:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 628 states have (on average 1.3009554140127388) internal successors, (817), 643 states have internal predecessors, (817), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1124 transitions. [2025-03-09 02:49:04,877 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1124 transitions. Word has length 50 [2025-03-09 02:49:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:04,877 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1124 transitions. [2025-03-09 02:49:04,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1124 transitions. [2025-03-09 02:49:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 02:49:04,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:04,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:04,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:05,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:49:05,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:05,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash -442525310, now seen corresponding path program 1 times [2025-03-09 02:49:05,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:05,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719481745] [2025-03-09 02:49:05,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:05,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:05,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 02:49:05,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 02:49:05,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 02:49:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:05,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719481745] [2025-03-09 02:49:05,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719481745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:05,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:05,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:05,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111349565] [2025-03-09 02:49:05,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:05,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:05,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:05,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:05,248 INFO L87 Difference]: Start difference. First operand 855 states and 1124 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:05,285 INFO L93 Difference]: Finished difference Result 1722 states and 2273 transitions. [2025-03-09 02:49:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:05,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2025-03-09 02:49:05,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:05,290 INFO L225 Difference]: With dead ends: 1722 [2025-03-09 02:49:05,291 INFO L226 Difference]: Without dead ends: 870 [2025-03-09 02:49:05,293 INFO L434 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 [2025-03-09 02:49:05,294 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:05,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1058 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-09 02:49:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-09 02:49:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 643 states have (on average 1.2939346811819596) internal successors, (832), 658 states have internal predecessors, (832), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1139 transitions. [2025-03-09 02:49:05,326 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1139 transitions. Word has length 51 [2025-03-09 02:49:05,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:05,327 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1139 transitions. [2025-03-09 02:49:05,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1139 transitions. [2025-03-09 02:49:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:49:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:05,328 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:05,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:49:05,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:05,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1147372815, now seen corresponding path program 1 times [2025-03-09 02:49:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861730156] [2025-03-09 02:49:05,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:05,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:49:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:49:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:05,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 02:49:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861730156] [2025-03-09 02:49:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861730156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747579407] [2025-03-09 02:49:05,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:05,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:05,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:05,521 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:05,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:49:05,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:49:05,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:49:05,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:05,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:05,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:49:05,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:49:06,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:06,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747579407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:06,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:06,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 02:49:06,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304757941] [2025-03-09 02:49:06,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:49:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:06,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:49:06,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:06,009 INFO L87 Difference]: Start difference. First operand 870 states and 1139 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:49:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:06,573 INFO L93 Difference]: Finished difference Result 1747 states and 2289 transitions. [2025-03-09 02:49:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:49:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2025-03-09 02:49:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:06,578 INFO L225 Difference]: With dead ends: 1747 [2025-03-09 02:49:06,578 INFO L226 Difference]: Without dead ends: 870 [2025-03-09 02:49:06,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:06,581 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 1 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:06,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2118 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:49:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-09 02:49:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-03-09 02:49:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 643 states have (on average 1.290824261275272) internal successors, (830), 656 states have internal predecessors, (830), 154 states have call successors, (154), 65 states have call predecessors, (154), 65 states have return successors, (153), 153 states have call predecessors, (153), 153 states have call successors, (153) [2025-03-09 02:49:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1137 transitions. [2025-03-09 02:49:06,607 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1137 transitions. Word has length 56 [2025-03-09 02:49:06,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:06,607 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1137 transitions. [2025-03-09 02:49:06,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 02:49:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1137 transitions. [2025-03-09 02:49:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 02:49:06,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:06,608 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:06,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:49:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:06,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:06,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash 165195243, now seen corresponding path program 1 times [2025-03-09 02:49:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215236535] [2025-03-09 02:49:06,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:06,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:49:06,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:49:06,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:06,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 02:49:07,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215236535] [2025-03-09 02:49:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215236535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:07,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025158246] [2025-03-09 02:49:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:07,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:07,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:07,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:07,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:49:07,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 02:49:07,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 02:49:07,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:07,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:07,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:49:07,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 02:49:07,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:07,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025158246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:07,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:07,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 9 [2025-03-09 02:49:07,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053794558] [2025-03-09 02:49:07,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:07,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:07,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:07,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:07,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:49:07,481 INFO L87 Difference]: Start difference. First operand 870 states and 1137 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:49:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:07,581 INFO L93 Difference]: Finished difference Result 1755 states and 2299 transitions. [2025-03-09 02:49:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:49:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2025-03-09 02:49:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:07,586 INFO L225 Difference]: With dead ends: 1755 [2025-03-09 02:49:07,586 INFO L226 Difference]: Without dead ends: 888 [2025-03-09 02:49:07,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:49:07,589 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:07,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3208 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:49:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2025-03-09 02:49:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 882. [2025-03-09 02:49:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 653 states have (on average 1.2863705972434916) internal successors, (840), 666 states have internal predecessors, (840), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-03-09 02:49:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1151 transitions. [2025-03-09 02:49:07,619 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1151 transitions. Word has length 78 [2025-03-09 02:49:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:07,619 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1151 transitions. [2025-03-09 02:49:07,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:49:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1151 transitions. [2025-03-09 02:49:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-09 02:49:07,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:07,620 INFO L218 NwaCegarLoop]: trace histogram [2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:07,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:07,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:07,821 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1669716032, now seen corresponding path program 1 times [2025-03-09 02:49:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936075858] [2025-03-09 02:49:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:07,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-09 02:49:07,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-09 02:49:07,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-09 02:49:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936075858] [2025-03-09 02:49:08,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936075858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:08,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:08,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:49:08,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675192363] [2025-03-09 02:49:08,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:08,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:49:08,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:08,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:49:08,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:08,039 INFO L87 Difference]: Start difference. First operand 882 states and 1151 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:49:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:08,084 INFO L93 Difference]: Finished difference Result 1761 states and 2299 transitions. [2025-03-09 02:49:08,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:49:08,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2025-03-09 02:49:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:08,090 INFO L225 Difference]: With dead ends: 1761 [2025-03-09 02:49:08,090 INFO L226 Difference]: Without dead ends: 882 [2025-03-09 02:49:08,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:08,093 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 0 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:08,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2118 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-09 02:49:08,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2025-03-09 02:49:08,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 653 states have (on average 1.2833078101071975) internal successors, (838), 666 states have internal predecessors, (838), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-03-09 02:49:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1149 transitions. [2025-03-09 02:49:08,114 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1149 transitions. Word has length 77 [2025-03-09 02:49:08,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:08,115 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1149 transitions. [2025-03-09 02:49:08,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:49:08,116 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1149 transitions. [2025-03-09 02:49:08,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:49:08,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:08,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-03-09 02:49:08,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:49:08,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:08,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:08,117 INFO L85 PathProgramCache]: Analyzing trace with hash 248138937, now seen corresponding path program 1 times [2025-03-09 02:49:08,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:08,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638838300] [2025-03-09 02:49:08,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:08,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:49:08,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:49:08,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:08,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638838300] [2025-03-09 02:49:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638838300] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180482419] [2025-03-09 02:49:08,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:08,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:08,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:08,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:08,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:49:08,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:49:08,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:49:08,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:08,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:08,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1183 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:08,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:08,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180482419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:08,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:08,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:08,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597274779] [2025-03-09 02:49:08,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:08,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:08,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:08,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:08,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:08,772 INFO L87 Difference]: Start difference. First operand 882 states and 1149 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:08,801 INFO L93 Difference]: Finished difference Result 882 states and 1149 transitions. [2025-03-09 02:49:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 86 [2025-03-09 02:49:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:08,805 INFO L225 Difference]: With dead ends: 882 [2025-03-09 02:49:08,806 INFO L226 Difference]: Without dead ends: 881 [2025-03-09 02:49:08,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:08,807 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:08,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1579 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-09 02:49:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2025-03-09 02:49:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 653 states have (on average 1.2787136294027566) internal successors, (835), 665 states have internal predecessors, (835), 154 states have call successors, (154), 65 states have call predecessors, (154), 67 states have return successors, (157), 155 states have call predecessors, (157), 153 states have call successors, (157) [2025-03-09 02:49:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1146 transitions. [2025-03-09 02:49:08,827 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1146 transitions. Word has length 86 [2025-03-09 02:49:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:08,827 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1146 transitions. [2025-03-09 02:49:08,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:08,827 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1146 transitions. [2025-03-09 02:49:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-09 02:49:08,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:08,828 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:08,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:09,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 02:49:09,029 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:09,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:09,029 INFO L85 PathProgramCache]: Analyzing trace with hash -897627500, now seen corresponding path program 1 times [2025-03-09 02:49:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:09,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064229079] [2025-03-09 02:49:09,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:09,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:49:09,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:49:09,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:09,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:09,225 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064229079] [2025-03-09 02:49:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064229079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396385511] [2025-03-09 02:49:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:09,227 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:09,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:49:09,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-09 02:49:09,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-09 02:49:09,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:09,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:09,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:09,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:09,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396385511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:09,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917165729] [2025-03-09 02:49:09,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:09,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:09,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:09,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:09,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:09,794 INFO L87 Difference]: Start difference. First operand 881 states and 1146 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:09,837 INFO L93 Difference]: Finished difference Result 899 states and 1173 transitions. [2025-03-09 02:49:09,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:09,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 87 [2025-03-09 02:49:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:09,842 INFO L225 Difference]: With dead ends: 899 [2025-03-09 02:49:09,842 INFO L226 Difference]: Without dead ends: 872 [2025-03-09 02:49:09,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:09,843 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:09,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2630 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-09 02:49:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 852. [2025-03-09 02:49:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 630 states have (on average 1.2793650793650793) internal successors, (806), 640 states have internal predecessors, (806), 151 states have call successors, (151), 63 states have call predecessors, (151), 65 states have return successors, (155), 153 states have call predecessors, (155), 151 states have call successors, (155) [2025-03-09 02:49:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1112 transitions. [2025-03-09 02:49:09,864 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1112 transitions. Word has length 87 [2025-03-09 02:49:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:09,864 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1112 transitions. [2025-03-09 02:49:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1112 transitions. [2025-03-09 02:49:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 02:49:09,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:09,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:09,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:49:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:10,067 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2083642984, now seen corresponding path program 1 times [2025-03-09 02:49:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972744725] [2025-03-09 02:49:10,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:10,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 02:49:10,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 02:49:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 02:49:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972744725] [2025-03-09 02:49:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972744725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:10,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678080140] [2025-03-09 02:49:10,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:10,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:10,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:10,251 INFO L87 Difference]: Start difference. First operand 852 states and 1112 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:11,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:11,044 INFO L93 Difference]: Finished difference Result 2396 states and 3130 transitions. [2025-03-09 02:49:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2025-03-09 02:49:11,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:11,053 INFO L225 Difference]: With dead ends: 2396 [2025-03-09 02:49:11,053 INFO L226 Difference]: Without dead ends: 1547 [2025-03-09 02:49:11,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:11,056 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 478 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:11,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1101 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:49:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-09 02:49:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1544. [2025-03-09 02:49:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1140 states have (on average 1.263157894736842) internal successors, (1440), 1154 states have internal predecessors, (1440), 277 states have call successors, (277), 118 states have call predecessors, (277), 121 states have return successors, (283), 280 states have call predecessors, (283), 277 states have call successors, (283) [2025-03-09 02:49:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2000 transitions. [2025-03-09 02:49:11,125 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2000 transitions. Word has length 95 [2025-03-09 02:49:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:11,125 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 2000 transitions. [2025-03-09 02:49:11,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2000 transitions. [2025-03-09 02:49:11,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 02:49:11,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:11,129 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:11,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 02:49:11,129 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:11,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1917045367, now seen corresponding path program 1 times [2025-03-09 02:49:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:11,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434769672] [2025-03-09 02:49:11,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:11,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:11,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:49:11,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:49:11,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:11,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:49:11,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:11,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434769672] [2025-03-09 02:49:11,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434769672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:11,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:11,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105891393] [2025-03-09 02:49:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:11,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:11,374 INFO L87 Difference]: Start difference. First operand 1544 states and 2000 transitions. Second operand has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:11,417 INFO L93 Difference]: Finished difference Result 3121 states and 4073 transitions. [2025-03-09 02:49:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 100 [2025-03-09 02:49:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:11,426 INFO L225 Difference]: With dead ends: 3121 [2025-03-09 02:49:11,426 INFO L226 Difference]: Without dead ends: 1580 [2025-03-09 02:49:11,431 INFO L434 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 [2025-03-09 02:49:11,431 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 3 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:11,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1038 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-09 02:49:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1572. [2025-03-09 02:49:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1168 states have (on average 1.2602739726027397) internal successors, (1472), 1182 states have internal predecessors, (1472), 277 states have call successors, (277), 118 states have call predecessors, (277), 121 states have return successors, (283), 280 states have call predecessors, (283), 277 states have call successors, (283) [2025-03-09 02:49:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2032 transitions. [2025-03-09 02:49:11,479 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2032 transitions. Word has length 100 [2025-03-09 02:49:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:11,481 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2032 transitions. [2025-03-09 02:49:11,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:11,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2032 transitions. [2025-03-09 02:49:11,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-09 02:49:11,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:11,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:11,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:49:11,483 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1255251146, now seen corresponding path program 1 times [2025-03-09 02:49:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:11,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683745077] [2025-03-09 02:49:11,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:11,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:11,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-09 02:49:11,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-09 02:49:11,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:11,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:49:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683745077] [2025-03-09 02:49:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683745077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:11,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:11,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:11,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081478460] [2025-03-09 02:49:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:11,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:11,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:11,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:11,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:11,703 INFO L87 Difference]: Start difference. First operand 1572 states and 2032 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:49:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:11,758 INFO L93 Difference]: Finished difference Result 2413 states and 3107 transitions. [2025-03-09 02:49:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2025-03-09 02:49:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:11,770 INFO L225 Difference]: With dead ends: 2413 [2025-03-09 02:49:11,770 INFO L226 Difference]: Without dead ends: 2411 [2025-03-09 02:49:11,772 INFO L434 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 [2025-03-09 02:49:11,772 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 458 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:11,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1047 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2025-03-09 02:49:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2409. [2025-03-09 02:49:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2409 states, 1795 states have (on average 1.252924791086351) internal successors, (2249), 1814 states have internal predecessors, (2249), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 427 states have call predecessors, (432), 422 states have call successors, (432) [2025-03-09 02:49:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2409 states to 2409 states and 3103 transitions. [2025-03-09 02:49:11,840 INFO L78 Accepts]: Start accepts. Automaton has 2409 states and 3103 transitions. Word has length 99 [2025-03-09 02:49:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 2409 states and 3103 transitions. [2025-03-09 02:49:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:49:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2409 states and 3103 transitions. [2025-03-09 02:49:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 02:49:11,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:11,842 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:11,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:49:11,842 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:11,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -231054466, now seen corresponding path program 1 times [2025-03-09 02:49:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354083065] [2025-03-09 02:49:11,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:49:11,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:49:11,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:11,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 02:49:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354083065] [2025-03-09 02:49:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354083065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:12,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367070421] [2025-03-09 02:49:12,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:12,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:12,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:12,071 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:12,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 02:49:12,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:49:12,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:49:12,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:12,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:12,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 02:49:12,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-09 02:49:12,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367070421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:12,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2025-03-09 02:49:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979302630] [2025-03-09 02:49:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:49:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:12,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:49:12,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:12,602 INFO L87 Difference]: Start difference. First operand 2409 states and 3103 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:12,667 INFO L93 Difference]: Finished difference Result 4730 states and 6104 transitions. [2025-03-09 02:49:12,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:49:12,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 107 [2025-03-09 02:49:12,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:12,678 INFO L225 Difference]: With dead ends: 4730 [2025-03-09 02:49:12,678 INFO L226 Difference]: Without dead ends: 2429 [2025-03-09 02:49:12,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:12,685 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:12,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2082 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2429 states. [2025-03-09 02:49:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2429 to 2419. [2025-03-09 02:49:12,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 1805 states have (on average 1.2515235457063711) internal successors, (2259), 1819 states have internal predecessors, (2259), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-03-09 02:49:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3113 transitions. [2025-03-09 02:49:12,755 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3113 transitions. Word has length 107 [2025-03-09 02:49:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:12,755 INFO L471 AbstractCegarLoop]: Abstraction has 2419 states and 3113 transitions. [2025-03-09 02:49:12,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3113 transitions. [2025-03-09 02:49:12,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:49:12,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:12,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-03-09 02:49:12,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:12,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:12,959 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash 4483571, now seen corresponding path program 1 times [2025-03-09 02:49:12,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:12,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546133363] [2025-03-09 02:49:12,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:13,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:49:13,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:49:13,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:13,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:13,171 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:13,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546133363] [2025-03-09 02:49:13,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546133363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:13,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482192989] [2025-03-09 02:49:13,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:13,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:13,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:13,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:13,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 02:49:13,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:49:13,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:49:13,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:13,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:13,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:13,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:13,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:13,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482192989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:13,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:13,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120381155] [2025-03-09 02:49:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:13,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:13,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:13,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:13,733 INFO L87 Difference]: Start difference. First operand 2419 states and 3113 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:49:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:13,788 INFO L93 Difference]: Finished difference Result 2443 states and 3149 transitions. [2025-03-09 02:49:13,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:13,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 106 [2025-03-09 02:49:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:13,801 INFO L225 Difference]: With dead ends: 2443 [2025-03-09 02:49:13,801 INFO L226 Difference]: Without dead ends: 2442 [2025-03-09 02:49:13,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:13,804 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 5 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:13,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1559 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-09 02:49:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2418. [2025-03-09 02:49:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1805 states have (on average 1.2481994459833794) internal successors, (2253), 1818 states have internal predecessors, (2253), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-03-09 02:49:13,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3107 transitions. [2025-03-09 02:49:13,910 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3107 transitions. Word has length 106 [2025-03-09 02:49:13,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:13,910 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3107 transitions. [2025-03-09 02:49:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:49:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3107 transitions. [2025-03-09 02:49:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 02:49:13,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:13,913 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2025-03-09 02:49:13,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 02:49:14,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 02:49:14,114 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:14,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:14,115 INFO L85 PathProgramCache]: Analyzing trace with hash 138990682, now seen corresponding path program 1 times [2025-03-09 02:49:14,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:14,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135535078] [2025-03-09 02:49:14,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:14,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:49:14,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:49:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135535078] [2025-03-09 02:49:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135535078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873903650] [2025-03-09 02:49:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:14,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:14,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:14,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:14,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 02:49:14,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 02:49:14,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 02:49:14,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:14,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:14,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 1350 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:14,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:14,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873903650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:14,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369225241] [2025-03-09 02:49:14,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:14,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:14,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:14,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:14,982 INFO L87 Difference]: Start difference. First operand 2418 states and 3107 transitions. Second operand has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:49:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:15,060 INFO L93 Difference]: Finished difference Result 2502 states and 3233 transitions. [2025-03-09 02:49:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:15,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 107 [2025-03-09 02:49:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:15,071 INFO L225 Difference]: With dead ends: 2502 [2025-03-09 02:49:15,072 INFO L226 Difference]: Without dead ends: 2501 [2025-03-09 02:49:15,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:15,073 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 8 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:15,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2072 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:15,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2025-03-09 02:49:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 2381. [2025-03-09 02:49:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1769 states have (on average 1.2464669304691915) internal successors, (2205), 1781 states have internal predecessors, (2205), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-03-09 02:49:15,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3059 transitions. [2025-03-09 02:49:15,144 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3059 transitions. Word has length 107 [2025-03-09 02:49:15,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:15,144 INFO L471 AbstractCegarLoop]: Abstraction has 2381 states and 3059 transitions. [2025-03-09 02:49:15,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.333333333333334) internal successors, (92), 7 states have internal predecessors, (92), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-09 02:49:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3059 transitions. [2025-03-09 02:49:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 02:49:15,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:15,147 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2025-03-09 02:49:15,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:49:15,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:49:15,352 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:15,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:15,353 INFO L85 PathProgramCache]: Analyzing trace with hash 922802102, now seen corresponding path program 1 times [2025-03-09 02:49:15,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:15,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725480129] [2025-03-09 02:49:15,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:15,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:15,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 02:49:15,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 02:49:15,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:15,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:15,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725480129] [2025-03-09 02:49:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725480129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450373216] [2025-03-09 02:49:15,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:15,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:15,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:15,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 02:49:15,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-09 02:49:16,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 02:49:16,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:16,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:16,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1301 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:16,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:16,241 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:16,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450373216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:16,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:16,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:16,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597516038] [2025-03-09 02:49:16,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:16,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:16,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:16,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:16,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:16,242 INFO L87 Difference]: Start difference. First operand 2381 states and 3059 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:17,027 INFO L93 Difference]: Finished difference Result 3103 states and 3989 transitions. [2025-03-09 02:49:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 112 [2025-03-09 02:49:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:17,039 INFO L225 Difference]: With dead ends: 3103 [2025-03-09 02:49:17,039 INFO L226 Difference]: Without dead ends: 3101 [2025-03-09 02:49:17,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:17,041 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 958 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:17,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 1339 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:17,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2025-03-09 02:49:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2379. [2025-03-09 02:49:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1769 states have (on average 1.2442057659694743) internal successors, (2201), 1779 states have internal predecessors, (2201), 422 states have call successors, (422), 181 states have call predecessors, (422), 186 states have return successors, (432), 432 states have call predecessors, (432), 422 states have call successors, (432) [2025-03-09 02:49:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3055 transitions. [2025-03-09 02:49:17,112 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3055 transitions. Word has length 112 [2025-03-09 02:49:17,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:17,113 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3055 transitions. [2025-03-09 02:49:17,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-09 02:49:17,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3055 transitions. [2025-03-09 02:49:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 02:49:17,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:17,115 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1] [2025-03-09 02:49:17,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 02:49:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:17,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:17,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1457905352, now seen corresponding path program 1 times [2025-03-09 02:49:17,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:17,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225137837] [2025-03-09 02:49:17,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:17,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 02:49:17,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 02:49:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:17,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:17,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225137837] [2025-03-09 02:49:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225137837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410970720] [2025-03-09 02:49:17,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:17,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:17,498 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:17,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 02:49:17,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 02:49:18,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 02:49:18,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:18,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:18,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:18,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:18,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 02:49:18,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410970720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:18,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:18,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:49:18,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633920595] [2025-03-09 02:49:18,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:18,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:49:18,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:18,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:49:18,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:18,242 INFO L87 Difference]: Start difference. First operand 2379 states and 3055 transitions. Second operand has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-09 02:49:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:19,199 INFO L93 Difference]: Finished difference Result 4647 states and 5978 transitions. [2025-03-09 02:49:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 113 [2025-03-09 02:49:19,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:19,215 INFO L225 Difference]: With dead ends: 4647 [2025-03-09 02:49:19,215 INFO L226 Difference]: Without dead ends: 4645 [2025-03-09 02:49:19,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:49:19,217 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2737 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:19,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 1947 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:49:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-03-09 02:49:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3923. [2025-03-09 02:49:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 2916 states have (on average 1.2448559670781894) internal successors, (3630), 2931 states have internal predecessors, (3630), 699 states have call successors, (699), 299 states have call predecessors, (699), 307 states have return successors, (715), 715 states have call predecessors, (715), 699 states have call successors, (715) [2025-03-09 02:49:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 5044 transitions. [2025-03-09 02:49:19,379 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 5044 transitions. Word has length 113 [2025-03-09 02:49:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:19,379 INFO L471 AbstractCegarLoop]: Abstraction has 3923 states and 5044 transitions. [2025-03-09 02:49:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.0) internal successors, (186), 7 states have internal predecessors, (186), 4 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-09 02:49:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 5044 transitions. [2025-03-09 02:49:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-09 02:49:19,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:19,383 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:19,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:19,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:19,584 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:19,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:19,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1416031263, now seen corresponding path program 1 times [2025-03-09 02:49:19,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:19,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814125218] [2025-03-09 02:49:19,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:19,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:19,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-09 02:49:19,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-09 02:49:19,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:19,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 02:49:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:19,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814125218] [2025-03-09 02:49:19,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814125218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:19,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:19,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146280144] [2025-03-09 02:49:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:19,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:19,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:19,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:19,770 INFO L87 Difference]: Start difference. First operand 3923 states and 5044 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:49:20,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:20,603 INFO L93 Difference]: Finished difference Result 7524 states and 9694 transitions. [2025-03-09 02:49:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:20,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2025-03-09 02:49:20,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:20,621 INFO L225 Difference]: With dead ends: 7524 [2025-03-09 02:49:20,622 INFO L226 Difference]: Without dead ends: 3711 [2025-03-09 02:49:20,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:20,633 INFO L435 NwaCegarLoop]: 962 mSDtfsCounter, 471 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:20,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1441 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:49:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2025-03-09 02:49:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3709. [2025-03-09 02:49:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 2740 states have (on average 1.2306569343065694) internal successors, (3372), 2757 states have internal predecessors, (3372), 679 states have call successors, (679), 283 states have call predecessors, (679), 289 states have return successors, (691), 691 states have call predecessors, (691), 679 states have call successors, (691) [2025-03-09 02:49:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 4742 transitions. [2025-03-09 02:49:20,774 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 4742 transitions. Word has length 135 [2025-03-09 02:49:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 3709 states and 4742 transitions. [2025-03-09 02:49:20,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:49:20,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 4742 transitions. [2025-03-09 02:49:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-09 02:49:20,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:20,784 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:20,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:49:20,784 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:20,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash -241928315, now seen corresponding path program 1 times [2025-03-09 02:49:20,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740401683] [2025-03-09 02:49:20,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:20,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-09 02:49:20,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-09 02:49:20,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:20,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-09 02:49:20,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:20,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740401683] [2025-03-09 02:49:20,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740401683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:20,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:20,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:20,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472221163] [2025-03-09 02:49:20,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:20,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:20,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:20,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:20,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:20,988 INFO L87 Difference]: Start difference. First operand 3709 states and 4742 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-09 02:49:22,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:22,208 INFO L93 Difference]: Finished difference Result 7416 states and 9481 transitions. [2025-03-09 02:49:22,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:22,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 228 [2025-03-09 02:49:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:22,227 INFO L225 Difference]: With dead ends: 7416 [2025-03-09 02:49:22,230 INFO L226 Difference]: Without dead ends: 3045 [2025-03-09 02:49:22,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:22,242 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 422 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:22,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1091 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-09 02:49:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-03-09 02:49:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3044. [2025-03-09 02:49:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2248 states have (on average 1.2215302491103204) internal successors, (2746), 2261 states have internal predecessors, (2746), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-03-09 02:49:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3870 transitions. [2025-03-09 02:49:22,444 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3870 transitions. Word has length 228 [2025-03-09 02:49:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:22,445 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3870 transitions. [2025-03-09 02:49:22,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-09 02:49:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3870 transitions. [2025-03-09 02:49:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-09 02:49:22,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:22,458 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:49:22,458 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -374252060, now seen corresponding path program 1 times [2025-03-09 02:49:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:22,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336188269] [2025-03-09 02:49:22,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:22,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-09 02:49:22,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-09 02:49:22,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:22,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:22,682 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-09 02:49:22,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:22,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336188269] [2025-03-09 02:49:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336188269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126888476] [2025-03-09 02:49:22,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:22,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:22,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:22,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:22,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:22,684 INFO L87 Difference]: Start difference. First operand 3044 states and 3870 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-09 02:49:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:22,783 INFO L93 Difference]: Finished difference Result 6097 states and 7752 transitions. [2025-03-09 02:49:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 228 [2025-03-09 02:49:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:22,795 INFO L225 Difference]: With dead ends: 6097 [2025-03-09 02:49:22,795 INFO L226 Difference]: Without dead ends: 3050 [2025-03-09 02:49:22,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:22,802 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 517 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:22,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1032 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3050 states. [2025-03-09 02:49:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3050 to 3044. [2025-03-09 02:49:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2248 states have (on average 1.2201957295373667) internal successors, (2743), 2261 states have internal predecessors, (2743), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-03-09 02:49:22,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3867 transitions. [2025-03-09 02:49:22,917 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3867 transitions. Word has length 228 [2025-03-09 02:49:22,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:22,917 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3867 transitions. [2025-03-09 02:49:22,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-09 02:49:22,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3867 transitions. [2025-03-09 02:49:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-09 02:49:22,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:22,923 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-03-09 02:49:22,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 02:49:22,923 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:22,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1813571220, now seen corresponding path program 1 times [2025-03-09 02:49:22,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:22,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218964778] [2025-03-09 02:49:22,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:22,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:23,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-09 02:49:23,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-09 02:49:23,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:23,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-09 02:49:23,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218964778] [2025-03-09 02:49:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218964778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:23,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288642661] [2025-03-09 02:49:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:23,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:23,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:23,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:23,129 INFO L87 Difference]: Start difference. First operand 3044 states and 3867 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-09 02:49:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:23,209 INFO L93 Difference]: Finished difference Result 6000 states and 7634 transitions. [2025-03-09 02:49:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:23,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 237 [2025-03-09 02:49:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:23,221 INFO L225 Difference]: With dead ends: 6000 [2025-03-09 02:49:23,221 INFO L226 Difference]: Without dead ends: 3048 [2025-03-09 02:49:23,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:23,229 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 0 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:49:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3048 states. [2025-03-09 02:49:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3048 to 3048. [2025-03-09 02:49:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3048 states, 2252 states have (on average 1.219360568383659) internal successors, (2746), 2265 states have internal predecessors, (2746), 556 states have call successors, (556), 233 states have call predecessors, (556), 239 states have return successors, (568), 568 states have call predecessors, (568), 556 states have call successors, (568) [2025-03-09 02:49:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 3870 transitions. [2025-03-09 02:49:23,350 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 3870 transitions. Word has length 237 [2025-03-09 02:49:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:23,350 INFO L471 AbstractCegarLoop]: Abstraction has 3048 states and 3870 transitions. [2025-03-09 02:49:23,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-09 02:49:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 3870 transitions. [2025-03-09 02:49:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-09 02:49:23,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:23,356 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:23,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 02:49:23,356 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:23,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:23,357 INFO L85 PathProgramCache]: Analyzing trace with hash -443046877, now seen corresponding path program 1 times [2025-03-09 02:49:23,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931556821] [2025-03-09 02:49:23,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:23,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:23,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-09 02:49:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-09 02:49:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-09 02:49:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931556821] [2025-03-09 02:49:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931556821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:23,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169352594] [2025-03-09 02:49:23,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:23,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:23,597 INFO L87 Difference]: Start difference. First operand 3048 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-09 02:49:24,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:24,191 INFO L93 Difference]: Finished difference Result 3168 states and 4006 transitions. [2025-03-09 02:49:24,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 258 [2025-03-09 02:49:24,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:24,197 INFO L225 Difference]: With dead ends: 3168 [2025-03-09 02:49:24,197 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:49:24,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:24,203 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:24,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:49:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:49:24,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:49:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-03-09 02:49:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:49:24,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 258 [2025-03-09 02:49:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:49:24,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-09 02:49:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:49:24,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:49:24,210 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 02:49:24,211 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 02:49:24,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 02:49:24,213 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-09 02:49:24,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:49:28,510 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:49:28,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:49:28 BoogieIcfgContainer [2025-03-09 02:49:28,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:49:28,516 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:49:28,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:49:28,516 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:49:28,516 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:59" (3/4) ... [2025-03-09 02:49:28,518 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:49:28,522 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_idx_inc [2025-03-09 02:49:28,522 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __raw_spin_lock_init [2025-03-09 02:49:28,522 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_exit [2025-03-09 02:49:28,522 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure uspace_ring_map [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_destroy [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_write [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_ring_init [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure list_del [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmem_cache_free [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_head_event [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_poll [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_unmap_user_pages [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _raw_spin_lock_irqsave [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_host_put [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hash_64 [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~int [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_open [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_host_lookup [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure tgt_mmap [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_release_buffers [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kmem_cache_destroy [2025-03-09 02:49:28,523 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spin_unlock_irqrestore [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure destroy_workqueue [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure list_add [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_to_host [2025-03-09 02:49:28,524 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2025-03-09 02:49:28,540 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 157 nodes and edges [2025-03-09 02:49:28,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2025-03-09 02:49:28,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-03-09 02:49:28,545 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 02:49:28,546 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-09 02:49:28,547 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:49:28,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:49:28,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:49:28,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:49:28,679 INFO L158 Benchmark]: Toolchain (without parser) took 32533.27ms. Allocated memory was 142.6MB in the beginning and 880.8MB in the end (delta: 738.2MB). Free memory was 99.0MB in the beginning and 515.1MB in the end (delta: -416.1MB). Peak memory consumption was 320.2MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,679 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:49:28,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1497.75ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 66.2MB in the end (delta: 32.8MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.65ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,681 INFO L158 Benchmark]: Boogie Preprocessor took 178.86ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 70.7MB in the end (delta: -13.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,681 INFO L158 Benchmark]: IcfgBuilder took 1924.38ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 70.7MB in the beginning and 91.0MB in the end (delta: -20.2MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,681 INFO L158 Benchmark]: TraceAbstraction took 28684.41ms. Allocated memory was 251.7MB in the beginning and 880.8MB in the end (delta: 629.1MB). Free memory was 90.3MB in the beginning and 535.9MB in the end (delta: -445.6MB). Peak memory consumption was 428.5MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,681 INFO L158 Benchmark]: Witness Printer took 161.77ms. Allocated memory is still 880.8MB. Free memory was 535.9MB in the beginning and 515.1MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 02:49:28,682 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.15ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1497.75ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 66.2MB in the end (delta: 32.8MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.65ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 57.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.86ms. Allocated memory is still 142.6MB. Free memory was 57.8MB in the beginning and 70.7MB in the end (delta: -13.0MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1924.38ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 70.7MB in the beginning and 91.0MB in the end (delta: -20.2MB). Peak memory consumption was 82.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28684.41ms. Allocated memory was 251.7MB in the beginning and 880.8MB in the end (delta: 629.1MB). Free memory was 90.3MB in the beginning and 535.9MB in the end (delta: -445.6MB). Peak memory consumption was 428.5MB. Max. memory is 16.1GB. * Witness Printer took 161.77ms. Allocated memory is still 880.8MB. Free memory was 535.9MB in the beginning and 515.1MB in the end (delta: 20.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 7332]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7545]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7545]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7600]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7750]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7750]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7740]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7740]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 434 locations, 655 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 25, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6752 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6743 mSDsluCounter, 39060 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24787 mSDsCounter, 490 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1374 IncrementalHoareTripleChecker+Invalid, 1864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 490 mSolverCounterUnsat, 14273 mSDtfsCounter, 1374 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1370 GetRequests, 1301 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3923occurred in iteration=20, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 1738 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3526 NumberOfCodeBlocks, 3526 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3843 ConstructedInterpolants, 0 QuantifiedInterpolants, 5350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 13185 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 40 InterpolantComputations, 21 PerfectInterpolantSequences, 1933/2056 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:49:28,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE