./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:48:49,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:48:49,848 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:49,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:48:49,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:48:49,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:48:49,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:48:49,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:48:49,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:48:49,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:48:49,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:48:49,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:48:49,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:48:49,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:48:49,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:48:49,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:48:49,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:48:49,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:48:49,879 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:49,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:48:49,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:48:49,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:48:49,881 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 -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2025-03-09 02:48:50,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:48:50,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:48:50,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:48:50,106 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:48:50,106 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:48:50,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-09 02:48:51,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8af9dc2/9a61b5ac1be0402ba68d8a01df7c6223/FLAGd1763bec3 [2025-03-09 02:48:51,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:48:51,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-09 02:48:51,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8af9dc2/9a61b5ac1be0402ba68d8a01df7c6223/FLAGd1763bec3 [2025-03-09 02:48:51,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8af9dc2/9a61b5ac1be0402ba68d8a01df7c6223 [2025-03-09 02:48:51,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:48:51,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:48:51,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:51,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:48:51,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:48:51,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:51" (1/1) ... [2025-03-09 02:48:51,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b08c31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:51, skipping insertion in model container [2025-03-09 02:48:51,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:48:51" (1/1) ... [2025-03-09 02:48:51,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:48:52,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:52,028 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:48:52,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:48:52,191 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:48:52,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:52 WrapperNode [2025-03-09 02:48:52,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:48:52,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:52,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:48:52,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:48:52,198 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:52" (1/1) ... [2025-03-09 02:48:52,226 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:52" (1/1) ... [2025-03-09 02:48:52,280 INFO L138 Inliner]: procedures = 100, calls = 349, calls flagged for inlining = 41, calls inlined = 33, statements flattened = 817 [2025-03-09 02:48:52,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:48:52,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:48:52,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:48:52,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:48:52,288 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:52" (1/1) ... [2025-03-09 02:48:52,288 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:52" (1/1) ... [2025-03-09 02:48:52,296 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:52" (1/1) ... [2025-03-09 02:48:52,358 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 14, 65, 103, 32]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 0, 10, 0]. The 204 writes are split as follows [0, 12, 2, 65, 93, 32]. [2025-03-09 02:48:52,359 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:52" (1/1) ... [2025-03-09 02:48:52,360 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:52" (1/1) ... [2025-03-09 02:48:52,383 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:52" (1/1) ... [2025-03-09 02:48:52,385 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:52" (1/1) ... [2025-03-09 02:48:52,388 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:52" (1/1) ... [2025-03-09 02:48:52,393 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:52" (1/1) ... [2025-03-09 02:48:52,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:48:52,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:48:52,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:48:52,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:48:52,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:52" (1/1) ... [2025-03-09 02:48:52,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:48:52,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:48:52,439 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:52,444 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:52,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 02:48:52,459 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-09 02:48:52,459 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-03-09 02:48:52,460 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-09 02:48:52,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-09 02:48:52,460 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:48:52,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:48:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-09 02:48:52,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-03-09 02:48:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:48:52,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:48:52,462 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-09 02:48:52,463 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-09 02:48:52,662 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:48:52,663 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:48:52,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc #t~nondet118; [2025-03-09 02:48:52,721 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3201: havoc #t~ret117.base, #t~ret117.offset; [2025-03-09 02:48:52,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3150: havoc #t~nondet105; [2025-03-09 02:48:57,826 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2249: havoc i2c_check_functionality_#t~bitwise40#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2300: call ULTIMATE.dealloc(isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset);havoc isl6271a_probe_~#config~0#1.base, isl6271a_probe_~#config~0#1.offset;call ULTIMATE.dealloc(isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset);havoc isl6271a_probe_~#__key~0#1.base, isl6271a_probe_~#__key~0#1.offset; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3209: havoc regulator_map_voltage_linear_#t~nondet119#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3212: havoc regulator_register_#t~ret120#1.base, regulator_register_#t~ret120#1.offset; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3180: havoc i2c_register_driver_#t~nondet113#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc dev_get_drvdata_#t~ret110#1.base, dev_get_drvdata_#t~ret110#1.offset; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3184: havoc i2c_smbus_read_byte_#t~nondet114#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3170: havoc dev_set_drvdata_#t~nondet111#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3188: havoc i2c_smbus_write_byte_#t~nondet115#1; [2025-03-09 02:48:57,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3173: havoc devm_kzalloc_#t~ret112#1.base, devm_kzalloc_#t~ret112#1.offset; [2025-03-09 02:48:57,917 INFO L? ?]: Removed 267 outVars from TransFormulas that were not future-live. [2025-03-09 02:48:57,917 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:48:57,937 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:48:57,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:48:57,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:57 BoogieIcfgContainer [2025-03-09 02:48:57,937 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:48:57,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:48:57,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:48:57,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:48:57,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:48:51" (1/3) ... [2025-03-09 02:48:57,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6a59db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:57, skipping insertion in model container [2025-03-09 02:48:57,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:48:52" (2/3) ... [2025-03-09 02:48:57,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6a59db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:48:57, skipping insertion in model container [2025-03-09 02:48:57,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:48:57" (3/3) ... [2025-03-09 02:48:57,944 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-03-09 02:48:57,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:48:57,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i that has 12 procedures, 205 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-09 02:48:57,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:48:58,000 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;@7968e223, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:48:58,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 02:48:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 171 states have internal predecessors, (218), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 02:48:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-09 02:48:58,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:48:58,008 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:48:58,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:48:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:48:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1601106069, now seen corresponding path program 1 times [2025-03-09 02:48:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:48:58,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447975890] [2025-03-09 02:48:58,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:48:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 02:49:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 02:49:00,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:00,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447975890] [2025-03-09 02:49:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447975890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440736397] [2025-03-09 02:49:00,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:00,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:00,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:00,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:00,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:00,614 INFO L87 Difference]: Start difference. First operand has 205 states, 154 states have (on average 1.4155844155844155) internal successors, (218), 171 states have internal predecessors, (218), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:00,835 INFO L93 Difference]: Finished difference Result 530 states and 741 transitions. [2025-03-09 02:49:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-09 02:49:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:00,841 INFO L225 Difference]: With dead ends: 530 [2025-03-09 02:49:00,842 INFO L226 Difference]: Without dead ends: 290 [2025-03-09 02:49:00,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:00,849 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 165 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:00,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 537 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:49:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-09 02:49:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-09 02:49:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 222 states have (on average 1.3693693693693694) internal successors, (304), 232 states have internal predecessors, (304), 39 states have call successors, (39), 19 states have call predecessors, (39), 19 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-09 02:49:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 382 transitions. [2025-03-09 02:49:00,901 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 382 transitions. Word has length 17 [2025-03-09 02:49:00,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:00,901 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 382 transitions. [2025-03-09 02:49:00,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 382 transitions. [2025-03-09 02:49:00,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:49:00,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:00,904 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:00,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:49:00,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1880596896, now seen corresponding path program 1 times [2025-03-09 02:49:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252195993] [2025-03-09 02:49:00,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:02,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:49:02,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:49:02,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:02,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 02:49:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252195993] [2025-03-09 02:49:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252195993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070864397] [2025-03-09 02:49:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:03,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:03,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:03,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:03,021 INFO L87 Difference]: Start difference. First operand 290 states and 382 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:03,238 INFO L93 Difference]: Finished difference Result 577 states and 761 transitions. [2025-03-09 02:49:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:03,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 28 [2025-03-09 02:49:03,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:03,242 INFO L225 Difference]: With dead ends: 577 [2025-03-09 02:49:03,244 INFO L226 Difference]: Without dead ends: 573 [2025-03-09 02:49:03,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:03,244 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 209 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:03,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 461 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:49:03,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-09 02:49:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 567. [2025-03-09 02:49:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.36281179138322) internal successors, (601), 452 states have internal predecessors, (601), 78 states have call successors, (78), 38 states have call predecessors, (78), 38 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-09 02:49:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 757 transitions. [2025-03-09 02:49:03,296 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 757 transitions. Word has length 28 [2025-03-09 02:49:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:03,296 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 757 transitions. [2025-03-09 02:49:03,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 757 transitions. [2025-03-09 02:49:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:49:03,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:03,299 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:03,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:49:03,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:03,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash 255209789, now seen corresponding path program 1 times [2025-03-09 02:49:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970604624] [2025-03-09 02:49:03,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:04,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:49:05,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:49:05,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:05,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:49:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970604624] [2025-03-09 02:49:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970604624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:05,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:05,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:49:05,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863227051] [2025-03-09 02:49:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:05,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:05,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:05,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:05,345 INFO L87 Difference]: Start difference. First operand 567 states and 757 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:49:09,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:09,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:09,955 INFO L93 Difference]: Finished difference Result 1234 states and 1649 transitions. [2025-03-09 02:49:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:09,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-09 02:49:09,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:09,959 INFO L225 Difference]: With dead ends: 1234 [2025-03-09 02:49:09,962 INFO L226 Difference]: Without dead ends: 670 [2025-03-09 02:49:09,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:09,964 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 206 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:09,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 547 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-09 02:49:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-03-09 02:49:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2025-03-09 02:49:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 520 states have (on average 1.3557692307692308) internal successors, (705), 531 states have internal predecessors, (705), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-09 02:49:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 889 transitions. [2025-03-09 02:49:09,999 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 889 transitions. Word has length 35 [2025-03-09 02:49:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:09,999 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 889 transitions. [2025-03-09 02:49:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:49:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 889 transitions. [2025-03-09 02:49:10,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 02:49:10,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:10,003 INFO L218 NwaCegarLoop]: trace histogram [3, 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:49:10,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:49:10,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:10,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1162841676, now seen corresponding path program 1 times [2025-03-09 02:49:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336827103] [2025-03-09 02:49:10,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:10,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:11,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 02:49:11,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 02:49:11,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:11,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 02:49:11,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:11,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336827103] [2025-03-09 02:49:11,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336827103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:11,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:11,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:11,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931248321] [2025-03-09 02:49:11,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:11,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:11,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:11,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:11,991 INFO L87 Difference]: Start difference. First operand 670 states and 889 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:16,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:16,815 INFO L93 Difference]: Finished difference Result 1393 states and 1847 transitions. [2025-03-09 02:49:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:49:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 43 [2025-03-09 02:49:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:16,823 INFO L225 Difference]: With dead ends: 1393 [2025-03-09 02:49:16,823 INFO L226 Difference]: Without dead ends: 988 [2025-03-09 02:49:16,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:16,825 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 208 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:16,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1111 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-09 02:49:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-03-09 02:49:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 674. [2025-03-09 02:49:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 524 states have (on average 1.3530534351145038) internal successors, (709), 535 states have internal predecessors, (709), 92 states have call successors, (92), 48 states have call predecessors, (92), 48 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-09 02:49:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 893 transitions. [2025-03-09 02:49:16,863 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 893 transitions. Word has length 43 [2025-03-09 02:49:16,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:16,863 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 893 transitions. [2025-03-09 02:49:16,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:49:16,863 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 893 transitions. [2025-03-09 02:49:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-09 02:49:16,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:16,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:16,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:49:16,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:16,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1740905345, now seen corresponding path program 1 times [2025-03-09 02:49:16,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:16,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983629072] [2025-03-09 02:49:16,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:18,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-09 02:49:18,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-09 02:49:18,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:18,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:18,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:49:18,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:18,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983629072] [2025-03-09 02:49:18,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983629072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:18,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:18,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:18,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296500979] [2025-03-09 02:49:18,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:18,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:18,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:18,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:18,916 INFO L87 Difference]: Start difference. First operand 674 states and 893 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:49:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:19,333 INFO L93 Difference]: Finished difference Result 1272 states and 1695 transitions. [2025-03-09 02:49:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2025-03-09 02:49:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:19,337 INFO L225 Difference]: With dead ends: 1272 [2025-03-09 02:49:19,337 INFO L226 Difference]: Without dead ends: 708 [2025-03-09 02:49:19,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:19,339 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 5 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:19,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 448 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:49:19,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2025-03-09 02:49:19,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2025-03-09 02:49:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 552 states have (on average 1.338768115942029) internal successors, (739), 563 states have internal predecessors, (739), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-09 02:49:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 935 transitions. [2025-03-09 02:49:19,359 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 935 transitions. Word has length 53 [2025-03-09 02:49:19,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:19,359 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 935 transitions. [2025-03-09 02:49:19,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 02:49:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 935 transitions. [2025-03-09 02:49:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 02:49:19,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:19,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:19,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:49:19,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:19,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1649505741, now seen corresponding path program 1 times [2025-03-09 02:49:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123280710] [2025-03-09 02:49:19,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:20,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 02:49:20,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 02:49:20,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:20,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 02:49:21,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:21,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123280710] [2025-03-09 02:49:21,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123280710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:21,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:21,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:49:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703401728] [2025-03-09 02:49:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:21,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:21,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:21,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:21,379 INFO L87 Difference]: Start difference. First operand 708 states and 935 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:49:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:22,088 INFO L93 Difference]: Finished difference Result 1308 states and 1729 transitions. [2025-03-09 02:49:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:22,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 67 [2025-03-09 02:49:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:22,092 INFO L225 Difference]: With dead ends: 1308 [2025-03-09 02:49:22,092 INFO L226 Difference]: Without dead ends: 710 [2025-03-09 02:49:22,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:49:22,095 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:22,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 662 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2025-03-09 02:49:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2025-03-09 02:49:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 554 states have (on average 1.3375451263537905) internal successors, (741), 565 states have internal predecessors, (741), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-09 02:49:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 937 transitions. [2025-03-09 02:49:22,120 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 937 transitions. Word has length 67 [2025-03-09 02:49:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:22,122 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 937 transitions. [2025-03-09 02:49:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:49:22,122 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 937 transitions. [2025-03-09 02:49:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-09 02:49:22,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:22,124 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:22,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:49:22,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:22,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1871561861, now seen corresponding path program 1 times [2025-03-09 02:49:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:22,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435722022] [2025-03-09 02:49:22,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:23,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:49:23,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:49:23,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:23,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:49:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435722022] [2025-03-09 02:49:24,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435722022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:24,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058943577] [2025-03-09 02:49:24,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:24,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:24,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:24,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:24,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:49:26,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-09 02:49:26,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-09 02:49:26,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:26,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:26,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 2470 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:26,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:49:27,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058943577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:49:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064674509] [2025-03-09 02:49:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:27,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:27,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:27,099 INFO L87 Difference]: Start difference. First operand 710 states and 937 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:49:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:27,851 INFO L93 Difference]: Finished difference Result 1314 states and 1741 transitions. [2025-03-09 02:49:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2025-03-09 02:49:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:27,855 INFO L225 Difference]: With dead ends: 1314 [2025-03-09 02:49:27,856 INFO L226 Difference]: Without dead ends: 714 [2025-03-09 02:49:27,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:27,859 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 11 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:27,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 662 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-09 02:49:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2025-03-09 02:49:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 560 states have (on average 1.3267857142857142) internal successors, (743), 567 states have internal predecessors, (743), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-09 02:49:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 939 transitions. [2025-03-09 02:49:27,899 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 939 transitions. Word has length 73 [2025-03-09 02:49:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 939 transitions. [2025-03-09 02:49:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-09 02:49:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 939 transitions. [2025-03-09 02:49:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-09 02:49:27,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:27,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:27,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:49:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:28,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2111124200, now seen corresponding path program 1 times [2025-03-09 02:49:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507829610] [2025-03-09 02:49:28,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-09 02:49:29,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-09 02:49:29,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-09 02:49:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507829610] [2025-03-09 02:49:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507829610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:49:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:49:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744120499] [2025-03-09 02:49:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:30,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:30,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:30,130 INFO L87 Difference]: Start difference. First operand 714 states and 939 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:49:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:30,406 INFO L93 Difference]: Finished difference Result 714 states and 939 transitions. [2025-03-09 02:49:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-03-09 02:49:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:30,409 INFO L225 Difference]: With dead ends: 714 [2025-03-09 02:49:30,410 INFO L226 Difference]: Without dead ends: 712 [2025-03-09 02:49:30,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:49:30,410 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 7 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:30,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 430 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 02:49:30,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-09 02:49:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 708. [2025-03-09 02:49:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 556 states have (on average 1.3183453237410072) internal successors, (733), 561 states have internal predecessors, (733), 98 states have call successors, (98), 48 states have call predecessors, (98), 48 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-09 02:49:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 929 transitions. [2025-03-09 02:49:30,431 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 929 transitions. Word has length 74 [2025-03-09 02:49:30,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:30,432 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 929 transitions. [2025-03-09 02:49:30,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:49:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 929 transitions. [2025-03-09 02:49:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:49:30,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:30,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:30,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:49:30,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:30,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:30,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1907529279, now seen corresponding path program 1 times [2025-03-09 02:49:30,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:30,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693806363] [2025-03-09 02:49:30,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:30,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:32,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:49:32,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:49:32,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:32,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 02:49:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693806363] [2025-03-09 02:49:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693806363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:32,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043924561] [2025-03-09 02:49:32,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:32,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:32,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:32,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:32,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:49:34,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:49:34,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:49:34,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:34,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:34,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:49:34,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:49:34,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043924561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-09 02:49:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364113766] [2025-03-09 02:49:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:34,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:34,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:34,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:34,911 INFO L87 Difference]: Start difference. First operand 708 states and 929 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:35,109 INFO L93 Difference]: Finished difference Result 1133 states and 1490 transitions. [2025-03-09 02:49:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:35,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2025-03-09 02:49:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:35,113 INFO L225 Difference]: With dead ends: 1133 [2025-03-09 02:49:35,113 INFO L226 Difference]: Without dead ends: 713 [2025-03-09 02:49:35,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:35,114 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 3 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:35,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 455 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:49:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-09 02:49:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2025-03-09 02:49:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 560 states have (on average 1.3178571428571428) internal successors, (738), 565 states have internal predecessors, (738), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-09 02:49:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 936 transitions. [2025-03-09 02:49:35,132 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 936 transitions. Word has length 80 [2025-03-09 02:49:35,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:35,133 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 936 transitions. [2025-03-09 02:49:35,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:49:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 936 transitions. [2025-03-09 02:49:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-09 02:49:35,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:35,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:35,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:35,335 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,SelfDestructingSolverStorable8 [2025-03-09 02:49:35,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -935729924, now seen corresponding path program 1 times [2025-03-09 02:49:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724055136] [2025-03-09 02:49:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:36,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:49:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:49:36,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:36,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 02:49:37,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724055136] [2025-03-09 02:49:37,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724055136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:37,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954939491] [2025-03-09 02:49:37,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:37,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:37,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:37,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:37,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:49:39,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-09 02:49:39,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-09 02:49:39,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:39,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:39,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 02:49:39,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 02:49:39,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:39,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954939491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:39,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:39,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 02:49:39,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446952498] [2025-03-09 02:49:39,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:39,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:49:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:39,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:49:39,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:39,896 INFO L87 Difference]: Start difference. First operand 713 states and 936 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:49:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:40,045 INFO L93 Difference]: Finished difference Result 713 states and 936 transitions. [2025-03-09 02:49:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:49:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 83 [2025-03-09 02:49:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:40,049 INFO L225 Difference]: With dead ends: 713 [2025-03-09 02:49:40,049 INFO L226 Difference]: Without dead ends: 712 [2025-03-09 02:49:40,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:49:40,050 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:40,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:49:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-09 02:49:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2025-03-09 02:49:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 560 states have (on average 1.3142857142857143) internal successors, (736), 564 states have internal predecessors, (736), 99 states have call successors, (99), 48 states have call predecessors, (99), 48 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-09 02:49:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 934 transitions. [2025-03-09 02:49:40,068 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 934 transitions. Word has length 83 [2025-03-09 02:49:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:40,068 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 934 transitions. [2025-03-09 02:49:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:49:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 934 transitions. [2025-03-09 02:49:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 02:49:40,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:40,070 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:40,083 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:49:40,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:40,271 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:40,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1035575110, now seen corresponding path program 1 times [2025-03-09 02:49:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:40,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222709106] [2025-03-09 02:49:40,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:40,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:49:42,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:49:42,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:42,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 02:49:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222709106] [2025-03-09 02:49:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222709106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408203593] [2025-03-09 02:49:42,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:42,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:42,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:42,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:42,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:49:44,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-09 02:49:44,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 02:49:44,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:44,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 2506 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:44,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:49:45,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:49:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 02:49:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408203593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:49:45,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:49:45,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-09 02:49:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766974929] [2025-03-09 02:49:45,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:49:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:49:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:45,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:49:45,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:45,765 INFO L87 Difference]: Start difference. First operand 712 states and 934 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-09 02:49:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:46,504 INFO L93 Difference]: Finished difference Result 1364 states and 1787 transitions. [2025-03-09 02:49:46,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:49:46,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 88 [2025-03-09 02:49:46,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:46,507 INFO L225 Difference]: With dead ends: 1364 [2025-03-09 02:49:46,507 INFO L226 Difference]: Without dead ends: 762 [2025-03-09 02:49:46,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:46,509 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 31 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:46,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 854 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:49:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-03-09 02:49:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 742. [2025-03-09 02:49:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 586 states have (on average 1.3037542662116042) internal successors, (764), 590 states have internal predecessors, (764), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-09 02:49:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 970 transitions. [2025-03-09 02:49:46,525 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 970 transitions. Word has length 88 [2025-03-09 02:49:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:46,526 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 970 transitions. [2025-03-09 02:49:46,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-09 02:49:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 970 transitions. [2025-03-09 02:49:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-09 02:49:46,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:46,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:46,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:49:46,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:46,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:46,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1238800325, now seen corresponding path program 1 times [2025-03-09 02:49:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690588108] [2025-03-09 02:49:46,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:46,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:49:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:49:48,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:49:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 02:49:48,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:49:48,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690588108] [2025-03-09 02:49:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690588108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:49:48,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553966616] [2025-03-09 02:49:48,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:48,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:49:48,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:49:48,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:49:48,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 02:49:50,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-09 02:49:51,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-09 02:49:51,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:49:51,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:49:51,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 2514 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:49:51,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:49:53,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:49:53,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:49:53,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553966616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:49:53,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:49:53,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 02:49:53,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119256706] [2025-03-09 02:49:53,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:49:53,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:49:53,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:49:53,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:49:53,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:53,309 INFO L87 Difference]: Start difference. First operand 742 states and 970 transitions. Second operand has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:49:57,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:49:58,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:49:58,536 INFO L93 Difference]: Finished difference Result 935 states and 1222 transitions. [2025-03-09 02:49:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:49:58,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 92 [2025-03-09 02:49:58,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:49:58,542 INFO L225 Difference]: With dead ends: 935 [2025-03-09 02:49:58,542 INFO L226 Difference]: Without dead ends: 933 [2025-03-09 02:49:58,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:49:58,542 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 363 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:49:58,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 585 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-09 02:49:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-09 02:49:58,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 740. [2025-03-09 02:49:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 586 states have (on average 1.3003412969283277) internal successors, (762), 588 states have internal predecessors, (762), 103 states have call successors, (103), 48 states have call predecessors, (103), 48 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-09 02:49:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 968 transitions. [2025-03-09 02:49:58,562 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 968 transitions. Word has length 92 [2025-03-09 02:49:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:49:58,562 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 968 transitions. [2025-03-09 02:49:58,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.333333333333332) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-09 02:49:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 968 transitions. [2025-03-09 02:49:58,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-09 02:49:58,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:49:58,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:49:58,580 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:49:58,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-09 02:49:58,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:49:58,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:49:58,765 INFO L85 PathProgramCache]: Analyzing trace with hash -251895400, now seen corresponding path program 1 times [2025-03-09 02:49:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:49:58,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975041714] [2025-03-09 02:49:58,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:49:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:00,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:50:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:50:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-09 02:50:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:00,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975041714] [2025-03-09 02:50:00,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975041714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:50:00,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500311446] [2025-03-09 02:50:00,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:00,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:50:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:50:00,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:50:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 02:50:03,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-09 02:50:03,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-09 02:50:03,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:03,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:03,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 2515 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:50:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:50:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 02:50:05,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:50:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 02:50:07,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500311446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:50:07,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:50:07,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-09 02:50:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424545819] [2025-03-09 02:50:07,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:50:07,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:50:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:07,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:50:07,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:50:07,442 INFO L87 Difference]: Start difference. First operand 740 states and 968 transitions. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-09 02:50:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:09,563 INFO L93 Difference]: Finished difference Result 1814 states and 2381 transitions. [2025-03-09 02:50:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:50:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 93 [2025-03-09 02:50:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:09,568 INFO L225 Difference]: With dead ends: 1814 [2025-03-09 02:50:09,568 INFO L226 Difference]: Without dead ends: 1377 [2025-03-09 02:50:09,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:50:09,570 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 548 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:09,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 798 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-09 02:50:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2025-03-09 02:50:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1183. [2025-03-09 02:50:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 938 states have (on average 1.2985074626865671) internal successors, (1218), 939 states have internal predecessors, (1218), 166 states have call successors, (166), 77 states have call predecessors, (166), 77 states have return successors, (166), 166 states have call predecessors, (166), 166 states have call successors, (166) [2025-03-09 02:50:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1550 transitions. [2025-03-09 02:50:09,601 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1550 transitions. Word has length 93 [2025-03-09 02:50:09,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:09,602 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1550 transitions. [2025-03-09 02:50:09,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 6 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-09 02:50:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1550 transitions. [2025-03-09 02:50:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 02:50:09,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:09,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:50:09,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:50:09,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:50:09,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:50:09,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1172237909, now seen corresponding path program 1 times [2025-03-09 02:50:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:09,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134688790] [2025-03-09 02:50:09,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:09,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:11,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 02:50:11,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 02:50:11,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:11,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:50:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:11,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134688790] [2025-03-09 02:50:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134688790] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:11,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:50:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354024556] [2025-03-09 02:50:11,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:11,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:11,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:11,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:11,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:11,588 INFO L87 Difference]: Start difference. First operand 1183 states and 1550 transitions. Second operand has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:50:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:11,722 INFO L93 Difference]: Finished difference Result 1183 states and 1550 transitions. [2025-03-09 02:50:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:11,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 104 [2025-03-09 02:50:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:11,726 INFO L225 Difference]: With dead ends: 1183 [2025-03-09 02:50:11,726 INFO L226 Difference]: Without dead ends: 1182 [2025-03-09 02:50:11,726 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:50:11,726 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:11,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:50:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-09 02:50:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1174. [2025-03-09 02:50:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 932 states have (on average 1.298283261802575) internal successors, (1210), 932 states have internal predecessors, (1210), 164 states have call successors, (164), 77 states have call predecessors, (164), 77 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-09 02:50:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1538 transitions. [2025-03-09 02:50:11,759 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1538 transitions. Word has length 104 [2025-03-09 02:50:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:11,760 INFO L471 AbstractCegarLoop]: Abstraction has 1174 states and 1538 transitions. [2025-03-09 02:50:11,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-09 02:50:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1538 transitions. [2025-03-09 02:50:11,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-09 02:50:11,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:11,763 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:50:11,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 02:50:11,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:50:11,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:11,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1512883697, now seen corresponding path program 1 times [2025-03-09 02:50:11,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:11,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728912330] [2025-03-09 02:50:11,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:11,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:13,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-09 02:50:13,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-09 02:50:13,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:50:13,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-09 02:50:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728912330] [2025-03-09 02:50:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728912330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:13,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:13,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:50:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612068625] [2025-03-09 02:50:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:13,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:50:13,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:13,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:50:13,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:13,649 INFO L87 Difference]: Start difference. First operand 1174 states and 1538 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:50:17,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 02:50:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:18,267 INFO L93 Difference]: Finished difference Result 2024 states and 2647 transitions. [2025-03-09 02:50:18,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:50:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 170 [2025-03-09 02:50:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:18,271 INFO L225 Difference]: With dead ends: 2024 [2025-03-09 02:50:18,271 INFO L226 Difference]: Without dead ends: 960 [2025-03-09 02:50:18,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:50:18,274 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:18,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 572 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-09 02:50:18,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-09 02:50:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2025-03-09 02:50:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 768 states have (on average 1.28125) internal successors, (984), 768 states have internal predecessors, (984), 132 states have call successors, (132), 59 states have call predecessors, (132), 59 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-03-09 02:50:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1248 transitions. [2025-03-09 02:50:18,297 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1248 transitions. Word has length 170 [2025-03-09 02:50:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:18,297 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1248 transitions. [2025-03-09 02:50:18,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:50:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1248 transitions. [2025-03-09 02:50:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-09 02:50:18,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:18,300 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-09 02:50:18,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 02:50:18,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:50:18,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:18,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2071046063, now seen corresponding path program 2 times [2025-03-09 02:50:18,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:18,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122396219] [2025-03-09 02:50:18,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:50:18,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:50:19,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 192 statements into 2 equivalence classes. [2025-03-09 02:50:20,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 42 of 192 statements. [2025-03-09 02:50:20,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:50:20,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:50:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-09 02:50:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:50:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122396219] [2025-03-09 02:50:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122396219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:50:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:50:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 02:50:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716424760] [2025-03-09 02:50:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:50:22,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:50:22,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:50:22,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:50:22,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:50:22,741 INFO L87 Difference]: Start difference. First operand 960 states and 1248 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:50:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:50:23,924 INFO L93 Difference]: Finished difference Result 1867 states and 2440 transitions. [2025-03-09 02:50:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:50:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 192 [2025-03-09 02:50:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:50:23,929 INFO L225 Difference]: With dead ends: 1867 [2025-03-09 02:50:23,929 INFO L226 Difference]: Without dead ends: 1017 [2025-03-09 02:50:23,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:50:23,931 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 0 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:50:23,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1989 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 02:50:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-09 02:50:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1011. [2025-03-09 02:50:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 807 states have (on average 1.2676579925650557) internal successors, (1023), 801 states have internal predecessors, (1023), 141 states have call successors, (141), 59 states have call predecessors, (141), 62 states have return successors, (156), 150 states have call predecessors, (156), 141 states have call successors, (156) [2025-03-09 02:50:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1320 transitions. [2025-03-09 02:50:23,962 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1320 transitions. Word has length 192 [2025-03-09 02:50:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:50:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1320 transitions. [2025-03-09 02:50:23,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:50:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1320 transitions. [2025-03-09 02:50:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-09 02:50:23,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:50:23,966 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2025-03-09 02:50:23,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 02:50:23,966 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 02:50:23,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:50:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1457016785, now seen corresponding path program 1 times [2025-03-09 02:50:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:50:23,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358033871] [2025-03-09 02:50:23,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:50:23,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms