./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:48:39,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:39,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 02:48:39,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:39,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:39,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:39,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:39,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:39,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:39,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:39,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:39,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:39,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:39,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:39,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:39,893 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:39,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:39,895 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:39,896 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 66690b8f2afac00b38604fc5fd1edb6c2524e6892200d6512ef98cf0032d8df1 [2025-03-09 02:48:40,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:40,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:40,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:40,127 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:40,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:40,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2025-03-09 02:48:41,289 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773bd447b/3c132169fbe74cddb122ad887acdcc92/FLAGa66bcca26 [2025-03-09 02:48:41,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:41,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-net-pppox.ko.cil.out.i [2025-03-09 02:48:41,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773bd447b/3c132169fbe74cddb122ad887acdcc92/FLAGa66bcca26 [2025-03-09 02:48:41,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773bd447b/3c132169fbe74cddb122ad887acdcc92 [2025-03-09 02:48:41,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:41,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:41,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:41,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:41,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:41,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:41" (1/1) ... [2025-03-09 02:48:41,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497438a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:41, skipping insertion in model container [2025-03-09 02:48:41,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:41" (1/1) ... [2025-03-09 02:48:41,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:42,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:42,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:42,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] [2025-03-09 02:48:42,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] [2025-03-09 02:48:42,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] [2025-03-09 02:48:42,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] [2025-03-09 02:48:42,416 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] [2025-03-09 02:48:42,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:42,454 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:42,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42 WrapperNode [2025-03-09 02:48:42,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:42,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:42,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:42,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:42,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,495 INFO L138 Inliner]: procedures = 49, calls = 67, calls flagged for inlining = 23, calls inlined = 16, statements flattened = 190 [2025-03-09 02:48:42,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:42,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:42,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:42,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:42,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,524 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 3, 9, 3]. 53 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 4, 3]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-09 02:48:42,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,531 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:42,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:42,540 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:42,540 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:42,541 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (1/1) ... [2025-03-09 02:48:42,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:42,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:42,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:48:42,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:48:42,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2025-03-09 02:48:42,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-09 02:48:42,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:48:42,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:42,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:42,696 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:42,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:42,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5119: havoc sock_register_#t~nondet58#1; [2025-03-09 02:48:42,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5099: havoc ldv_undefined_int_#t~nondet56#1; [2025-03-09 02:48:42,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5092: havoc __request_module_#t~nondet55#1; [2025-03-09 02:48:42,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: assume false; [2025-03-09 02:48:42,866 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4960: assume !false; [2025-03-09 02:48:42,897 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:42,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:42,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:42,906 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:42,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:42 BoogieIcfgContainer [2025-03-09 02:48:42,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:42,908 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:42,908 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:42,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:42,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:41" (1/3) ... [2025-03-09 02:48:42,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302b651e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:42, skipping insertion in model container [2025-03-09 02:48:42,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:42" (2/3) ... [2025-03-09 02:48:42,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302b651e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:42, skipping insertion in model container [2025-03-09 02:48:42,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:42" (3/3) ... [2025-03-09 02:48:42,912 INFO L128 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-net-pppox.ko.cil.out.i [2025-03-09 02:48:42,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:42,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG module_get_put-drivers-net-pppox.ko.cil.out.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 02:48:42,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:42,965 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;@168a2c31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:42,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 02:48:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:48:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:48:42,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:42,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:42,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:42,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1740140090, now seen corresponding path program 1 times [2025-03-09 02:48:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624629107] [2025-03-09 02:48:42,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:48:43,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:48:43,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:43,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:43,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624629107] [2025-03-09 02:48:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624629107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:43,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 02:48:43,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669472959] [2025-03-09 02:48:43,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:43,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:43,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:43,309 INFO L87 Difference]: Start difference. First operand has 57 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:43,352 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2025-03-09 02:48:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-09 02:48:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:43,359 INFO L225 Difference]: With dead ends: 142 [2025-03-09 02:48:43,359 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 02:48:43,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:43,362 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 36 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:43,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 02:48:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 02:48:43,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 64 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:48:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 86 transitions. [2025-03-09 02:48:43,385 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 86 transitions. Word has length 20 [2025-03-09 02:48:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:43,385 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 86 transitions. [2025-03-09 02:48:43,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 86 transitions. [2025-03-09 02:48:43,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:48:43,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:43,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:43,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:48:43,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_module_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:43,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1988680161, now seen corresponding path program 1 times [2025-03-09 02:48:43,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:43,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322353670] [2025-03-09 02:48:43,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:48:43,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:48:43,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:43,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:43,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322353670] [2025-03-09 02:48:43,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322353670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:43,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:43,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776209019] [2025-03-09 02:48:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:43,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:48:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:43,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:48:43,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:43,503 INFO L87 Difference]: Start difference. First operand 69 states and 86 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:43,520 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2025-03-09 02:48:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:48:43,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-09 02:48:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:43,521 INFO L225 Difference]: With dead ends: 69 [2025-03-09 02:48:43,521 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 02:48:43,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:48:43,522 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:43,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 02:48:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 02:48:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 63 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:48:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2025-03-09 02:48:43,531 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 30 [2025-03-09 02:48:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:43,531 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2025-03-09 02:48:43,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2025-03-09 02:48:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:48:43,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:43,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:43,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:48:43,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:43,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1519542907, now seen corresponding path program 1 times [2025-03-09 02:48:43,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:43,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572653938] [2025-03-09 02:48:43,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:48:43,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:48:43,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:43,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572653938] [2025-03-09 02:48:43,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572653938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:43,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:43,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:48:43,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500438112] [2025-03-09 02:48:43,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:43,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:48:43,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:43,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:48:43,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:43,730 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:43,773 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2025-03-09 02:48:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:48:43,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-09 02:48:43,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:43,775 INFO L225 Difference]: With dead ends: 101 [2025-03-09 02:48:43,776 INFO L226 Difference]: Without dead ends: 99 [2025-03-09 02:48:43,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:48:43,777 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:43,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 111 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-09 02:48:43,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-09 02:48:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:48:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2025-03-09 02:48:43,787 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 31 [2025-03-09 02:48:43,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:43,788 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2025-03-09 02:48:43,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2025-03-09 02:48:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:48:43,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:43,789 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:48:43,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:48:43,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:43,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1467937657, now seen corresponding path program 1 times [2025-03-09 02:48:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015782820] [2025-03-09 02:48:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:48:43,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:48:43,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015782820] [2025-03-09 02:48:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015782820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:48:43,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189436827] [2025-03-09 02:48:43,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:43,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:43,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:43,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:43,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:43,909 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:43,938 INFO L93 Difference]: Finished difference Result 170 states and 218 transitions. [2025-03-09 02:48:43,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:43,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-09 02:48:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:43,942 INFO L225 Difference]: With dead ends: 170 [2025-03-09 02:48:43,942 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 02:48:43,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:43,943 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:43,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 02:48:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-09 02:48:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.3125) internal successors, (126), 98 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:48:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2025-03-09 02:48:43,950 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 40 [2025-03-09 02:48:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:43,950 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2025-03-09 02:48:43,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2025-03-09 02:48:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 02:48:43,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:43,954 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:48:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:48:43,954 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash 634281138, now seen corresponding path program 1 times [2025-03-09 02:48:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333991703] [2025-03-09 02:48:43,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:43,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:43,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:48:43,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:48:43,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333991703] [2025-03-09 02:48:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333991703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643860035] [2025-03-09 02:48:44,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:44,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:44,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:48:44,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 02:48:44,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 02:48:44,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:44,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:44,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:48:44,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:44,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:48:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643860035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:48:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-09 02:48:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221778793] [2025-03-09 02:48:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:44,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:44,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:48:44,377 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:48:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:44,420 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2025-03-09 02:48:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:48:44,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-09 02:48:44,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:44,422 INFO L225 Difference]: With dead ends: 167 [2025-03-09 02:48:44,422 INFO L226 Difference]: Without dead ends: 166 [2025-03-09 02:48:44,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:48:44,423 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 56 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:44,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 175 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-09 02:48:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2025-03-09 02:48:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.2916666666666667) internal successors, (124), 97 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:48:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 130 transitions. [2025-03-09 02:48:44,430 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 130 transitions. Word has length 47 [2025-03-09 02:48:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:44,430 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 130 transitions. [2025-03-09 02:48:44,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:48:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 130 transitions. [2025-03-09 02:48:44,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 02:48:44,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:44,431 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:44,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:44,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2121413617, now seen corresponding path program 1 times [2025-03-09 02:48:44,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:44,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494438446] [2025-03-09 02:48:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:44,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:48:44,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:48:44,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:44,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:44,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494438446] [2025-03-09 02:48:44,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494438446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:44,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640216005] [2025-03-09 02:48:44,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:44,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:44,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:48:44,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 02:48:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 02:48:44,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:48:45,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:45,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640216005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:45,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:45,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 02:48:45,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277573652] [2025-03-09 02:48:45,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:45,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:48:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:45,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:48:45,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:48:45,246 INFO L87 Difference]: Start difference. First operand 104 states and 130 transitions. Second operand has 12 states, 11 states have (on average 12.181818181818182) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:48:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:45,385 INFO L93 Difference]: Finished difference Result 338 states and 438 transitions. [2025-03-09 02:48:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 02:48:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.181818181818182) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2025-03-09 02:48:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:45,388 INFO L225 Difference]: With dead ends: 338 [2025-03-09 02:48:45,388 INFO L226 Difference]: Without dead ends: 269 [2025-03-09 02:48:45,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:48:45,389 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 201 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:45,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 275 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-09 02:48:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 174. [2025-03-09 02:48:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.28125) internal successors, (205), 163 states have internal predecessors, (205), 5 states have call successors, (5), 5 states have call predecessors, (5), 8 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-09 02:48:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2025-03-09 02:48:45,403 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 58 [2025-03-09 02:48:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:45,403 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2025-03-09 02:48:45,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.181818181818182) internal successors, (134), 11 states have internal predecessors, (134), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:48:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2025-03-09 02:48:45,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-09 02:48:45,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:45,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:45,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 02:48:45,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 02:48:45,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:45,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -206631420, now seen corresponding path program 1 times [2025-03-09 02:48:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341560755] [2025-03-09 02:48:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:45,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-09 02:48:45,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:48:45,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:45,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:48:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341560755] [2025-03-09 02:48:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341560755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655188727] [2025-03-09 02:48:46,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:46,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:46,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:48:46,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-09 02:48:46,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-09 02:48:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:46,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:46,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:48:46,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:46,457 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:48:46,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655188727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:46,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 17 [2025-03-09 02:48:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346573568] [2025-03-09 02:48:46,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:46,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:48:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:46,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:48:46,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=205, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:48:46,780 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand has 19 states, 18 states have (on average 14.277777777777779) internal successors, (257), 18 states have internal predecessors, (257), 8 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:48:47,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:47,097 INFO L93 Difference]: Finished difference Result 814 states and 1057 transitions. [2025-03-09 02:48:47,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-09 02:48:47,098 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 14.277777777777779) internal successors, (257), 18 states have internal predecessors, (257), 8 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 129 [2025-03-09 02:48:47,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:47,101 INFO L225 Difference]: With dead ends: 814 [2025-03-09 02:48:47,101 INFO L226 Difference]: Without dead ends: 748 [2025-03-09 02:48:47,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=526, Invalid=880, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 02:48:47,102 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 392 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:47,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 563 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:48:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-09 02:48:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 416. [2025-03-09 02:48:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 382 states have (on average 1.2827225130890052) internal successors, (490), 391 states have internal predecessors, (490), 12 states have call successors, (12), 12 states have call predecessors, (12), 21 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-09 02:48:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 525 transitions. [2025-03-09 02:48:47,133 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 525 transitions. Word has length 129 [2025-03-09 02:48:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:47,133 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 525 transitions. [2025-03-09 02:48:47,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 14.277777777777779) internal successors, (257), 18 states have internal predecessors, (257), 8 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-09 02:48:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 525 transitions. [2025-03-09 02:48:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-09 02:48:47,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:47,140 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:47,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:48:47,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:47,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:47,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:47,341 INFO L85 PathProgramCache]: Analyzing trace with hash -930908028, now seen corresponding path program 2 times [2025-03-09 02:48:47,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931924473] [2025-03-09 02:48:47,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:47,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 291 statements into 2 equivalence classes. [2025-03-09 02:48:47,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 291 statements. [2025-03-09 02:48:47,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 70 proven. 30 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2025-03-09 02:48:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931924473] [2025-03-09 02:48:48,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931924473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278728067] [2025-03-09 02:48:48,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:48,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:48,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:48,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:48:48,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 291 statements into 2 equivalence classes. [2025-03-09 02:48:48,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 291 statements. [2025-03-09 02:48:48,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:48,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:48,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:48:48,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:52,648 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-03-09 02:48:52,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 19 [2025-03-09 02:48:52,669 INFO L349 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2025-03-09 02:48:52,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 38 treesize of output 19 [2025-03-09 02:48:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 80 proven. 10 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2025-03-09 02:48:52,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:52,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278728067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:52,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:48:52,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2025-03-09 02:48:52,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179861722] [2025-03-09 02:48:52,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:48:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:52,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:48:52,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:48:52,875 INFO L87 Difference]: Start difference. First operand 416 states and 525 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:48:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:52,968 INFO L93 Difference]: Finished difference Result 850 states and 1068 transitions. [2025-03-09 02:48:52,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:52,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 291 [2025-03-09 02:48:52,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:52,973 INFO L225 Difference]: With dead ends: 850 [2025-03-09 02:48:52,975 INFO L226 Difference]: Without dead ends: 440 [2025-03-09 02:48:52,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-09 02:48:52,976 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 63 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:52,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-09 02:48:52,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 416. [2025-03-09 02:48:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 382 states have (on average 1.2513089005235603) internal successors, (478), 391 states have internal predecessors, (478), 12 states have call successors, (12), 12 states have call predecessors, (12), 21 states have return successors, (23), 12 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-09 02:48:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 513 transitions. [2025-03-09 02:48:52,996 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 513 transitions. Word has length 291 [2025-03-09 02:48:52,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:52,997 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 513 transitions. [2025-03-09 02:48:52,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:48:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 513 transitions. [2025-03-09 02:48:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-09 02:48:52,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:52,999 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:53,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:48:53,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:53,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:53,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:53,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1060269443, now seen corresponding path program 1 times [2025-03-09 02:48:53,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:53,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751944603] [2025-03-09 02:48:53,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:53,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:53,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-09 02:48:53,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-09 02:48:53,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:53,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 0 proven. 1240 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:48:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751944603] [2025-03-09 02:48:54,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751944603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:48:54,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968256484] [2025-03-09 02:48:54,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:54,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:54,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:54,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:48:54,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:48:54,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-09 02:48:55,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-09 02:48:55,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:48:55,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:55,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 2020 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-09 02:48:55,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:48:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 0 proven. 1240 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:48:55,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:48:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 0 proven. 1420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:48:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968256484] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:48:56,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:48:56,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 21] total 35 [2025-03-09 02:48:56,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464297289] [2025-03-09 02:48:56,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:48:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 02:48:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:56,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 02:48:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=802, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 02:48:56,097 INFO L87 Difference]: Start difference. First operand 416 states and 513 transitions. Second operand has 37 states, 36 states have (on average 15.61111111111111) internal successors, (562), 36 states have internal predecessors, (562), 20 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2025-03-09 02:48:57,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:57,011 INFO L93 Difference]: Finished difference Result 2845 states and 3582 transitions. [2025-03-09 02:48:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-09 02:48:57,013 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 15.61111111111111) internal successors, (562), 36 states have internal predecessors, (562), 20 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) Word has length 302 [2025-03-09 02:48:57,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:57,023 INFO L225 Difference]: With dead ends: 2845 [2025-03-09 02:48:57,023 INFO L226 Difference]: Without dead ends: 2608 [2025-03-09 02:48:57,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 676 GetRequests, 597 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2311, Invalid=4009, Unknown=0, NotChecked=0, Total=6320 [2025-03-09 02:48:57,028 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 1139 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:57,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 1013 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:48:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2025-03-09 02:48:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 848. [2025-03-09 02:48:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 778 states have (on average 1.2467866323907455) internal successors, (970), 799 states have internal predecessors, (970), 24 states have call successors, (24), 24 states have call predecessors, (24), 45 states have return successors, (47), 24 states have call predecessors, (47), 24 states have call successors, (47) [2025-03-09 02:48:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1041 transitions. [2025-03-09 02:48:57,091 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1041 transitions. Word has length 302 [2025-03-09 02:48:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:57,091 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1041 transitions. [2025-03-09 02:48:57,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 15.61111111111111) internal successors, (562), 36 states have internal predecessors, (562), 20 states have call successors, (30), 12 states have call predecessors, (30), 12 states have return successors, (30), 20 states have call predecessors, (30), 20 states have call successors, (30) [2025-03-09 02:48:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1041 transitions. [2025-03-09 02:48:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-03-09 02:48:57,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:57,099 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:57,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:48:57,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:48:57,303 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:48:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:57,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1137033521, now seen corresponding path program 2 times [2025-03-09 02:48:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678108993] [2025-03-09 02:48:57,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:48:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:48:57,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 638 statements into 2 equivalence classes. [2025-03-09 02:48:57,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 638 statements. [2025-03-09 02:48:57,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:48:57,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:48:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6820 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 6622 trivial. 0 not checked. [2025-03-09 02:48:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:48:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678108993] [2025-03-09 02:48:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678108993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:48:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:48:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:48:57,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917721193] [2025-03-09 02:48:57,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:48:57,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:48:57,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:48:57,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:48:57,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:48:57,505 INFO L87 Difference]: Start difference. First operand 848 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:48:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:48:57,533 INFO L93 Difference]: Finished difference Result 863 states and 1060 transitions. [2025-03-09 02:48:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:48:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 638 [2025-03-09 02:48:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:48:57,535 INFO L225 Difference]: With dead ends: 863 [2025-03-09 02:48:57,535 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:48:57,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:48:57,536 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:48:57,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 63 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:48:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:48:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:48:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:48:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:48:57,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 638 [2025-03-09 02:48:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:48:57,538 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:48:57,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:48:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:48:57,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:48:57,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-09 02:48:57,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-09 02:48:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-09 02:48:57,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_module_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-09 02:48:57,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 02:48:57,544 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:57,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:48:57,563 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:48:57,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:48:57 BoogieIcfgContainer [2025-03-09 02:48:57,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:48:57,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:48:57,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:48:57,569 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:48:57,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:42" (3/4) ... [2025-03-09 02:48:57,571 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:48:57,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2025-03-09 02:48:57,576 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2025-03-09 02:48:57,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-09 02:48:57,581 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-09 02:48:57,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:48:57,582 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:48:57,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:48:57,647 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:48:57,647 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:48:57,648 INFO L158 Benchmark]: Toolchain (without parser) took 15936.74ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 126.8MB in the beginning and 448.1MB in the end (delta: -321.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2025-03-09 02:48:57,648 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:57,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 743.31ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 60.0MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 02:48:57,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.35ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 57.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:57,648 INFO L158 Benchmark]: Boogie Preprocessor took 43.70ms. Allocated memory is still 167.8MB. Free memory was 57.8MB in the beginning and 55.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:57,649 INFO L158 Benchmark]: IcfgBuilder took 365.90ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 113.1MB in the end (delta: -57.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-03-09 02:48:57,649 INFO L158 Benchmark]: TraceAbstraction took 14660.82ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 112.3MB in the beginning and 452.3MB in the end (delta: -340.0MB). Peak memory consumption was 286.0MB. Max. memory is 16.1GB. [2025-03-09 02:48:57,649 INFO L158 Benchmark]: Witness Printer took 77.90ms. Allocated memory is still 503.3MB. Free memory was 452.3MB in the beginning and 448.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:48:57,650 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.27ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 743.31ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 60.0MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.35ms. Allocated memory is still 167.8MB. Free memory was 60.0MB in the beginning and 57.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.70ms. Allocated memory is still 167.8MB. Free memory was 57.8MB in the beginning and 55.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 365.90ms. Allocated memory is still 167.8MB. Free memory was 55.6MB in the beginning and 113.1MB in the end (delta: -57.5MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14660.82ms. Allocated memory was 167.8MB in the beginning and 503.3MB in the end (delta: 335.5MB). Free memory was 112.3MB in the beginning and 452.3MB in the end (delta: -340.0MB). Peak memory consumption was 286.0MB. Max. memory is 16.1GB. * Witness Printer took 77.90ms. Allocated memory is still 503.3MB. Free memory was 452.3MB in the beginning and 448.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4823]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4823-4824] - GenericResultAtLocation [Line: 4826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4826-4827] - GenericResultAtLocation [Line: 4830]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4830-4831] - GenericResultAtLocation [Line: 4833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4833-4834] - GenericResultAtLocation [Line: 4837]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" ((int *)arg): "ebx"); [4837-4838] * 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: 5018]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5018]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5038]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 5038]: 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 3 procedures, 57 locations, 74 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 10, TraceHistogramMax: 23, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1957 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1957 mSDsluCounter, 2686 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2229 mSDsCounter, 300 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 520 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 300 mSolverCounterUnsat, 457 mSDtfsCounter, 520 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1480 GetRequests, 1313 SyntacticMatches, 3 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=848occurred in iteration=9, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 2273 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 2413 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2884 ConstructedInterpolants, 0 QuantifiedInterpolants, 37432 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3786 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 9946/14584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 02:48:57,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE