./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 32bit --witnessprinter.graph.data.programhash dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:27:56,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:27:56,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:27:56,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:27:56,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:27:56,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:27:56,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:27:56,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:27:56,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:27:56,944 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:27:56,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:27:56,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:27:56,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:27:56,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:27:56,945 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:27:56,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:27:56,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:27:56,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:27:56,947 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:27:56,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:27:56,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:27:56,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:27:56,948 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-jdk21/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2025-02-06 18:27:57,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:27:57,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:27:57,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:27:57,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:27:57,179 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:27:57,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2025-02-06 18:27:58,274 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3492d4abb/fae56ba1bbc24224b1ab6924b009534a/FLAGd47c8d05b [2025-02-06 18:27:58,607 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:27:58,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2025-02-06 18:27:58,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3492d4abb/fae56ba1bbc24224b1ab6924b009534a/FLAGd47c8d05b [2025-02-06 18:27:58,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3492d4abb/fae56ba1bbc24224b1ab6924b009534a [2025-02-06 18:27:58,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:27:58,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:27:58,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:27:58,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:27:58,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:27:58,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:27:58" (1/1) ... [2025-02-06 18:27:58,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b8d48b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:58, skipping insertion in model container [2025-02-06 18:27:58,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:27:58" (1/1) ... [2025-02-06 18:27:58,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:27:58,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:27:58,944 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:27:59,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:27:59,038 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:27:59,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59 WrapperNode [2025-02-06 18:27:59,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:27:59,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:27:59,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:27:59,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:27:59,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,108 INFO L138 Inliner]: procedures = 177, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1546 [2025-02-06 18:27:59,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:27:59,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:27:59,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:27:59,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:27:59,119 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,203 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2025-02-06 18:27:59,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:27:59,272 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:27:59,272 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:27:59,272 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:27:59,273 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (1/1) ... [2025-02-06 18:27:59,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:27:59,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:27:59,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:27:59,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:27:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:27:59,317 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:27:59,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:27:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:27:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:27:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:27:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-06 18:27:59,318 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:27:59,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:27:59,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:27:59,505 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:27:59,506 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:28:00,618 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:28:00,687 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-02-06 18:28:00,687 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:28:00,731 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:28:00,734 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:28:00,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:28:00 BoogieIcfgContainer [2025-02-06 18:28:00,735 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:28:00,736 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:28:00,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:28:00,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:28:00,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:27:58" (1/3) ... [2025-02-06 18:28:00,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42724c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:28:00, skipping insertion in model container [2025-02-06 18:28:00,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:27:59" (2/3) ... [2025-02-06 18:28:00,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42724c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:28:00, skipping insertion in model container [2025-02-06 18:28:00,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:28:00" (3/3) ... [2025-02-06 18:28:00,743 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2025-02-06 18:28:00,753 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:28:00,754 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test8-2.i that has 7 procedures, 490 locations, 1 initial locations, 42 loop locations, and 8 error locations. [2025-02-06 18:28:00,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:28:00,803 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;@7af28036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:28:00,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 18:28:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 482 states, 447 states have (on average 1.628635346756152) internal successors, (728), 472 states have internal predecessors, (728), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 18:28:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:28:00,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:00,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:28:00,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:00,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1721625698, now seen corresponding path program 1 times [2025-02-06 18:28:00,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:00,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302457964] [2025-02-06 18:28:00,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:00,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:00,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:28:00,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:28:00,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:00,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:00,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:28:00,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:00,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302457964] [2025-02-06 18:28:00,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302457964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:00,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:00,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:28:00,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146773835] [2025-02-06 18:28:00,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:00,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:28:00,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:00,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:28:00,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:28:00,954 INFO L87 Difference]: Start difference. First operand has 482 states, 447 states have (on average 1.628635346756152) internal successors, (728), 472 states have internal predecessors, (728), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:01,066 INFO L93 Difference]: Finished difference Result 960 states and 1558 transitions. [2025-02-06 18:28:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:28:01,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:28:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:01,075 INFO L225 Difference]: With dead ends: 960 [2025-02-06 18:28:01,076 INFO L226 Difference]: Without dead ends: 440 [2025-02-06 18:28:01,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:28:01,082 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:01,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 654 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-06 18:28:01,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-06 18:28:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 409 states have (on average 1.4743276283618583) internal successors, (603), 431 states have internal predecessors, (603), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:28:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 643 transitions. [2025-02-06 18:28:01,122 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 643 transitions. Word has length 7 [2025-02-06 18:28:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:01,123 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 643 transitions. [2025-02-06 18:28:01,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 643 transitions. [2025-02-06 18:28:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:28:01,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:01,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:28:01,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:28:01,124 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:01,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1721626659, now seen corresponding path program 1 times [2025-02-06 18:28:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085285005] [2025-02-06 18:28:01,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:01,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:28:01,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:28:01,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:01,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:28:01,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573510199] [2025-02-06 18:28:01,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:01,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:28:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:28:01,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:28:01,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:28:01,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:28:01,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:28:01,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:01,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:01,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:28:01,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:28:01,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:28:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:28:01,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:28:01,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:01,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085285005] [2025-02-06 18:28:01,332 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:28:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573510199] [2025-02-06 18:28:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573510199] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:01,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:01,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:28:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926977288] [2025-02-06 18:28:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:28:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:01,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:28:01,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:28:01,334 INFO L87 Difference]: Start difference. First operand 440 states and 643 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:01,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:01,549 INFO L93 Difference]: Finished difference Result 832 states and 1210 transitions. [2025-02-06 18:28:01,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:28:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:28:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:01,553 INFO L225 Difference]: With dead ends: 832 [2025-02-06 18:28:01,554 INFO L226 Difference]: Without dead ends: 830 [2025-02-06 18:28:01,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:28:01,556 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 550 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:01,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1727 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:28:01,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-06 18:28:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 446. [2025-02-06 18:28:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4698795180722892) internal successors, (610), 437 states have internal predecessors, (610), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:28:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 650 transitions. [2025-02-06 18:28:01,586 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 650 transitions. Word has length 7 [2025-02-06 18:28:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:01,586 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 650 transitions. [2025-02-06 18:28:01,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2025-02-06 18:28:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 18:28:01,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:01,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:01,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 18:28:01,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:28:01,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:01,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1716229734, now seen corresponding path program 1 times [2025-02-06 18:28:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:01,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400596509] [2025-02-06 18:28:01,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:01,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:28:01,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:28:01,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:01,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:28:02,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:02,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400596509] [2025-02-06 18:28:02,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400596509] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:02,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:02,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:28:02,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86462150] [2025-02-06 18:28:02,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:02,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:28:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:02,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:28:02,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:28:02,209 INFO L87 Difference]: Start difference. First operand 446 states and 650 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:02,460 INFO L93 Difference]: Finished difference Result 1060 states and 1552 transitions. [2025-02-06 18:28:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:28:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 18:28:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:02,464 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 18:28:02,465 INFO L226 Difference]: Without dead ends: 829 [2025-02-06 18:28:02,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:28:02,466 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 551 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:02,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1732 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:28:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-02-06 18:28:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 446. [2025-02-06 18:28:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4674698795180723) internal successors, (609), 437 states have internal predecessors, (609), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:28:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2025-02-06 18:28:02,485 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 71 [2025-02-06 18:28:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:02,485 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2025-02-06 18:28:02,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2025-02-06 18:28:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 18:28:02,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:02,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:02,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:28:02,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:02,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:02,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1560002185, now seen corresponding path program 1 times [2025-02-06 18:28:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:02,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671227514] [2025-02-06 18:28:02,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:02,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 18:28:02,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 18:28:02,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:02,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:02,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:28:02,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:02,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671227514] [2025-02-06 18:28:02,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671227514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:02,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:02,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:28:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004026004] [2025-02-06 18:28:02,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:02,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:28:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:02,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:28:02,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:28:02,695 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:02,840 INFO L93 Difference]: Finished difference Result 887 states and 1293 transitions. [2025-02-06 18:28:02,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:28:02,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-06 18:28:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:02,843 INFO L225 Difference]: With dead ends: 887 [2025-02-06 18:28:02,844 INFO L226 Difference]: Without dead ends: 449 [2025-02-06 18:28:02,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:28:02,847 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 105 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:02,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1638 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-06 18:28:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2025-02-06 18:28:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4506024096385541) internal successors, (602), 437 states have internal predecessors, (602), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:28:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 642 transitions. [2025-02-06 18:28:02,861 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 642 transitions. Word has length 82 [2025-02-06 18:28:02,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:02,861 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 642 transitions. [2025-02-06 18:28:02,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 642 transitions. [2025-02-06 18:28:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 18:28:02,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:02,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:02,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:28:02,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:02,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:02,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1107949986, now seen corresponding path program 1 times [2025-02-06 18:28:02,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:02,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441516156] [2025-02-06 18:28:02,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:02,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:02,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 18:28:02,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 18:28:02,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:02,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:28:03,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:03,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441516156] [2025-02-06 18:28:03,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441516156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:28:03,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240710438] [2025-02-06 18:28:03,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:03,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:28:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:03,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:28:03,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:28:03,028 INFO L87 Difference]: Start difference. First operand 446 states and 642 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:03,199 INFO L93 Difference]: Finished difference Result 1176 states and 1706 transitions. [2025-02-06 18:28:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:28:03,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-06 18:28:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:03,202 INFO L225 Difference]: With dead ends: 1176 [2025-02-06 18:28:03,202 INFO L226 Difference]: Without dead ends: 738 [2025-02-06 18:28:03,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:28:03,204 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 372 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:03,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1338 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-06 18:28:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 735. [2025-02-06 18:28:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 703 states have (on average 1.460881934566145) internal successors, (1027), 725 states have internal predecessors, (1027), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 18:28:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1069 transitions. [2025-02-06 18:28:03,224 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1069 transitions. Word has length 82 [2025-02-06 18:28:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:03,225 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1069 transitions. [2025-02-06 18:28:03,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:28:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1069 transitions. [2025-02-06 18:28:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:28:03,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:03,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:28:03,226 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1810436378, now seen corresponding path program 1 times [2025-02-06 18:28:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526413590] [2025-02-06 18:28:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:03,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:28:03,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:28:03,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:03,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:28:03,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:03,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526413590] [2025-02-06 18:28:03,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526413590] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:03,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:03,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:28:03,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305021588] [2025-02-06 18:28:03,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:03,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:28:03,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:03,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:28:03,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:28:03,457 INFO L87 Difference]: Start difference. First operand 735 states and 1069 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:28:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:03,549 INFO L93 Difference]: Finished difference Result 1405 states and 2049 transitions. [2025-02-06 18:28:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:28:03,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-02-06 18:28:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:03,553 INFO L225 Difference]: With dead ends: 1405 [2025-02-06 18:28:03,553 INFO L226 Difference]: Without dead ends: 747 [2025-02-06 18:28:03,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-02-06 18:28:03,554 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:03,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1154 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-02-06 18:28:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2025-02-06 18:28:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 715 states have (on average 1.4531468531468532) internal successors, (1039), 737 states have internal predecessors, (1039), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 18:28:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1081 transitions. [2025-02-06 18:28:03,575 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1081 transitions. Word has length 97 [2025-02-06 18:28:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:03,575 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1081 transitions. [2025-02-06 18:28:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:28:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1081 transitions. [2025-02-06 18:28:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:28:03,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:03,576 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:03,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:28:03,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1180137189, now seen corresponding path program 1 times [2025-02-06 18:28:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227015505] [2025-02-06 18:28:03,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:03,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:28:03,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:28:03,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:03,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:28:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227015505] [2025-02-06 18:28:03,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227015505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:03,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:03,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:28:03,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138682151] [2025-02-06 18:28:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:28:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:03,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:28:03,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:28:03,779 INFO L87 Difference]: Start difference. First operand 747 states and 1081 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:28:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:03,919 INFO L93 Difference]: Finished difference Result 847 states and 1230 transitions. [2025-02-06 18:28:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:28:03,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-02-06 18:28:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:03,924 INFO L225 Difference]: With dead ends: 847 [2025-02-06 18:28:03,924 INFO L226 Difference]: Without dead ends: 845 [2025-02-06 18:28:03,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:28:03,925 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 223 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:03,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1737 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-02-06 18:28:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 816. [2025-02-06 18:28:03,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 779 states have (on average 1.4390243902439024) internal successors, (1121), 801 states have internal predecessors, (1121), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:28:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1171 transitions. [2025-02-06 18:28:03,946 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1171 transitions. Word has length 97 [2025-02-06 18:28:03,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:03,946 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1171 transitions. [2025-02-06 18:28:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:28:03,946 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1171 transitions. [2025-02-06 18:28:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:28:03,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:03,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:28:03,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 554928460, now seen corresponding path program 1 times [2025-02-06 18:28:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606836581] [2025-02-06 18:28:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:28:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:28:03,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:03,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:28:04,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:04,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606836581] [2025-02-06 18:28:04,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606836581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:04,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:28:04,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:28:04,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154090123] [2025-02-06 18:28:04,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:04,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:28:04,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:04,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:28:04,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:28:04,186 INFO L87 Difference]: Start difference. First operand 816 states and 1171 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:28:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:04,357 INFO L93 Difference]: Finished difference Result 1044 states and 1498 transitions. [2025-02-06 18:28:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:28:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2025-02-06 18:28:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:04,361 INFO L225 Difference]: With dead ends: 1044 [2025-02-06 18:28:04,361 INFO L226 Difference]: Without dead ends: 1042 [2025-02-06 18:28:04,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:28:04,362 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 458 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:04,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1710 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:28:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-02-06 18:28:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 819. [2025-02-06 18:28:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 782 states have (on average 1.4373401534526855) internal successors, (1124), 803 states have internal predecessors, (1124), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:28:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1174 transitions. [2025-02-06 18:28:04,381 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1174 transitions. Word has length 109 [2025-02-06 18:28:04,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:04,382 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1174 transitions. [2025-02-06 18:28:04,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:28:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1174 transitions. [2025-02-06 18:28:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 18:28:04,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:04,383 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:04,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:28:04,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:04,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -98106786, now seen corresponding path program 1 times [2025-02-06 18:28:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:04,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088441958] [2025-02-06 18:28:04,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:04,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:04,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 18:28:04,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 18:28:04,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:04,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:28:04,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088441958] [2025-02-06 18:28:04,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088441958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:28:04,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290403435] [2025-02-06 18:28:04,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:28:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:28:04,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:28:04,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:28:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 18:28:05,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 18:28:05,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:05,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:05,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 18:28:05,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:28:05,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:28:05,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:28:05,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-06 18:28:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:28:05,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:28:05,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290403435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:28:05,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:28:05,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:28:05,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42826747] [2025-02-06 18:28:05,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:28:05,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:28:05,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:28:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:28:05,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:28:05,661 INFO L87 Difference]: Start difference. First operand 819 states and 1174 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-02-06 18:28:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:28:06,851 INFO L93 Difference]: Finished difference Result 1804 states and 2586 transitions. [2025-02-06 18:28:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:28:06,851 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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 115 [2025-02-06 18:28:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:28:06,855 INFO L225 Difference]: With dead ends: 1804 [2025-02-06 18:28:06,855 INFO L226 Difference]: Without dead ends: 1078 [2025-02-06 18:28:06,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:28:06,857 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 809 mSDsluCounter, 2382 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 18:28:06,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 2943 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 18:28:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2025-02-06 18:28:06,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 850. [2025-02-06 18:28:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 813 states have (on average 1.4268142681426814) internal successors, (1160), 834 states have internal predecessors, (1160), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:28:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1210 transitions. [2025-02-06 18:28:06,876 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1210 transitions. Word has length 115 [2025-02-06 18:28:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:28:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1210 transitions. [2025-02-06 18:28:06,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-02-06 18:28:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1210 transitions. [2025-02-06 18:28:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 18:28:06,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:28:06,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 18:28:06,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:28:07,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:28:07,078 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:28:07,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:28:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1938380674, now seen corresponding path program 1 times [2025-02-06 18:28:07,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:28:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265880227] [2025-02-06 18:28:07,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:07,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:28:07,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 18:28:07,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:28:07,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:07,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:28:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:28:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265880227] [2025-02-06 18:28:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265880227] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:28:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697634287] [2025-02-06 18:28:07,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:28:07,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:28:07,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:28:07,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:28:07,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:28:07,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 18:28:07,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:28:07,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:28:07,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:28:07,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 18:28:07,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:28:47,518 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:29:12,820 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:29:20,139 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:29:37,355 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)