./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /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 --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /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 -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 21:21:36,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:21:36,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 21:21:36,848 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:21:36,849 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:21:36,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:21:36,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:21:36,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:21:36,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:21:36,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:21:36,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:21:36,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:21:36,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:21:36,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:21:36,879 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:21:36,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:21:36,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:21:36,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:21:36,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:21:36,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:21:36,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:21:36,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:21:36,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:21:36,886 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:21:36,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:21:36,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:21:36,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:21:36,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:21:36,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:21:36,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:21:36,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:21:36,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:36,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:21:36,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:21:36,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:21:36,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:21:36,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:21:36,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:21:36,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:21:36,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:21:36,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:21:36,892 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-11 21:21:37,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:21:37,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:21:37,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:21:37,156 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:21:37,157 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:21:37,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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 [2024-10-11 21:21:38,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:21:39,101 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:21:39,105 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 [2024-10-11 21:21:39,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b1a414e0/59f2a28fd5954d1c9e81a4951907d2be/FLAG35f61d2ac [2024-10-11 21:21:39,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b1a414e0/59f2a28fd5954d1c9e81a4951907d2be [2024-10-11 21:21:39,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:21:39,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:21:39,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:39,202 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:21:39,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:21:39,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486bc232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:39, skipping insertion in model container [2024-10-11 21:21:39,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:39" (1/1) ... [2024-10-11 21:21:39,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:21:40,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:40,623 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:21:40,939 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("mfence": : : "memory"); [7332] [2024-10-11 21:21:40,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:41,053 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:21:41,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41 WrapperNode [2024-10-11 21:21:41,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:41,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:41,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:21:41,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:21:41,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,204 INFO L138 Inliner]: procedures = 188, calls = 606, calls flagged for inlining = 75, calls inlined = 50, statements flattened = 1341 [2024-10-11 21:21:41,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:41,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:21:41,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:21:41,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:21:41,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,322 INFO L175 MemorySlicer]: Split 153 memory accesses to 8 slices as follows [2, 31, 9, 21, 65, 5, 8, 12]. 42 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 31, 9, 0, 0, 0, 0, 12]. The 14 writes are split as follows [0, 0, 0, 1, 13, 0, 0, 0]. [2024-10-11 21:21:41,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,371 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:21:41,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:21:41,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:21:41,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:21:41,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (1/1) ... [2024-10-11 21:21:41,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:41,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:41,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:21:41,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:21:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2024-10-11 21:21:41,518 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2024-10-11 21:21:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure uspace_ring_map [2024-10-11 21:21:41,518 INFO L138 BoogieDeclarations]: Found implementation of procedure uspace_ring_map [2024-10-11 21:21:41,518 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_unmap_user_pages [2024-10-11 21:21:41,518 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_unmap_user_pages [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 21:21:41,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 21:21:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 21:21:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure hash_64 [2024-10-11 21:21:41,520 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_64 [2024-10-11 21:21:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_release_buffers [2024-10-11 21:21:41,520 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_release_buffers [2024-10-11 21:21:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 21:21:41,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 21:21:41,520 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2024-10-11 21:21:41,521 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_write [2024-10-11 21:21:41,521 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_write [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 21:21:41,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 21:21:41,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 21:21:41,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_open [2024-10-11 21:21:41,522 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_open [2024-10-11 21:21:41,522 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_destroy [2024-10-11 21:21:41,523 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_destroy [2024-10-11 21:21:41,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 21:21:41,523 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_to_host [2024-10-11 21:21:41,523 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_to_host [2024-10-11 21:21:41,523 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-11 21:21:41,523 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-11 21:21:41,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:21:41,523 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_idx_inc [2024-10-11 21:21:41,523 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_idx_inc [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 21:21:41,524 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_head_event [2024-10-11 21:21:41,524 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_head_event [2024-10-11 21:21:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_put [2024-10-11 21:21:41,525 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_put [2024-10-11 21:21:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2024-10-11 21:21:41,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2024-10-11 21:21:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 21:21:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 21:21:41,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 21:21:41,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 21:21:41,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 21:21:41,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 21:21:41,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 21:21:41,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 21:21:41,527 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2024-10-11 21:21:41,527 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2024-10-11 21:21:41,527 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-10-11 21:21:41,528 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-10-11 21:21:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:21:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 21:21:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 21:21:41,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_exit [2024-10-11 21:21:41,529 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_exit [2024-10-11 21:21:41,529 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 21:21:41,530 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 21:21:41,530 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tgt_cmd_destroy [2024-10-11 21:21:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tgt_cmd_destroy [2024-10-11 21:21:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_ring_init [2024-10-11 21:21:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_ring_init [2024-10-11 21:21:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2024-10-11 21:21:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2024-10-11 21:21:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_free [2024-10-11 21:21:41,531 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_free [2024-10-11 21:21:41,531 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_poll [2024-10-11 21:21:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_poll [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2024-10-11 21:21:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_host_lookup [2024-10-11 21:21:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_host_lookup [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure tgt_mmap [2024-10-11 21:21:41,532 INFO L138 BoogieDeclarations]: Found implementation of procedure tgt_mmap [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:21:41,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2024-10-11 21:21:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2024-10-11 21:21:41,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:21:41,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:21:41,911 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:21:41,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:21:43,087 INFO L? ?]: Removed 655 outVars from TransFormulas that were not future-live. [2024-10-11 21:21:43,089 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:21:43,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:21:43,199 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 21:21:43,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:43 BoogieIcfgContainer [2024-10-11 21:21:43,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:21:43,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:21:43,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:21:43,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:21:43,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:21:39" (1/3) ... [2024-10-11 21:21:43,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551368f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:43, skipping insertion in model container [2024-10-11 21:21:43,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:41" (2/3) ... [2024-10-11 21:21:43,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@551368f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:43, skipping insertion in model container [2024-10-11 21:21:43,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:43" (3/3) ... [2024-10-11 21:21:43,212 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--scsi--scsi_tgt.ko-main.cil.out.i [2024-10-11 21:21:43,228 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:21:43,229 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-11 21:21:43,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:21:43,318 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;@4e2fe37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:21:43,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-11 21:21:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 360 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 252 states have internal predecessors, (332), 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) [2024-10-11 21:21:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 21:21:43,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:43,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:43,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:43,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1150187948, now seen corresponding path program 1 times [2024-10-11 21:21:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:43,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212422518] [2024-10-11 21:21:43,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:43,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212422518] [2024-10-11 21:21:43,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212422518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:43,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:43,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:21:43,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885711347] [2024-10-11 21:21:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:43,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:43,813 INFO L87 Difference]: Start difference. First operand has 360 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 252 states have internal predecessors, (332), 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:44,158 INFO L93 Difference]: Finished difference Result 804 states and 1127 transitions. [2024-10-11 21:21:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:44,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 21:21:44,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:44,179 INFO L225 Difference]: With dead ends: 804 [2024-10-11 21:21:44,180 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 21:21:44,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:44,195 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 112 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:44,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 835 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 21:21:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2024-10-11 21:21:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 275 states have (on average 1.410909090909091) internal successors, (388), 291 states have internal predecessors, (388), 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) [2024-10-11 21:21:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 570 transitions. [2024-10-11 21:21:44,283 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 570 transitions. Word has length 12 [2024-10-11 21:21:44,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:44,284 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 570 transitions. [2024-10-11 21:21:44,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:21:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 570 transitions. [2024-10-11 21:21:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 21:21:44,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:44,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:44,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:21:44,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:44,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash -2130974932, now seen corresponding path program 1 times [2024-10-11 21:21:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:44,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811102696] [2024-10-11 21:21:44,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:44,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 21:21:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:44,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:44,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811102696] [2024-10-11 21:21:44,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811102696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:44,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:44,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:44,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411857257] [2024-10-11 21:21:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:44,503 INFO L87 Difference]: Start difference. First operand 415 states and 570 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-10-11 21:21:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:44,747 INFO L93 Difference]: Finished difference Result 1145 states and 1574 transitions. [2024-10-11 21:21:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2024-10-11 21:21:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:44,752 INFO L225 Difference]: With dead ends: 1145 [2024-10-11 21:21:44,753 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 21:21:44,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:44,755 INFO L432 NwaCegarLoop]: 718 mSDtfsCounter, 456 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:44,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1076 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 21:21:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 712. [2024-10-11 21:21:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 483 states have (on average 1.4037267080745341) internal successors, (678), 500 states have internal predecessors, (678), 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) [2024-10-11 21:21:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 985 transitions. [2024-10-11 21:21:44,809 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 985 transitions. Word has length 15 [2024-10-11 21:21:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:44,809 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 985 transitions. [2024-10-11 21:21:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-10-11 21:21:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 985 transitions. [2024-10-11 21:21:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 21:21:44,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:44,811 INFO L215 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] [2024-10-11 21:21:44,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:21:44,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:44,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:44,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1901937137, now seen corresponding path program 1 times [2024-10-11 21:21:44,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:44,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828832210] [2024-10-11 21:21:44,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:44,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:21:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:44,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:44,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828832210] [2024-10-11 21:21:44,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828832210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:44,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:44,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657955895] [2024-10-11 21:21:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:44,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:44,974 INFO L87 Difference]: Start difference. First operand 712 states and 985 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:21:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:45,915 INFO L93 Difference]: Finished difference Result 1699 states and 2410 transitions. [2024-10-11 21:21:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 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 32 [2024-10-11 21:21:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:45,923 INFO L225 Difference]: With dead ends: 1699 [2024-10-11 21:21:45,925 INFO L226 Difference]: Without dead ends: 982 [2024-10-11 21:21:45,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:45,929 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 217 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:45,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1032 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:21:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-10-11 21:21:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 712. [2024-10-11 21:21:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 483 states have (on average 1.3995859213250517) internal successors, (676), 500 states have internal predecessors, (676), 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) [2024-10-11 21:21:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 983 transitions. [2024-10-11 21:21:46,012 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 983 transitions. Word has length 32 [2024-10-11 21:21:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:46,012 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 983 transitions. [2024-10-11 21:21:46,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:21:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 983 transitions. [2024-10-11 21:21:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 21:21:46,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:46,013 INFO L215 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] [2024-10-11 21:21:46,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:21:46,014 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:46,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1395001579, now seen corresponding path program 1 times [2024-10-11 21:21:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426712789] [2024-10-11 21:21:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:21:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:46,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:46,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426712789] [2024-10-11 21:21:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426712789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339402652] [2024-10-11 21:21:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:46,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:46,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:46,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:46,176 INFO L87 Difference]: Start difference. First operand 712 states and 983 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:46,900 INFO L93 Difference]: Finished difference Result 1709 states and 2430 transitions. [2024-10-11 21:21:46,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 2 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 35 [2024-10-11 21:21:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:46,907 INFO L225 Difference]: With dead ends: 1709 [2024-10-11 21:21:46,907 INFO L226 Difference]: Without dead ends: 998 [2024-10-11 21:21:46,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:46,911 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 220 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:46,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 762 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:21:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-11 21:21:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 720. [2024-10-11 21:21:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 491 states have (on average 1.3971486761710794) internal successors, (686), 508 states have internal predecessors, (686), 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) [2024-10-11 21:21:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 993 transitions. [2024-10-11 21:21:46,955 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 993 transitions. Word has length 35 [2024-10-11 21:21:46,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:46,956 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 993 transitions. [2024-10-11 21:21:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 993 transitions. [2024-10-11 21:21:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 21:21:46,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:46,977 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:46,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:21:46,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:46,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash -826769697, now seen corresponding path program 1 times [2024-10-11 21:21:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972920121] [2024-10-11 21:21:46,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:46,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:21:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:47,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:47,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972920121] [2024-10-11 21:21:47,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972920121] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600078309] [2024-10-11 21:21:47,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:47,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:47,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:47,221 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:47,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:21:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:47,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:47,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:47,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600078309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:47,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:47,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 21:21:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979896611] [2024-10-11 21:21:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:47,645 INFO L87 Difference]: Start difference. First operand 720 states and 993 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-11 21:21:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:47,801 INFO L93 Difference]: Finished difference Result 732 states and 1011 transitions. [2024-10-11 21:21:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:47,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 39 [2024-10-11 21:21:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:47,807 INFO L225 Difference]: With dead ends: 732 [2024-10-11 21:21:47,807 INFO L226 Difference]: Without dead ends: 731 [2024-10-11 21:21:47,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:47,808 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 7 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:47,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 834 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-11 21:21:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 719. [2024-10-11 21:21:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 491 states have (on average 1.3930753564154785) internal successors, (684), 507 states have internal predecessors, (684), 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) [2024-10-11 21:21:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 991 transitions. [2024-10-11 21:21:47,852 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 991 transitions. Word has length 39 [2024-10-11 21:21:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:47,853 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 991 transitions. [2024-10-11 21:21:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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) [2024-10-11 21:21:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 991 transitions. [2024-10-11 21:21:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 21:21:47,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:47,854 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:47,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 21:21:48,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:48,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:48,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:48,056 INFO L85 PathProgramCache]: Analyzing trace with hash 139943641, now seen corresponding path program 1 times [2024-10-11 21:21:48,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:48,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784755963] [2024-10-11 21:21:48,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:48,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:21:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:48,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784755963] [2024-10-11 21:21:48,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784755963] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:48,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519152353] [2024-10-11 21:21:48,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:48,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:48,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:48,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:48,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:21:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:48,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:48,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:48,610 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:48,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519152353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:48,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:48,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 21:21:48,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839346390] [2024-10-11 21:21:48,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:48,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:21:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:21:48,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:48,662 INFO L87 Difference]: Start difference. First operand 719 states and 991 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:49,547 INFO L93 Difference]: Finished difference Result 1019 states and 1472 transitions. [2024-10-11 21:21:49,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-11 21:21:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:49,555 INFO L225 Difference]: With dead ends: 1019 [2024-10-11 21:21:49,556 INFO L226 Difference]: Without dead ends: 1018 [2024-10-11 21:21:49,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:49,558 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 234 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:49,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1312 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 21:21:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-10-11 21:21:49,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 712. [2024-10-11 21:21:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 485 states have (on average 1.3896907216494845) internal successors, (674), 500 states have internal predecessors, (674), 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) [2024-10-11 21:21:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 981 transitions. [2024-10-11 21:21:49,601 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 981 transitions. Word has length 40 [2024-10-11 21:21:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:49,602 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 981 transitions. [2024-10-11 21:21:49,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 981 transitions. [2024-10-11 21:21:49,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 21:21:49,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:49,603 INFO L215 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] [2024-10-11 21:21:49,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:21:49,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:49,805 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:49,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1250717639, now seen corresponding path program 1 times [2024-10-11 21:21:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:49,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186652718] [2024-10-11 21:21:49,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:21:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 21:21:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:49,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186652718] [2024-10-11 21:21:49,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186652718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:49,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:49,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:49,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072709486] [2024-10-11 21:21:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:49,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:49,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:49,929 INFO L87 Difference]: Start difference. First operand 712 states and 981 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:50,613 INFO L93 Difference]: Finished difference Result 1702 states and 2416 transitions. [2024-10-11 21:21:50,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 2 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 [2024-10-11 21:21:50,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:50,621 INFO L225 Difference]: With dead ends: 1702 [2024-10-11 21:21:50,621 INFO L226 Difference]: Without dead ends: 991 [2024-10-11 21:21:50,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:50,625 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 220 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:50,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 760 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:21:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-10-11 21:21:50,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 721. [2024-10-11 21:21:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 494 states have (on average 1.3825910931174088) internal successors, (683), 509 states have internal predecessors, (683), 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) [2024-10-11 21:21:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 990 transitions. [2024-10-11 21:21:50,664 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 990 transitions. Word has length 43 [2024-10-11 21:21:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:50,665 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 990 transitions. [2024-10-11 21:21:50,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 21:21:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 990 transitions. [2024-10-11 21:21:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 21:21:50,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:50,667 INFO L215 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] [2024-10-11 21:21:50,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:21:50,669 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:50,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1288038419, now seen corresponding path program 1 times [2024-10-11 21:21:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722526372] [2024-10-11 21:21:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:50,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:21:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 21:21:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722526372] [2024-10-11 21:21:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722526372] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981484640] [2024-10-11 21:21:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:50,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:50,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:50,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:50,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:21:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:21:51,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:21:51,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981484640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:51,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:51,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-10-11 21:21:51,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844021588] [2024-10-11 21:21:51,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:51,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:51,196 INFO L87 Difference]: Start difference. First operand 721 states and 990 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-10-11 21:21:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:51,401 INFO L93 Difference]: Finished difference Result 1451 states and 1993 transitions. [2024-10-11 21:21:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:51,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 46 [2024-10-11 21:21:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:51,407 INFO L225 Difference]: With dead ends: 1451 [2024-10-11 21:21:51,407 INFO L226 Difference]: Without dead ends: 721 [2024-10-11 21:21:51,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:51,410 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 1 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:51,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1631 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-10-11 21:21:51,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2024-10-11 21:21:51,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 494 states have (on average 1.3785425101214575) internal successors, (681), 507 states have internal predecessors, (681), 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) [2024-10-11 21:21:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 988 transitions. [2024-10-11 21:21:51,441 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 988 transitions. Word has length 46 [2024-10-11 21:21:51,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:51,441 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 988 transitions. [2024-10-11 21:21:51,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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) [2024-10-11 21:21:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 988 transitions. [2024-10-11 21:21:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:21:51,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:51,442 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:51,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:21:51,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:51,643 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:51,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1952597418, now seen corresponding path program 1 times [2024-10-11 21:21:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:51,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765888335] [2024-10-11 21:21:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:21:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765888335] [2024-10-11 21:21:51,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765888335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:51,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747162256] [2024-10-11 21:21:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:51,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:51,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:51,879 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:51,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:21:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:21:52,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 21:21:52,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747162256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:21:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233777958] [2024-10-11 21:21:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:52,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:52,276 INFO L87 Difference]: Start difference. First operand 721 states and 988 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:52,472 INFO L93 Difference]: Finished difference Result 1449 states and 1987 transitions. [2024-10-11 21:21:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-10-11 21:21:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:52,479 INFO L225 Difference]: With dead ends: 1449 [2024-10-11 21:21:52,479 INFO L226 Difference]: Without dead ends: 729 [2024-10-11 21:21:52,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:52,482 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 0 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:52,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1640 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-11 21:21:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-10-11 21:21:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 500 states have (on average 1.374) internal successors, (687), 513 states have internal predecessors, (687), 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) [2024-10-11 21:21:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 998 transitions. [2024-10-11 21:21:52,515 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 998 transitions. Word has length 69 [2024-10-11 21:21:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:52,516 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 998 transitions. [2024-10-11 21:21:52,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 998 transitions. [2024-10-11 21:21:52,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:21:52,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:52,518 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:52,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:52,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 21:21:52,719 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1934369784, now seen corresponding path program 1 times [2024-10-11 21:21:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783350695] [2024-10-11 21:21:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:53,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783350695] [2024-10-11 21:21:53,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783350695] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:53,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455242090] [2024-10-11 21:21:53,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:53,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:53,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:53,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:21:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:53,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:53,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:53,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455242090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:53,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:53,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 21:21:53,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845781042] [2024-10-11 21:21:53,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:53,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:53,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:53,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:53,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:53,376 INFO L87 Difference]: Start difference. First operand 729 states and 998 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-11 21:21:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:53,503 INFO L93 Difference]: Finished difference Result 729 states and 998 transitions. [2024-10-11 21:21:53,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:53,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 68 [2024-10-11 21:21:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:53,508 INFO L225 Difference]: With dead ends: 729 [2024-10-11 21:21:53,509 INFO L226 Difference]: Without dead ends: 728 [2024-10-11 21:21:53,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:53,510 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 1 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:53,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 815 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-10-11 21:21:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 728. [2024-10-11 21:21:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 500 states have (on average 1.368) internal successors, (684), 512 states have internal predecessors, (684), 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) [2024-10-11 21:21:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 995 transitions. [2024-10-11 21:21:53,541 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 995 transitions. Word has length 68 [2024-10-11 21:21:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:53,541 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 995 transitions. [2024-10-11 21:21:53,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-10-11 21:21:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 995 transitions. [2024-10-11 21:21:53,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:21:53,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:53,543 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:53,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 21:21:53,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 21:21:53,744 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)] === [2024-10-11 21:21:53,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash -164078721, now seen corresponding path program 1 times [2024-10-11 21:21:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413482279] [2024-10-11 21:21:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:53,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413482279] [2024-10-11 21:21:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413482279] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589655137] [2024-10-11 21:21:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:53,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:53,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:53,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:21:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:54,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:54,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:54,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:54,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589655137] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:54,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:54,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2024-10-11 21:21:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461008] [2024-10-11 21:21:54,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:54,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:21:54,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:21:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:54,374 INFO L87 Difference]: Start difference. First operand 728 states and 995 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:55,419 INFO L93 Difference]: Finished difference Result 1022 states and 1469 transitions. [2024-10-11 21:21:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:21:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2024-10-11 21:21:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:55,427 INFO L225 Difference]: With dead ends: 1022 [2024-10-11 21:21:55,427 INFO L226 Difference]: Without dead ends: 1003 [2024-10-11 21:21:55,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:21:55,428 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 315 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:55,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1100 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 21:21:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-10-11 21:21:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 709. [2024-10-11 21:21:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 487 states have (on average 1.3655030800821355) internal successors, (665), 497 states have internal predecessors, (665), 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) [2024-10-11 21:21:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 971 transitions. [2024-10-11 21:21:55,471 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 971 transitions. Word has length 69 [2024-10-11 21:21:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:55,471 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 971 transitions. [2024-10-11 21:21:55,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 971 transitions. [2024-10-11 21:21:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-11 21:21:55,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:55,473 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:55,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 21:21:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:21:55,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -74826515, now seen corresponding path program 1 times [2024-10-11 21:21:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609574137] [2024-10-11 21:21:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:55,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609574137] [2024-10-11 21:21:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609574137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946241336] [2024-10-11 21:21:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:55,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:55,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:55,844 INFO L87 Difference]: Start difference. First operand 709 states and 971 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:57,200 INFO L93 Difference]: Finished difference Result 2558 states and 3630 transitions. [2024-10-11 21:21:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 3 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 78 [2024-10-11 21:21:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:57,211 INFO L225 Difference]: With dead ends: 2558 [2024-10-11 21:21:57,212 INFO L226 Difference]: Without dead ends: 1850 [2024-10-11 21:21:57,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:21:57,215 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 855 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:57,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 999 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 21:21:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-10-11 21:21:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1286. [2024-10-11 21:21:57,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 882 states have (on average 1.3435374149659864) internal successors, (1185), 896 states have internal predecessors, (1185), 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) [2024-10-11 21:21:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1745 transitions. [2024-10-11 21:21:57,283 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1745 transitions. Word has length 78 [2024-10-11 21:21:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:57,283 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1745 transitions. [2024-10-11 21:21:57,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1745 transitions. [2024-10-11 21:21:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:21:57,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:57,288 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:57,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 21:21:57,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:57,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -218695418, now seen corresponding path program 1 times [2024-10-11 21:21:57,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:57,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399714271] [2024-10-11 21:21:57,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:57,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:21:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399714271] [2024-10-11 21:21:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399714271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121986622] [2024-10-11 21:21:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:57,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:57,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:57,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:57,454 INFO L87 Difference]: Start difference. First operand 1286 states and 1745 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:58,190 INFO L93 Difference]: Finished difference Result 3157 states and 4452 transitions. [2024-10-11 21:21:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 3 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 81 [2024-10-11 21:21:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:58,201 INFO L225 Difference]: With dead ends: 3157 [2024-10-11 21:21:58,202 INFO L226 Difference]: Without dead ends: 1872 [2024-10-11 21:21:58,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:58,207 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 221 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:58,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 917 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:21:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-10-11 21:21:58,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1302. [2024-10-11 21:21:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1302 states, 898 states have (on average 1.341870824053452) internal successors, (1205), 912 states have internal predecessors, (1205), 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) [2024-10-11 21:21:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1302 states to 1302 states and 1765 transitions. [2024-10-11 21:21:58,279 INFO L78 Accepts]: Start accepts. Automaton has 1302 states and 1765 transitions. Word has length 81 [2024-10-11 21:21:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:58,280 INFO L471 AbstractCegarLoop]: Abstraction has 1302 states and 1765 transitions. [2024-10-11 21:21:58,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:58,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1302 states and 1765 transitions. [2024-10-11 21:21:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 21:21:58,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:58,282 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:58,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:21:58,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:58,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1071336157, now seen corresponding path program 1 times [2024-10-11 21:21:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318646624] [2024-10-11 21:21:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:21:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:21:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:21:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:21:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:21:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 21:21:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:21:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318646624] [2024-10-11 21:21:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318646624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:58,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:58,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:58,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771497382] [2024-10-11 21:21:58,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:21:58,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:21:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:58,552 INFO L87 Difference]: Start difference. First operand 1302 states and 1765 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:59,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:59,753 INFO L93 Difference]: Finished difference Result 2844 states and 4043 transitions. [2024-10-11 21:21:59,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:21:59,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 4 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 82 [2024-10-11 21:21:59,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:59,769 INFO L225 Difference]: With dead ends: 2844 [2024-10-11 21:21:59,769 INFO L226 Difference]: Without dead ends: 2842 [2024-10-11 21:21:59,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:59,771 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 1024 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:59,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 996 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [680 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 21:21:59,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2024-10-11 21:21:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1996. [2024-10-11 21:21:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1382 states have (on average 1.3321273516642547) internal successors, (1841), 1401 states have internal predecessors, (1841), 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) [2024-10-11 21:21:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2695 transitions. [2024-10-11 21:21:59,914 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2695 transitions. Word has length 82 [2024-10-11 21:21:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:59,914 INFO L471 AbstractCegarLoop]: Abstraction has 1996 states and 2695 transitions. [2024-10-11 21:21:59,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:21:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2695 transitions. [2024-10-11 21:21:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:21:59,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:59,916 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:59,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:21:59,916 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:21:59,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1028595637, now seen corresponding path program 1 times [2024-10-11 21:21:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747578590] [2024-10-11 21:21:59,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:22:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:22:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747578590] [2024-10-11 21:22:00,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747578590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80166855] [2024-10-11 21:22:00,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:00,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:00,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:00,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:00,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:22:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:00,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:22:00,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 21:22:00,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80166855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:22:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554429208] [2024-10-11 21:22:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:00,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:22:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:00,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:22:00,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:00,551 INFO L87 Difference]: Start difference. First operand 1996 states and 2695 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) [2024-10-11 21:22:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:00,764 INFO L93 Difference]: Finished difference Result 3926 states and 5309 transitions. [2024-10-11 21:22:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:22:00,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 85 [2024-10-11 21:22:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:00,774 INFO L225 Difference]: With dead ends: 3926 [2024-10-11 21:22:00,774 INFO L226 Difference]: Without dead ends: 2016 [2024-10-11 21:22:00,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:00,781 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1597 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:00,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1597 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:22:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-10-11 21:22:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 2006. [2024-10-11 21:22:00,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 1392 states have (on average 1.3297413793103448) internal successors, (1851), 1406 states have internal predecessors, (1851), 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) [2024-10-11 21:22:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2705 transitions. [2024-10-11 21:22:00,878 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2705 transitions. Word has length 85 [2024-10-11 21:22:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:00,879 INFO L471 AbstractCegarLoop]: Abstraction has 2006 states and 2705 transitions. [2024-10-11 21:22:00,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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) [2024-10-11 21:22:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2705 transitions. [2024-10-11 21:22:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 21:22:00,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:00,881 INFO L215 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] [2024-10-11 21:22:00,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 21:22:01,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:01,082 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:01,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:01,083 INFO L85 PathProgramCache]: Analyzing trace with hash 66029821, now seen corresponding path program 1 times [2024-10-11 21:22:01,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:01,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180692922] [2024-10-11 21:22:01,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:01,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:01,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180692922] [2024-10-11 21:22:01,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180692922] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:01,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765809792] [2024-10-11 21:22:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:01,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:01,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:01,322 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:01,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:22:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:01,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:01,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:01,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:01,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765809792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:01,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 21:22:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612403165] [2024-10-11 21:22:01,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:01,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:22:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:01,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:22:01,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:01,786 INFO L87 Difference]: Start difference. First operand 2006 states and 2705 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-10-11 21:22:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:01,919 INFO L93 Difference]: Finished difference Result 2030 states and 2741 transitions. [2024-10-11 21:22:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:22:01,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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 84 [2024-10-11 21:22:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:01,929 INFO L225 Difference]: With dead ends: 2030 [2024-10-11 21:22:01,930 INFO L226 Difference]: Without dead ends: 2029 [2024-10-11 21:22:01,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:01,931 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 5 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:01,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 805 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:22:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-11 21:22:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2005. [2024-10-11 21:22:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1392 states have (on average 1.3254310344827587) internal successors, (1845), 1405 states have internal predecessors, (1845), 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) [2024-10-11 21:22:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2699 transitions. [2024-10-11 21:22:02,025 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2699 transitions. Word has length 84 [2024-10-11 21:22:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:02,026 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2699 transitions. [2024-10-11 21:22:02,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-10-11 21:22:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2699 transitions. [2024-10-11 21:22:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 21:22:02,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:02,028 INFO L215 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] [2024-10-11 21:22:02,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:22:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 21:22:02,229 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)] === [2024-10-11 21:22:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2046924505, now seen corresponding path program 1 times [2024-10-11 21:22:02,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:02,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773306157] [2024-10-11 21:22:02,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773306157] [2024-10-11 21:22:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773306157] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466318356] [2024-10-11 21:22:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:02,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:02,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:22:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:02,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:02,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:02,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:22:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466318356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:22:02,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:22:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2024-10-11 21:22:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078186409] [2024-10-11 21:22:02,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:22:02,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 21:22:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 21:22:02,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:02,943 INFO L87 Difference]: Start difference. First operand 2005 states and 2699 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:22:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:03,842 INFO L93 Difference]: Finished difference Result 2915 states and 4151 transitions. [2024-10-11 21:22:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:22:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 85 [2024-10-11 21:22:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:03,855 INFO L225 Difference]: With dead ends: 2915 [2024-10-11 21:22:03,855 INFO L226 Difference]: Without dead ends: 2914 [2024-10-11 21:22:03,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:22:03,857 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 234 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:03,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1163 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:22:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2024-10-11 21:22:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1986. [2024-10-11 21:22:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1374 states have (on average 1.3209606986899562) internal successors, (1815), 1386 states have internal predecessors, (1815), 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) [2024-10-11 21:22:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2669 transitions. [2024-10-11 21:22:03,973 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2669 transitions. Word has length 85 [2024-10-11 21:22:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:03,973 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2669 transitions. [2024-10-11 21:22:03,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 21:22:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2669 transitions. [2024-10-11 21:22:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 21:22:03,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:03,976 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:03,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 21:22:04,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:22:04,177 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -433434216, now seen corresponding path program 1 times [2024-10-11 21:22:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117810571] [2024-10-11 21:22:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:22:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117810571] [2024-10-11 21:22:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117810571] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665833476] [2024-10-11 21:22:04,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:04,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:04,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:04,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:22:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:04,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:04,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:05,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:22:05,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665833476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:05,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:22:05,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 21:22:05,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554457275] [2024-10-11 21:22:05,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:05,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:22:05,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:05,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:22:05,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:22:05,044 INFO L87 Difference]: Start difference. First operand 1986 states and 2669 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-10-11 21:22:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:05,378 INFO L93 Difference]: Finished difference Result 2591 states and 3483 transitions. [2024-10-11 21:22:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:22:05,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 94 [2024-10-11 21:22:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:05,390 INFO L225 Difference]: With dead ends: 2591 [2024-10-11 21:22:05,390 INFO L226 Difference]: Without dead ends: 2589 [2024-10-11 21:22:05,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:22:05,392 INFO L432 NwaCegarLoop]: 760 mSDtfsCounter, 811 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:05,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 990 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:22:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2024-10-11 21:22:05,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 1984. [2024-10-11 21:22:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1984 states, 1374 states have (on average 1.3180494905385736) internal successors, (1811), 1384 states have internal predecessors, (1811), 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) [2024-10-11 21:22:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1984 states to 1984 states and 2665 transitions. [2024-10-11 21:22:05,512 INFO L78 Accepts]: Start accepts. Automaton has 1984 states and 2665 transitions. Word has length 94 [2024-10-11 21:22:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 1984 states and 2665 transitions. [2024-10-11 21:22:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2024-10-11 21:22:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1984 states and 2665 transitions. [2024-10-11 21:22:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 21:22:05,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:05,515 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:05,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 21:22:05,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 21:22:05,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:05,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -551558105, now seen corresponding path program 1 times [2024-10-11 21:22:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485437544] [2024-10-11 21:22:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:22:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:05,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:05,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485437544] [2024-10-11 21:22:05,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485437544] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:22:05,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136521796] [2024-10-11 21:22:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:05,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:22:05,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:22:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 21:22:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:06,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:22:06,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:22:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:06,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:22:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 21:22:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136521796] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:22:06,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:22:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 2, 3] total 9 [2024-10-11 21:22:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715933737] [2024-10-11 21:22:06,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:22:06,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 21:22:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 21:22:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:22:06,601 INFO L87 Difference]: Start difference. First operand 1984 states and 2665 transitions. Second operand has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 21:22:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:09,626 INFO L93 Difference]: Finished difference Result 5565 states and 7904 transitions. [2024-10-11 21:22:09,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 21:22:09,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (19), 5 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 95 [2024-10-11 21:22:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:09,654 INFO L225 Difference]: With dead ends: 5565 [2024-10-11 21:22:09,654 INFO L226 Difference]: Without dead ends: 5563 [2024-10-11 21:22:09,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2024-10-11 21:22:09,658 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 4333 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 2797 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4564 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 4299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2797 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:09,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4564 Valid, 1365 Invalid, 4299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2797 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 21:22:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5563 states. [2024-10-11 21:22:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5563 to 3272. [2024-10-11 21:22:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3272 states, 2265 states have (on average 1.3187637969094923) internal successors, (2987), 2280 states have internal predecessors, (2987), 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) [2024-10-11 21:22:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4401 transitions. [2024-10-11 21:22:09,904 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4401 transitions. Word has length 95 [2024-10-11 21:22:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:09,904 INFO L471 AbstractCegarLoop]: Abstraction has 3272 states and 4401 transitions. [2024-10-11 21:22:09,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 17.88888888888889) internal successors, (161), 7 states have internal predecessors, (161), 4 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-11 21:22:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4401 transitions. [2024-10-11 21:22:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 21:22:09,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:09,910 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:09,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 21:22:10,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:22:10,111 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:10,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2044634320, now seen corresponding path program 1 times [2024-10-11 21:22:10,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:10,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712347297] [2024-10-11 21:22:10,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:10,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:22:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 21:22:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 21:22:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 21:22:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712347297] [2024-10-11 21:22:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712347297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:22:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029417733] [2024-10-11 21:22:10,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:10,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:22:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:22:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:22:10,337 INFO L87 Difference]: Start difference. First operand 3272 states and 4401 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:22:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:11,917 INFO L93 Difference]: Finished difference Result 7684 states and 10698 transitions. [2024-10-11 21:22:11,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:22:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 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 116 [2024-10-11 21:22:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:11,939 INFO L225 Difference]: With dead ends: 7684 [2024-10-11 21:22:11,939 INFO L226 Difference]: Without dead ends: 4500 [2024-10-11 21:22:11,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:11,950 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 667 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:11,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1656 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 21:22:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2024-10-11 21:22:12,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3098. [2024-10-11 21:22:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2129 states have (on average 1.299671207139502) internal successors, (2767), 2146 states have internal predecessors, (2767), 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) [2024-10-11 21:22:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4137 transitions. [2024-10-11 21:22:12,258 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4137 transitions. Word has length 116 [2024-10-11 21:22:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:12,258 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4137 transitions. [2024-10-11 21:22:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 21:22:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4137 transitions. [2024-10-11 21:22:12,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 21:22:12,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:12,267 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 21:22:12,267 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1621721270, now seen corresponding path program 1 times [2024-10-11 21:22:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398578201] [2024-10-11 21:22:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:22:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:22:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 21:22:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 21:22:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 21:22:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 21:22:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 21:22:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-10-11 21:22:12,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398578201] [2024-10-11 21:22:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398578201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:12,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:22:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539201358] [2024-10-11 21:22:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:12,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:22:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:22:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:22:12,578 INFO L87 Difference]: Start difference. First operand 3098 states and 4137 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:22:13,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:13,862 INFO L93 Difference]: Finished difference Result 7598 states and 10506 transitions. [2024-10-11 21:22:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:22:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (12), 4 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 194 [2024-10-11 21:22:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:13,881 INFO L225 Difference]: With dead ends: 7598 [2024-10-11 21:22:13,881 INFO L226 Difference]: Without dead ends: 3662 [2024-10-11 21:22:13,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:22:13,894 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1088 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:13,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 971 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 21:22:13,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2024-10-11 21:22:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 2539. [2024-10-11 21:22:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 1743 states have (on average 1.2891566265060241) internal successors, (2247), 1756 states have internal predecessors, (2247), 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) [2024-10-11 21:22:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 3371 transitions. [2024-10-11 21:22:14,087 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 3371 transitions. Word has length 194 [2024-10-11 21:22:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:14,087 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 3371 transitions. [2024-10-11 21:22:14,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 21:22:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 3371 transitions. [2024-10-11 21:22:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-11 21:22:14,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:14,094 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:14,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 21:22:14,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:14,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:14,095 INFO L85 PathProgramCache]: Analyzing trace with hash -946561144, now seen corresponding path program 1 times [2024-10-11 21:22:14,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:14,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735020390] [2024-10-11 21:22:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:14,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 21:22:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 21:22:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 21:22:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 21:22:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 21:22:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 21:22:14,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-11 21:22:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 21:22:14,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:14,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735020390] [2024-10-11 21:22:14,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735020390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:14,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:14,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:22:14,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251203674] [2024-10-11 21:22:14,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:14,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:22:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:22:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:14,425 INFO L87 Difference]: Start difference. First operand 2539 states and 3371 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:22:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:15,673 INFO L93 Difference]: Finished difference Result 6211 states and 8545 transitions. [2024-10-11 21:22:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:22:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 4 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 194 [2024-10-11 21:22:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:15,692 INFO L225 Difference]: With dead ends: 6211 [2024-10-11 21:22:15,692 INFO L226 Difference]: Without dead ends: 3667 [2024-10-11 21:22:15,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:22:15,702 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 850 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:15,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 870 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 21:22:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states. [2024-10-11 21:22:15,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 2545. [2024-10-11 21:22:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 1749 states have (on average 1.2864493996569468) internal successors, (2250), 1762 states have internal predecessors, (2250), 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) [2024-10-11 21:22:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 3374 transitions. [2024-10-11 21:22:15,872 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 3374 transitions. Word has length 194 [2024-10-11 21:22:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 3374 transitions. [2024-10-11 21:22:15,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 21:22:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 3374 transitions. [2024-10-11 21:22:15,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-11 21:22:15,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:15,880 INFO L215 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:22:15,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 21:22:15,880 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1364366810, now seen corresponding path program 1 times [2024-10-11 21:22:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:15,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344100256] [2024-10-11 21:22:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:15,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 21:22:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 21:22:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 21:22:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 21:22:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 21:22:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 21:22:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 21:22:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 21:22:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 21:22:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-11 21:22:16,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:16,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344100256] [2024-10-11 21:22:16,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344100256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:16,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:16,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:22:16,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320177043] [2024-10-11 21:22:16,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:16,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:22:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:16,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:22:16,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:16,223 INFO L87 Difference]: Start difference. First operand 2545 states and 3374 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:22:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:17,135 INFO L93 Difference]: Finished difference Result 6142 states and 8454 transitions. [2024-10-11 21:22:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:22:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 4 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 201 [2024-10-11 21:22:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:17,150 INFO L225 Difference]: With dead ends: 6142 [2024-10-11 21:22:17,150 INFO L226 Difference]: Without dead ends: 3671 [2024-10-11 21:22:17,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:22:17,159 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 379 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:17,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1120 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:22:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-10-11 21:22:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 2549. [2024-10-11 21:22:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 1753 states have (on average 1.2852253280091273) internal successors, (2253), 1766 states have internal predecessors, (2253), 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) [2024-10-11 21:22:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 3377 transitions. [2024-10-11 21:22:17,379 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 3377 transitions. Word has length 201 [2024-10-11 21:22:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:17,380 INFO L471 AbstractCegarLoop]: Abstraction has 2549 states and 3377 transitions. [2024-10-11 21:22:17,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:22:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 3377 transitions. [2024-10-11 21:22:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 21:22:17,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:22:17,386 INFO L215 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, 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, 1, 1] [2024-10-11 21:22:17,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 21:22:17,386 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2024-10-11 21:22:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:22:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1903851455, now seen corresponding path program 1 times [2024-10-11 21:22:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:22:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968126922] [2024-10-11 21:22:17,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:22:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:22:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:22:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:22:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 21:22:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 21:22:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 21:22:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 21:22:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 21:22:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 21:22:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 21:22:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 21:22:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 21:22:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 21:22:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 21:22:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:22:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 21:22:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 21:22:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-10-11 21:22:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:22:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-10-11 21:22:17,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:22:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968126922] [2024-10-11 21:22:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968126922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:22:17,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:22:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:22:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553847354] [2024-10-11 21:22:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:22:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:22:17,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:22:17,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:22:17,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:22:17,698 INFO L87 Difference]: Start difference. First operand 2549 states and 3377 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 21:22:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:22:17,793 INFO L93 Difference]: Finished difference Result 2648 states and 3494 transitions. [2024-10-11 21:22:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:22:17,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 4 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 216 [2024-10-11 21:22:17,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:22:17,797 INFO L225 Difference]: With dead ends: 2648 [2024-10-11 21:22:17,797 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:22:17,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:22:17,803 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 46 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:22:17,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 178 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:22:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:22:17,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:22:17,804 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) [2024-10-11 21:22:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:22:17,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 216 [2024-10-11 21:22:17,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:22:17,807 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:22:17,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 21:22:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:22:17,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:22:17,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2024-10-11 21:22:17,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location uspace_ring_mapErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2024-10-11 21:22:17,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2024-10-11 21:22:17,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_exitErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2024-10-11 21:22:17,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2024-10-11 21:22:17,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location tgt_ring_initErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2024-10-11 21:22:17,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2024-10-11 21:22:17,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2024-10-11 21:22:17,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2024-10-11 21:22:17,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2024-10-11 21:22:17,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 21:22:17,815 INFO L407 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] [2024-10-11 21:22:17,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:22:33,907 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:22:33,937 WARN L155 FloydHoareUtils]: Requires clause for tgt_ring_idx_inc contained old-variable. Original clause: (and (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)))) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) .cse0))) [2024-10-11 21:22:33,963 WARN L155 FloydHoareUtils]: Requires clause for scsi_tgt_cmd_destroy contained old-variable. Original clause: (and (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)))) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) .cse0))) [2024-10-11 21:22:33,969 WARN L155 FloydHoareUtils]: Requires clause for tgt_write contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)))) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) .cse0))) [2024-10-11 21:22:33,975 WARN L155 FloydHoareUtils]: Requires clause for tgt_ring_init contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_1~0 0) (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= |old(#valid)| |#valid|) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: (and (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)) [2024-10-11 21:22:34,006 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-11 21:22:34,007 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:34,007 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:34,007 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 [2024-10-11 21:22:34,008 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 [2024-10-11 21:22:34,013 WARN L155 FloydHoareUtils]: Requires clause for tgt_open contained old-variable. Original clause: (and (= |#memory_int#4| |old(#memory_int#4)|) (= |old(#memory_$Pointer$#4.base)| |#memory_$Pointer$#4.base|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)))) (= |#memory_$Pointer$#4.offset| |old(#memory_$Pointer$#4.offset)|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) .cse0))) [2024-10-11 21:22:34,017 WARN L155 FloydHoareUtils]: Requires clause for scsi_host_lookup contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_1~0 1) (= ~ref_cnt~0 0) .cse0))) [2024-10-11 21:22:34,031 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (let ((.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (<= ~ref_cnt~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_1~0 1) .cse0) (and (= ~ldv_state_variable_1~0 2) (<= 1 ~ref_cnt~0) .cse0 (<= ~ref_cnt~0 1)) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0)))) (= |old(#valid)| |#valid|)) Eliminated clause: (let ((.cse1 (= ~ref_cnt~0 0)) (.cse0 (= ~ldv_state_variable_0~0 3))) (or (and (= ~ldv_state_variable_1~0 2) (= ~ref_cnt~0 1) .cse0) (and (= ~ldv_state_variable_0~0 1) (= ~ldv_retval_1~0 0) (= ~ldv_state_variable_1~0 0) .cse1) (and (= ~ldv_state_variable_1~0 1) .cse1 .cse0))) [2024-10-11 21:22:34,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:22:34 BoogieIcfgContainer [2024-10-11 21:22:34,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:22:34,047 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:22:34,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:22:34,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:22:34,048 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:43" (3/4) ... [2024-10-11 21:22:34,050 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_idx_inc [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __raw_spin_lock_init [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_exit [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure uspace_ring_map [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printk [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_destroy [2024-10-11 21:22:34,053 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_write [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_ring_init [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmem_cache_free [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_head_event [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_poll [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_unmap_user_pages [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _raw_spin_lock_irqsave [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_host_put [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hash_64 [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~int [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2024-10-11 21:22:34,054 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_open [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_host_lookup [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure tgt_mmap [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_release_buffers [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kmem_cache_destroy [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure spin_unlock_irqrestore [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure destroy_workqueue [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure _copy_from_user [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure scsi_tgt_cmd_to_host [2024-10-11 21:22:34,055 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure spinlock_check [2024-10-11 21:22:34,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 202 nodes and edges [2024-10-11 21:22:34,087 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2024-10-11 21:22:34,089 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-10-11 21:22:34,091 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 21:22:34,092 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 21:22:34,094 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:22:34,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:22:34,317 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:22:34,317 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:22:34,317 INFO L158 Benchmark]: Toolchain (without parser) took 55116.96ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 134.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 501.3MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,318 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:22:34,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1852.32ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 90.9MB in the end (delta: 43.9MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.38ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,319 INFO L158 Benchmark]: Boogie Preprocessor took 222.59ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 81.7MB in the beginning and 229.7MB in the end (delta: -148.0MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,319 INFO L158 Benchmark]: RCFGBuilder took 1774.54ms. Allocated memory is still 295.7MB. Free memory was 229.7MB in the beginning and 161.7MB in the end (delta: 68.0MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,319 INFO L158 Benchmark]: TraceAbstraction took 50841.72ms. Allocated memory was 295.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 160.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-10-11 21:22:34,319 INFO L158 Benchmark]: Witness Printer took 270.05ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 21:22:34,321 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.16ms. Allocated memory is still 109.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1852.32ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 90.9MB in the end (delta: 43.9MB). Peak memory consumption was 89.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.38ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 222.59ms. Allocated memory was 167.8MB in the beginning and 295.7MB in the end (delta: 127.9MB). Free memory was 81.7MB in the beginning and 229.7MB in the end (delta: -148.0MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1774.54ms. Allocated memory is still 295.7MB. Free memory was 229.7MB in the beginning and 161.7MB in the end (delta: 68.0MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * TraceAbstraction took 50841.72ms. Allocated memory was 295.7MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 160.6MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 270.05ms. Allocated memory is still 1.9GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ref_cnt~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_state_variable_0~0 * 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: 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 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 32 procedures, 360 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 34.5s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13489 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12297 mSDsluCounter, 25424 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16796 mSDsCounter, 6950 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12788 IncrementalHoareTripleChecker+Invalid, 19738 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6950 mSolverCounterUnsat, 8628 mSDtfsCounter, 12788 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1606 GetRequests, 1460 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3272occurred in iteration=19, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 12060 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2847 NumberOfCodeBlocks, 2847 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3097 ConstructedInterpolants, 0 QuantifiedInterpolants, 5370 SizeOfPredicates, 0 NumberOfNonLiveVariables, 9683 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 39 InterpolantComputations, 20 PerfectInterpolantSequences, 1680/1768 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 6932]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7666]: Location Invariant Derived location invariant: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) - InvariantResult [Line: 7065]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6348]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6818]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7649]: Location Invariant Derived location invariant: (((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) - InvariantResult [Line: 7075]: Location Invariant Derived location invariant: ((((ldv_state_variable_0 == 1) && (((long) err + 12) <= 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0))) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) - InvariantResult [Line: 7019]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6292]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6890]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 6597]: Location Invariant Derived location invariant: (((((ref_cnt <= 0) && (0 <= ref_cnt)) && (ldv_state_variable_1 == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_1 == 2) && (1 <= ref_cnt)) && (ldv_state_variable_0 == 3)) && (ref_cnt <= 1))) - InvariantResult [Line: 7095]: Location Invariant Derived location invariant: (((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 1)) && (ref_cnt == 0)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) - ProcedureContractResult [Line: 7281]: Procedure Contract for tgt_ring_idx_inc Derived contract for procedure tgt_ring_idx_inc. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8215]: Procedure Contract for __raw_spin_lock_init Derived contract for procedure __raw_spin_lock_init. Requires: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) Ensures: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) - ProcedureContractResult [Line: 7528]: Procedure Contract for uspace_ring_map Derived contract for procedure uspace_ring_map. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8322]: Procedure Contract for printk Derived contract for procedure printk. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6604]: Procedure Contract for scsi_tgt_cmd_destroy Derived contract for procedure scsi_tgt_cmd_destroy. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7481]: Procedure Contract for tgt_write Derived contract for procedure tgt_write. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7611]: Procedure Contract for tgt_ring_init Derived contract for procedure tgt_ring_init. Requires: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) Ensures: ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0)) - ProcedureContractResult [Line: 7842]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Ensures: 0 - ProcedureContractResult [Line: 8290]: Procedure Contract for list_del Derived contract for procedure list_del. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8283]: Procedure Contract for kmem_cache_free Derived contract for procedure kmem_cache_free. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7292]: Procedure Contract for tgt_head_event Derived contract for procedure tgt_head_event. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7501]: Procedure Contract for tgt_poll Derived contract for procedure tgt_poll. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6597]: Procedure Contract for scsi_unmap_user_pages Derived contract for procedure scsi_unmap_user_pages. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8235]: Procedure Contract for _raw_spin_lock_irqsave Derived contract for procedure _raw_spin_lock_irqsave. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8335]: Procedure Contract for scsi_host_put Derived contract for procedure scsi_host_put. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6456]: Procedure Contract for hash_64 Derived contract for procedure hash_64. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7849]: Procedure Contract for ldv__builtin_expect Derived contract for procedure ldv__builtin_expect. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7580]: Procedure Contract for tgt_open Derived contract for procedure tgt_open. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8332]: Procedure Contract for scsi_host_lookup Derived contract for procedure scsi_host_lookup. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 7556]: Procedure Contract for tgt_mmap Derived contract for procedure tgt_mmap. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8342]: Procedure Contract for scsi_release_buffers Derived contract for procedure scsi_release_buffers. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8280]: Procedure Contract for kmem_cache_destroy Derived contract for procedure kmem_cache_destroy. Requires: ((ldv_state_variable_0 == 1) || (ldv_state_variable_1 == 0)) Ensures: ((ldv_state_variable_0 == 1) || (ldv_state_variable_1 == 0)) - ProcedureContractResult [Line: 6348]: Procedure Contract for spin_unlock_irqrestore Derived contract for procedure spin_unlock_irqrestore. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6377]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 8231]: Procedure Contract for _copy_from_user Derived contract for procedure _copy_from_user. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6292]: Procedure Contract for list_add Derived contract for procedure list_add. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6765]: Procedure Contract for scsi_tgt_cmd_to_host Derived contract for procedure scsi_tgt_cmd_to_host. Requires: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: ((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) - ProcedureContractResult [Line: 6342]: Procedure Contract for spinlock_check Derived contract for procedure spinlock_check. Requires: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) Ensures: (((((ldv_state_variable_1 == 2) && (ref_cnt == 1)) && (ldv_state_variable_0 == 3)) || ((((ldv_state_variable_0 == 1) && (ldv_retval_1 == 0)) && (ldv_state_variable_1 == 0)) && (ref_cnt == 0))) || (((ldv_state_variable_1 == 1) && (ref_cnt == 0)) && (ldv_state_variable_0 == 3))) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:22:34,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE