./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_FNV_test2-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 b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 13:38:35,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 13:38:35,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 13:38:35,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 13:38:35,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 13:38:35,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 13:38:35,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 13:38:35,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 13:38:35,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 13:38:35,310 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 13:38:35,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 13:38:35,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 13:38:35,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 13:38:35,311 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 13:38:35,311 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 13:38:35,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 13:38:35,312 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 13:38:35,312 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:38:35,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 13:38:35,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 13:38:35,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 13:38:35,315 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 -> b879d991ca85089954916015c9838d386a5c85365dad0e09e537aeb772eaaaf8 [2025-02-08 13:38:35,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 13:38:35,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 13:38:35,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 13:38:35,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 13:38:35,614 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 13:38:35,617 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_FNV_test2-2.i [2025-02-08 13:38:36,960 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c91bb6c2/9914304e434540de9f4a6a599ab9962a/FLAGc931d9763 [2025-02-08 13:38:37,334 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 13:38:37,334 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test2-2.i [2025-02-08 13:38:37,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c91bb6c2/9914304e434540de9f4a6a599ab9962a/FLAGc931d9763 [2025-02-08 13:38:37,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c91bb6c2/9914304e434540de9f4a6a599ab9962a [2025-02-08 13:38:37,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 13:38:37,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 13:38:37,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 13:38:37,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 13:38:37,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 13:38:37,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:38:37" (1/1) ... [2025-02-08 13:38:37,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7cf75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:37, skipping insertion in model container [2025-02-08 13:38:37,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:38:37" (1/1) ... [2025-02-08 13:38:37,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 13:38:37,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:38:37,995 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 13:38:38,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 13:38:38,153 INFO L204 MainTranslator]: Completed translation [2025-02-08 13:38:38,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38 WrapperNode [2025-02-08 13:38:38,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 13:38:38,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 13:38:38,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 13:38:38,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 13:38:38,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,241 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1431 [2025-02-08 13:38:38,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 13:38:38,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 13:38:38,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 13:38:38,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 13:38:38,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,334 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-02-08 13:38:38,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 13:38:38,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 13:38:38,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 13:38:38,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 13:38:38,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (1/1) ... [2025-02-08 13:38:38,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 13:38:38,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:38:38,461 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-08 13:38:38,467 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-08 13:38:38,486 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 13:38:38,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 13:38:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 13:38:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 13:38:38,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-08 13:38:38,489 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 13:38:38,489 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 13:38:38,489 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 13:38:38,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 13:38:38,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 13:38:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 13:38:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 13:38:38,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 13:38:38,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 13:38:38,704 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 13:38:38,706 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 13:38:40,065 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: 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-08 13:38:40,184 INFO L? ?]: Removed 338 outVars from TransFormulas that were not future-live. [2025-02-08 13:38:40,184 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 13:38:40,244 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 13:38:40,249 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 13:38:40,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:38:40 BoogieIcfgContainer [2025-02-08 13:38:40,249 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 13:38:40,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 13:38:40,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 13:38:40,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 13:38:40,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:38:37" (1/3) ... [2025-02-08 13:38:40,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582077b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:38:40, skipping insertion in model container [2025-02-08 13:38:40,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:38:38" (2/3) ... [2025-02-08 13:38:40,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582077b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:38:40, skipping insertion in model container [2025-02-08 13:38:40,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:38:40" (3/3) ... [2025-02-08 13:38:40,261 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test2-2.i [2025-02-08 13:38:40,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 13:38:40,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_test2-2.i that has 6 procedures, 434 locations, 1 initial locations, 38 loop locations, and 8 error locations. [2025-02-08 13:38:40,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 13:38:40,377 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;@6286f1ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 13:38:40,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-08 13:38:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 403 states have (on average 1.6277915632754343) internal successors, (656), 418 states have internal predecessors, (656), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-08 13:38:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:38:40,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:40,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:38:40,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:40,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1006645689, now seen corresponding path program 1 times [2025-02-08 13:38:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022129549] [2025-02-08 13:38:40,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:40,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:40,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:38:40,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:38:40,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:40,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:40,576 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-08 13:38:40,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022129549] [2025-02-08 13:38:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022129549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:40,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:38:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48947693] [2025-02-08 13:38:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:40,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 13:38:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:40,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 13:38:40,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 13:38:40,607 INFO L87 Difference]: Start difference. First operand has 426 states, 403 states have (on average 1.6277915632754343) internal successors, (656), 418 states have internal predecessors, (656), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 13:38:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:40,741 INFO L93 Difference]: Finished difference Result 849 states and 1355 transitions. [2025-02-08 13:38:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 13:38:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-02-08 13:38:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:40,755 INFO L225 Difference]: With dead ends: 849 [2025-02-08 13:38:40,755 INFO L226 Difference]: Without dead ends: 374 [2025-02-08 13:38:40,759 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-08 13:38:40,761 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:40,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:38:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-02-08 13:38:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-02-08 13:38:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 362 states have (on average 1.4668508287292819) internal successors, (531), 369 states have internal predecessors, (531), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 537 transitions. [2025-02-08 13:38:40,822 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 537 transitions. Word has length 6 [2025-02-08 13:38:40,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:40,823 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 537 transitions. [2025-02-08 13:38:40,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-08 13:38:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 537 transitions. [2025-02-08 13:38:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 13:38:40,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:40,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 13:38:40,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 13:38:40,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:40,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1006646650, now seen corresponding path program 1 times [2025-02-08 13:38:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:40,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92968990] [2025-02-08 13:38:40,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:40,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:38:40,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:38:40,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:40,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 13:38:40,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126440182] [2025-02-08 13:38:40,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:40,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:38:40,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:38:40,862 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-08 13:38:40,865 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-08 13:38:41,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 13:38:41,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 13:38:41,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:41,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:41,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 13:38:41,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:38:41,080 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-08 13:38:41,121 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-08 13:38:41,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:38:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:41,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92968990] [2025-02-08 13:38:41,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 13:38:41,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126440182] [2025-02-08 13:38:41,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126440182] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:41,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:41,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:38:41,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748032331] [2025-02-08 13:38:41,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:38:41,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:41,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:38:41,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:38:41,126 INFO L87 Difference]: Start difference. First operand 374 states and 537 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 13:38:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:41,445 INFO L93 Difference]: Finished difference Result 743 states and 1069 transitions. [2025-02-08 13:38:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:38:41,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-02-08 13:38:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:41,453 INFO L225 Difference]: With dead ends: 743 [2025-02-08 13:38:41,453 INFO L226 Difference]: Without dead ends: 741 [2025-02-08 13:38:41,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-08 13:38:41,456 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 519 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:41,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1492 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:38:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-02-08 13:38:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 380. [2025-02-08 13:38:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 368 states have (on average 1.4619565217391304) internal successors, (538), 375 states have internal predecessors, (538), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 544 transitions. [2025-02-08 13:38:41,491 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 544 transitions. Word has length 6 [2025-02-08 13:38:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:41,491 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 544 transitions. [2025-02-08 13:38:41,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-08 13:38:41,492 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 544 transitions. [2025-02-08 13:38:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-08 13:38:41,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:41,498 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] [2025-02-08 13:38:41,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 13:38:41,698 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-08 13:38:41,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:41,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash 233105226, now seen corresponding path program 1 times [2025-02-08 13:38:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764726077] [2025-02-08 13:38:41,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:41,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 13:38:41,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 13:38:41,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:41,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:42,255 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-08 13:38:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:42,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764726077] [2025-02-08 13:38:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764726077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:38:42,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464443560] [2025-02-08 13:38:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:42,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:38:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:42,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:38:42,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:38:42,257 INFO L87 Difference]: Start difference. First operand 380 states and 544 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-08 13:38:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:42,567 INFO L93 Difference]: Finished difference Result 908 states and 1309 transitions. [2025-02-08 13:38:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:38:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-02-08 13:38:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:42,573 INFO L225 Difference]: With dead ends: 908 [2025-02-08 13:38:42,574 INFO L226 Difference]: Without dead ends: 740 [2025-02-08 13:38:42,576 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-08 13:38:42,577 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 520 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:42,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1497 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 13:38:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-02-08 13:38:42,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 380. [2025-02-08 13:38:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 368 states have (on average 1.4592391304347827) internal successors, (537), 375 states have internal predecessors, (537), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 543 transitions. [2025-02-08 13:38:42,610 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 543 transitions. Word has length 62 [2025-02-08 13:38:42,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:42,611 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 543 transitions. [2025-02-08 13:38:42,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-08 13:38:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 543 transitions. [2025-02-08 13:38:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:38:42,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:42,615 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] [2025-02-08 13:38:42,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 13:38:42,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:42,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 400975396, now seen corresponding path program 1 times [2025-02-08 13:38:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137416056] [2025-02-08 13:38:42,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:42,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:38:42,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:38:42,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:42,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:42,906 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-08 13:38:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137416056] [2025-02-08 13:38:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137416056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 13:38:42,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136362113] [2025-02-08 13:38:42,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:42,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:38:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:42,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:38:42,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:38:42,909 INFO L87 Difference]: Start difference. First operand 380 states and 543 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-08 13:38:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:43,091 INFO L93 Difference]: Finished difference Result 756 states and 1082 transitions. [2025-02-08 13:38:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:38:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-02-08 13:38:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:43,093 INFO L225 Difference]: With dead ends: 756 [2025-02-08 13:38:43,093 INFO L226 Difference]: Without dead ends: 383 [2025-02-08 13:38:43,094 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-08 13:38:43,097 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 105 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:43,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1323 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:38:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-08 13:38:43,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2025-02-08 13:38:43,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 368 states have (on average 1.440217391304348) internal successors, (530), 375 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 536 transitions. [2025-02-08 13:38:43,119 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 536 transitions. Word has length 79 [2025-02-08 13:38:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:43,119 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 536 transitions. [2025-02-08 13:38:43,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-08 13:38:43,119 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 536 transitions. [2025-02-08 13:38:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 13:38:43,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:43,121 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] [2025-02-08 13:38:43,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 13:38:43,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:43,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:43,122 INFO L85 PathProgramCache]: Analyzing trace with hash -984968323, now seen corresponding path program 1 times [2025-02-08 13:38:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575384979] [2025-02-08 13:38:43,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:43,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 13:38:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 13:38:43,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:43,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:43,344 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-08 13:38:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575384979] [2025-02-08 13:38:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575384979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 13:38:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181075025] [2025-02-08 13:38:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:43,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:38:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:43,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:38:43,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:38:43,352 INFO L87 Difference]: Start difference. First operand 380 states and 536 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-08 13:38:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:43,534 INFO L93 Difference]: Finished difference Result 1025 states and 1464 transitions. [2025-02-08 13:38:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:38:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-02-08 13:38:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:43,538 INFO L225 Difference]: With dead ends: 1025 [2025-02-08 13:38:43,539 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 13:38:43,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:38:43,540 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 345 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:43,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1138 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:38:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 13:38:43,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2025-02-08 13:38:43,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 636 states have (on average 1.4575471698113207) internal successors, (927), 643 states have internal predecessors, (927), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 933 transitions. [2025-02-08 13:38:43,560 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 933 transitions. Word has length 79 [2025-02-08 13:38:43,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:43,560 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 933 transitions. [2025-02-08 13:38:43,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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-08 13:38:43,560 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 933 transitions. [2025-02-08 13:38:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:38:43,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:43,562 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] [2025-02-08 13:38:43,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 13:38:43,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1534769215, now seen corresponding path program 1 times [2025-02-08 13:38:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869645032] [2025-02-08 13:38:43,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:43,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:38:43,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:38:43,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:43,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:43,790 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-08 13:38:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:43,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869645032] [2025-02-08 13:38:43,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869645032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:43,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:43,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:38:43,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816709465] [2025-02-08 13:38:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:43,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 13:38:43,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:43,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 13:38:43,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:38:43,792 INFO L87 Difference]: Start difference. First operand 648 states and 933 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:43,916 INFO L93 Difference]: Finished difference Result 1232 states and 1778 transitions. [2025-02-08 13:38:43,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 13:38:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-02-08 13:38:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:43,920 INFO L225 Difference]: With dead ends: 1232 [2025-02-08 13:38:43,920 INFO L226 Difference]: Without dead ends: 660 [2025-02-08 13:38:43,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 13:38:43,921 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:43,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 944 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 13:38:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-02-08 13:38:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-02-08 13:38:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 648 states have (on average 1.4490740740740742) internal successors, (939), 655 states have internal predecessors, (939), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:43,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 945 transitions. [2025-02-08 13:38:43,946 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 945 transitions. Word has length 94 [2025-02-08 13:38:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:43,947 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 945 transitions. [2025-02-08 13:38:43,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:43,947 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 945 transitions. [2025-02-08 13:38:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 13:38:43,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:43,948 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] [2025-02-08 13:38:43,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 13:38:43,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:43,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1743467518, now seen corresponding path program 1 times [2025-02-08 13:38:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:43,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849850707] [2025-02-08 13:38:43,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:43,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 13:38:44,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 13:38:44,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:44,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:44,433 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-08 13:38:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849850707] [2025-02-08 13:38:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849850707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:38:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515672002] [2025-02-08 13:38:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:44,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:38:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:44,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:38:44,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:38:44,436 INFO L87 Difference]: Start difference. First operand 660 states and 945 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:44,630 INFO L93 Difference]: Finished difference Result 841 states and 1205 transitions. [2025-02-08 13:38:44,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:38:44,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-02-08 13:38:44,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:44,637 INFO L225 Difference]: With dead ends: 841 [2025-02-08 13:38:44,637 INFO L226 Difference]: Without dead ends: 840 [2025-02-08 13:38:44,638 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-08 13:38:44,638 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 435 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:44,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1140 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:38:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-02-08 13:38:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 659. [2025-02-08 13:38:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 648 states have (on average 1.4475308641975309) internal successors, (938), 654 states have internal predecessors, (938), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 13:38:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 944 transitions. [2025-02-08 13:38:44,662 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 944 transitions. Word has length 94 [2025-02-08 13:38:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:44,663 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 944 transitions. [2025-02-08 13:38:44,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 944 transitions. [2025-02-08 13:38:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-08 13:38:44,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:44,664 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] [2025-02-08 13:38:44,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 13:38:44,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1787081434, now seen corresponding path program 1 times [2025-02-08 13:38:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679452435] [2025-02-08 13:38:44,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:44,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 13:38:44,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 13:38:44,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:44,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:45,002 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-08 13:38:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:45,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679452435] [2025-02-08 13:38:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679452435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:45,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 13:38:45,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 13:38:45,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792942588] [2025-02-08 13:38:45,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:45,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 13:38:45,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:45,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 13:38:45,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 13:38:45,004 INFO L87 Difference]: Start difference. First operand 659 states and 944 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:45,233 INFO L93 Difference]: Finished difference Result 904 states and 1288 transitions. [2025-02-08 13:38:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 13:38:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2025-02-08 13:38:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:45,238 INFO L225 Difference]: With dead ends: 904 [2025-02-08 13:38:45,238 INFO L226 Difference]: Without dead ends: 903 [2025-02-08 13:38:45,239 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-08 13:38:45,240 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 427 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:45,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1473 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 13:38:45,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-02-08 13:38:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 722. [2025-02-08 13:38:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 708 states have (on average 1.4336158192090396) internal successors, (1015), 714 states have internal predecessors, (1015), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:38:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1027 transitions. [2025-02-08 13:38:45,262 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1027 transitions. Word has length 95 [2025-02-08 13:38:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:45,263 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1027 transitions. [2025-02-08 13:38:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1027 transitions. [2025-02-08 13:38:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 13:38:45,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:45,264 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] [2025-02-08 13:38:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 13:38:45,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:45,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1830315726, now seen corresponding path program 1 times [2025-02-08 13:38:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:45,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084487662] [2025-02-08 13:38:45,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:45,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:45,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:38:45,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:38:45,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:45,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:45,800 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-08 13:38:45,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084487662] [2025-02-08 13:38:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084487662] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:38:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039229905] [2025-02-08 13:38:45,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:45,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:38:45,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:38:45,804 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-08 13:38:45,806 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-08 13:38:46,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 13:38:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 13:38:46,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:46,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 13:38:46,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:38:46,154 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-08 13:38:46,175 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-08 13:38:46,198 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 23 treesize of output 22 [2025-02-08 13:38:47,088 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-08 13:38:47,088 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 13:38:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039229905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 13:38:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 13:38:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 13 [2025-02-08 13:38:47,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695036915] [2025-02-08 13:38:47,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 13:38:47,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 13:38:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 13:38:47,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 13:38:47,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 13:38:47,090 INFO L87 Difference]: Start difference. First operand 722 states and 1027 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:48,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 13:38:48,614 INFO L93 Difference]: Finished difference Result 1569 states and 2231 transitions. [2025-02-08 13:38:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 13:38:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2025-02-08 13:38:48,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 13:38:48,619 INFO L225 Difference]: With dead ends: 1569 [2025-02-08 13:38:48,620 INFO L226 Difference]: Without dead ends: 939 [2025-02-08 13:38:48,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-08 13:38:48,622 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 778 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2329 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 13:38:48,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2329 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 13:38:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-02-08 13:38:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 753. [2025-02-08 13:38:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 739 states have (on average 1.4221921515561569) internal successors, (1051), 745 states have internal predecessors, (1051), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 13:38:48,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1063 transitions. [2025-02-08 13:38:48,646 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1063 transitions. Word has length 100 [2025-02-08 13:38:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 13:38:48,646 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1063 transitions. [2025-02-08 13:38:48,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 10 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 13:38:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1063 transitions. [2025-02-08 13:38:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 13:38:48,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 13:38:48,648 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] [2025-02-08 13:38:48,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 13:38:48,852 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-08 13:38:48,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-08 13:38:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 13:38:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash -337652432, now seen corresponding path program 1 times [2025-02-08 13:38:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 13:38:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846515312] [2025-02-08 13:38:48,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 13:38:48,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:38:49,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:38:49,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:49,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:49,252 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-08 13:38:49,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 13:38:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846515312] [2025-02-08 13:38:49,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846515312] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 13:38:49,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049995456] [2025-02-08 13:38:49,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 13:38:49,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 13:38:49,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 13:38:49,258 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-08 13:38:49,261 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-08 13:38:49,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 13:38:49,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 13:38:49,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 13:38:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 13:38:49,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 13:38:49,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 13:40:10,707 WARN L286 SmtUtils]: Spent 7.70s 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)