./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.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 ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:19:12,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:19:12,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:19:12,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:19:12,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:19:12,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:19:12,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:19:12,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:19:12,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:19:12,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:19:12,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:19:12,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:19:12,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:19:12,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:19:12,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:19:12,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:19:12,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:19:12,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:19:12,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:19:12,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:19:12,448 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 -> ce6a3162e09155ad765d255c42023f1cbec9d995c66c63f43c14fadd8640484e [2025-02-06 18:19:12,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:19:12,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:19:12,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:19:12,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:19:12,655 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:19:12,657 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_OAT_test10-1.i [2025-02-06 18:19:13,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094dcf771/973304679b864807a4336bccc671480f/FLAG186aa0b5f [2025-02-06 18:19:14,149 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:19:14,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test10-1.i [2025-02-06 18:19:14,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094dcf771/973304679b864807a4336bccc671480f/FLAG186aa0b5f [2025-02-06 18:19:14,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/094dcf771/973304679b864807a4336bccc671480f [2025-02-06 18:19:14,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:19:14,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:19:14,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:19:14,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:19:14,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:19:14,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:14" (1/1) ... [2025-02-06 18:19:14,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762a5b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:14, skipping insertion in model container [2025-02-06 18:19:14,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:14" (1/1) ... [2025-02-06 18:19:14,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:19:14,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:19:14,863 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:19:14,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:19:15,007 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:19:15,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15 WrapperNode [2025-02-06 18:19:15,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:19:15,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:19:15,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:19:15,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:19:15,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,126 INFO L138 Inliner]: procedures = 177, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3314 [2025-02-06 18:19:15,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:19:15,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:19:15,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:19:15,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:19:15,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,273 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [106, 2, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 86 writes are split as follows [4, 0, 82]. [2025-02-06 18:19:15,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,274 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:19:15,357 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:19:15,357 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:19:15,357 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:19:15,358 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (1/1) ... [2025-02-06 18:19:15,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:19:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:15,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:19:15,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:19:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2025-02-06 18:19:15,399 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2025-02-06 18:19:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:19:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:19:15,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:19:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:19:15,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:19:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:19:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:19:15,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:19:15,401 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:19:15,401 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:19:15,401 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:19:15,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:19:15,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:19:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:19:15,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:19:15,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:19:15,593 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:19:15,594 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:19:17,496 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:19:17,681 INFO L? ?]: Removed 789 outVars from TransFormulas that were not future-live. [2025-02-06 18:19:17,681 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:19:17,774 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:19:17,774 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 18:19:17,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:19:17 BoogieIcfgContainer [2025-02-06 18:19:17,775 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:19:17,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:19:17,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:19:17,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:19:17,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:19:14" (1/3) ... [2025-02-06 18:19:17,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1cc02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:19:17, skipping insertion in model container [2025-02-06 18:19:17,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:15" (2/3) ... [2025-02-06 18:19:17,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1cc02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:19:17, skipping insertion in model container [2025-02-06 18:19:17,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:19:17" (3/3) ... [2025-02-06 18:19:17,783 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test10-1.i [2025-02-06 18:19:17,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:19:17,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test10-1.i that has 6 procedures, 1042 locations, 1 initial locations, 84 loop locations, and 6 error locations. [2025-02-06 18:19:17,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:19:17,872 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;@627ed3bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:19:17,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 18:19:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 1034 states, 1010 states have (on average 1.6227722772277229) internal successors, (1639), 1020 states have internal predecessors, (1639), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 18:19:17,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:19:17,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:17,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:17,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:17,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1675216651, now seen corresponding path program 1 times [2025-02-06 18:19:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:17,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693348054] [2025-02-06 18:19:17,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:17,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:17,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:17,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:17,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:18,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:18,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693348054] [2025-02-06 18:19:18,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693348054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:18,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:18,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:19:18,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111058909] [2025-02-06 18:19:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:19:18,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:18,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:19:18,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:19:18,055 INFO L87 Difference]: Start difference. First operand has 1034 states, 1010 states have (on average 1.6227722772277229) internal successors, (1639), 1020 states have internal predecessors, (1639), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:18,264 INFO L93 Difference]: Finished difference Result 2065 states and 3339 transitions. [2025-02-06 18:19:18,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:19:18,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:19:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:18,278 INFO L225 Difference]: With dead ends: 2065 [2025-02-06 18:19:18,278 INFO L226 Difference]: Without dead ends: 1028 [2025-02-06 18:19:18,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:19:18,285 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1398 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:18,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1398 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2025-02-06 18:19:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1028. [2025-02-06 18:19:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1005 states have (on average 1.4786069651741294) internal successors, (1486), 1015 states have internal predecessors, (1486), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:19:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1513 transitions. [2025-02-06 18:19:18,368 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1513 transitions. Word has length 7 [2025-02-06 18:19:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:18,369 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1513 transitions. [2025-02-06 18:19:18,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1513 transitions. [2025-02-06 18:19:18,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:19:18,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:18,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:18,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:19:18,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:18,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:18,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1675215690, now seen corresponding path program 1 times [2025-02-06 18:19:18,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:18,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575237022] [2025-02-06 18:19:18,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:18,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:18,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:18,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:18,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:18,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:19:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54381535] [2025-02-06 18:19:18,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:18,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:18,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:18,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:18,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:19:18,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:18,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:18,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:18,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:18,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:19:18,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:18,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:18,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:19:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575237022] [2025-02-06 18:19:18,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:19:18,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54381535] [2025-02-06 18:19:18,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54381535] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:18,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:18,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:18,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453931649] [2025-02-06 18:19:18,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:18,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:18,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:18,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:18,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:18,661 INFO L87 Difference]: Start difference. First operand 1028 states and 1513 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:19,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:19,028 INFO L93 Difference]: Finished difference Result 1419 states and 2080 transitions. [2025-02-06 18:19:19,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:19,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:19:19,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:19,033 INFO L225 Difference]: With dead ends: 1419 [2025-02-06 18:19:19,033 INFO L226 Difference]: Without dead ends: 1417 [2025-02-06 18:19:19,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:19,035 INFO L435 NwaCegarLoop]: 1386 mSDtfsCounter, 549 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 4092 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:19,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 4092 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:19:19,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2025-02-06 18:19:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1034. [2025-02-06 18:19:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1011 states have (on average 1.47675568743818) internal successors, (1493), 1021 states have internal predecessors, (1493), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:19:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1520 transitions. [2025-02-06 18:19:19,060 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1520 transitions. Word has length 7 [2025-02-06 18:19:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:19,060 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1520 transitions. [2025-02-06 18:19:19,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1520 transitions. [2025-02-06 18:19:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 18:19:19,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:19,062 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] [2025-02-06 18:19:19,070 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-06 18:19:19,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:19,267 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:19,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash -601254076, now seen corresponding path program 1 times [2025-02-06 18:19:19,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332793416] [2025-02-06 18:19:19,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:19,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 18:19:19,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 18:19:19,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:19,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:19,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332793416] [2025-02-06 18:19:19,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332793416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662226625] [2025-02-06 18:19:19,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:19,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:19,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:19,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:19,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:19,594 INFO L87 Difference]: Start difference. First operand 1034 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:19,967 INFO L93 Difference]: Finished difference Result 2048 states and 3018 transitions. [2025-02-06 18:19:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-06 18:19:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:19,974 INFO L225 Difference]: With dead ends: 2048 [2025-02-06 18:19:19,974 INFO L226 Difference]: Without dead ends: 1416 [2025-02-06 18:19:19,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:19,977 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 550 mSDsluCounter, 2708 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 4095 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:19,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 4095 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:19:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-02-06 18:19:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1034. [2025-02-06 18:19:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1011 states have (on average 1.4757665677546983) internal successors, (1492), 1021 states have internal predecessors, (1492), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:19:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1519 transitions. [2025-02-06 18:19:20,001 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1519 transitions. Word has length 63 [2025-02-06 18:19:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1519 transitions. [2025-02-06 18:19:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1519 transitions. [2025-02-06 18:19:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-06 18:19:20,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:20,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:20,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:19:20,006 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:20,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1778893412, now seen corresponding path program 1 times [2025-02-06 18:19:20,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787024862] [2025-02-06 18:19:20,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:20,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:20,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-06 18:19:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-06 18:19:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787024862] [2025-02-06 18:19:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787024862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:20,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:20,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088014341] [2025-02-06 18:19:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:20,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:20,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:20,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:20,316 INFO L87 Difference]: Start difference. First operand 1034 states and 1519 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:20,678 INFO L93 Difference]: Finished difference Result 2442 states and 3587 transitions. [2025-02-06 18:19:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-02-06 18:19:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:20,683 INFO L225 Difference]: With dead ends: 2442 [2025-02-06 18:19:20,683 INFO L226 Difference]: Without dead ends: 1416 [2025-02-06 18:19:20,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:20,686 INFO L435 NwaCegarLoop]: 1430 mSDtfsCounter, 544 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4182 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:20,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4182 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:19:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2025-02-06 18:19:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1035. [2025-02-06 18:19:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1012 states have (on average 1.475296442687747) internal successors, (1493), 1022 states have internal predecessors, (1493), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:19:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1520 transitions. [2025-02-06 18:19:20,708 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1520 transitions. Word has length 81 [2025-02-06 18:19:20,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:20,708 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1520 transitions. [2025-02-06 18:19:20,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1520 transitions. [2025-02-06 18:19:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 18:19:20,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:20,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:19:20,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 47228085, now seen corresponding path program 1 times [2025-02-06 18:19:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082393233] [2025-02-06 18:19:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:20,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 18:19:20,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 18:19:20,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:20,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:20,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:20,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082393233] [2025-02-06 18:19:20,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082393233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:20,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:20,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:20,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449606435] [2025-02-06 18:19:20,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:20,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:20,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:20,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:20,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:20,972 INFO L87 Difference]: Start difference. First operand 1035 states and 1520 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:21,236 INFO L93 Difference]: Finished difference Result 2064 states and 3034 transitions. [2025-02-06 18:19:21,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:21,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 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 151 [2025-02-06 18:19:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:21,241 INFO L225 Difference]: With dead ends: 2064 [2025-02-06 18:19:21,241 INFO L226 Difference]: Without dead ends: 1038 [2025-02-06 18:19:21,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:21,243 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 105 mSDsluCounter, 2648 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 4014 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:21,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 4014 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-02-06 18:19:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1035. [2025-02-06 18:19:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 1012 states have (on average 1.4683794466403162) internal successors, (1486), 1022 states have internal predecessors, (1486), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 18:19:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1513 transitions. [2025-02-06 18:19:21,260 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1513 transitions. Word has length 151 [2025-02-06 18:19:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:21,261 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1513 transitions. [2025-02-06 18:19:21,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:21,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1513 transitions. [2025-02-06 18:19:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-06 18:19:21,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:21,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:21,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:19:21,263 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:21,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1353328785, now seen corresponding path program 1 times [2025-02-06 18:19:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040636454] [2025-02-06 18:19:21,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:21,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-06 18:19:21,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-06 18:19:21,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:21,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:21,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040636454] [2025-02-06 18:19:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040636454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557296203] [2025-02-06 18:19:21,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:21,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:19:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:21,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:19:21,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:21,455 INFO L87 Difference]: Start difference. First operand 1035 states and 1513 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:21,724 INFO L93 Difference]: Finished difference Result 2630 states and 3866 transitions. [2025-02-06 18:19:21,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:19:21,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2025-02-06 18:19:21,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:21,730 INFO L225 Difference]: With dead ends: 2630 [2025-02-06 18:19:21,730 INFO L226 Difference]: Without dead ends: 1604 [2025-02-06 18:19:21,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:21,732 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 789 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:21,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2750 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-02-06 18:19:21,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1446. [2025-02-06 18:19:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1421 states have (on average 1.474313863476425) internal successors, (2095), 1431 states have internal predecessors, (2095), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 18:19:21,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2126 transitions. [2025-02-06 18:19:21,761 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2126 transitions. Word has length 151 [2025-02-06 18:19:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2126 transitions. [2025-02-06 18:19:21,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:21,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2126 transitions. [2025-02-06 18:19:21,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 18:19:21,764 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:21,764 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:21,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:19:21,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash -758445742, now seen corresponding path program 1 times [2025-02-06 18:19:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365835393] [2025-02-06 18:19:21,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:21,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 18:19:21,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 18:19:21,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:21,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:19:22,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:22,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365835393] [2025-02-06 18:19:22,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365835393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929114781] [2025-02-06 18:19:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:22,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:22,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:22,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:22,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:22,051 INFO L87 Difference]: Start difference. First operand 1446 states and 2126 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-06 18:19:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:22,294 INFO L93 Difference]: Finished difference Result 2715 states and 3992 transitions. [2025-02-06 18:19:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:19:22,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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 166 [2025-02-06 18:19:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:22,300 INFO L225 Difference]: With dead ends: 2715 [2025-02-06 18:19:22,300 INFO L226 Difference]: Without dead ends: 1404 [2025-02-06 18:19:22,301 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-06 18:19:22,302 INFO L435 NwaCegarLoop]: 1294 mSDtfsCounter, 30 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:22,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3863 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-02-06 18:19:22,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-02-06 18:19:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1379 states have (on average 1.4633792603335751) internal successors, (2018), 1389 states have internal predecessors, (2018), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 18:19:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2049 transitions. [2025-02-06 18:19:22,327 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2049 transitions. Word has length 166 [2025-02-06 18:19:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:22,328 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2049 transitions. [2025-02-06 18:19:22,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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-06 18:19:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2049 transitions. [2025-02-06 18:19:22,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-06 18:19:22,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:22,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:22,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:19:22,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:22,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:22,330 INFO L85 PathProgramCache]: Analyzing trace with hash -336541940, now seen corresponding path program 1 times [2025-02-06 18:19:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:22,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386651641] [2025-02-06 18:19:22,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:22,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:22,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 18:19:22,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 18:19:22,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:22,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:19:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386651641] [2025-02-06 18:19:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386651641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539967215] [2025-02-06 18:19:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:19:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:22,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:19:22,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:22,571 INFO L87 Difference]: Start difference. First operand 1404 states and 2049 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-06 18:19:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:22,804 INFO L93 Difference]: Finished difference Result 3239 states and 4733 transitions. [2025-02-06 18:19:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:19:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 166 [2025-02-06 18:19:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:22,812 INFO L225 Difference]: With dead ends: 3239 [2025-02-06 18:19:22,812 INFO L226 Difference]: Without dead ends: 1970 [2025-02-06 18:19:22,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:22,814 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 669 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:22,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 2807 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:22,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2025-02-06 18:19:22,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1965. [2025-02-06 18:19:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1934 states have (on average 1.4622543950361944) internal successors, (2828), 1944 states have internal predecessors, (2828), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 18:19:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2871 transitions. [2025-02-06 18:19:22,849 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2871 transitions. Word has length 166 [2025-02-06 18:19:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:22,849 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2871 transitions. [2025-02-06 18:19:22,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-06 18:19:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2871 transitions. [2025-02-06 18:19:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 18:19:22,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:22,851 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:22,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:19:22,851 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:22,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1326810155, now seen corresponding path program 1 times [2025-02-06 18:19:22,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595697537] [2025-02-06 18:19:22,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 18:19:22,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 18:19:22,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:22,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:23,261 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:19:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595697537] [2025-02-06 18:19:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595697537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005409529] [2025-02-06 18:19:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:23,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:23,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:23,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:23,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:23,263 INFO L87 Difference]: Start difference. First operand 1965 states and 2871 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:23,561 INFO L93 Difference]: Finished difference Result 2030 states and 2956 transitions. [2025-02-06 18:19:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:23,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 181 [2025-02-06 18:19:23,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:23,568 INFO L225 Difference]: With dead ends: 2030 [2025-02-06 18:19:23,568 INFO L226 Difference]: Without dead ends: 2028 [2025-02-06 18:19:23,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:23,569 INFO L435 NwaCegarLoop]: 1345 mSDtfsCounter, 295 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3929 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:23,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3929 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:19:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2025-02-06 18:19:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 2028. [2025-02-06 18:19:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2028 states, 1994 states have (on average 1.4568706118355066) internal successors, (2905), 2004 states have internal predecessors, (2905), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 18:19:23,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2028 states to 2028 states and 2954 transitions. [2025-02-06 18:19:23,603 INFO L78 Accepts]: Start accepts. Automaton has 2028 states and 2954 transitions. Word has length 181 [2025-02-06 18:19:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:23,604 INFO L471 AbstractCegarLoop]: Abstraction has 2028 states and 2954 transitions. [2025-02-06 18:19:23,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2028 states and 2954 transitions. [2025-02-06 18:19:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 18:19:23,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:23,605 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:23,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:19:23,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:23,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 660757155, now seen corresponding path program 1 times [2025-02-06 18:19:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619824119] [2025-02-06 18:19:23,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 18:19:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 18:19:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:19:24,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619824119] [2025-02-06 18:19:24,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619824119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:19:24,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037977723] [2025-02-06 18:19:24,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:24,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:24,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:24,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:24,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:19:24,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 18:19:24,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 18:19:24,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:24,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:24,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 18:19:24,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:24,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:24,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:24,858 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-06 18:19:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:19:25,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:19:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037977723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:25,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:19:25,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:19:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349057076] [2025-02-06 18:19:25,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:19:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:25,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:19:25,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:19:25,434 INFO L87 Difference]: Start difference. First operand 2028 states and 2954 transitions. Second operand has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:27,854 INFO L93 Difference]: Finished difference Result 4016 states and 5847 transitions. [2025-02-06 18:19:27,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:19:27,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-02-06 18:19:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:27,862 INFO L225 Difference]: With dead ends: 4016 [2025-02-06 18:19:27,862 INFO L226 Difference]: Without dead ends: 2076 [2025-02-06 18:19:27,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:19:27,865 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 727 mSDsluCounter, 7182 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 8528 SdHoareTripleChecker+Invalid, 1807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:27,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 8528 Invalid, 1807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-06 18:19:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2025-02-06 18:19:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2053. [2025-02-06 18:19:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2019 states have (on average 1.453689945517583) internal successors, (2935), 2029 states have internal predecessors, (2935), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 18:19:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2984 transitions. [2025-02-06 18:19:27,896 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2984 transitions. Word has length 187 [2025-02-06 18:19:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:27,896 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 2984 transitions. [2025-02-06 18:19:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.454545454545455) internal successors, (170), 11 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2984 transitions. [2025-02-06 18:19:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 18:19:27,898 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:27,898 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:27,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 18:19:28,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:28,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:28,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1262940356, now seen corresponding path program 1 times [2025-02-06 18:19:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:28,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384463707] [2025-02-06 18:19:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:28,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 18:19:28,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 18:19:28,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:28,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:28,561 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:19:28,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384463707] [2025-02-06 18:19:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384463707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:19:28,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12105320] [2025-02-06 18:19:28,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:28,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:28,564 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:28,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:19:28,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 18:19:29,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 18:19:29,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:29,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:29,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 18:19:29,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:19:29,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:19:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12105320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:29,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:19:29,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-06 18:19:29,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829355118] [2025-02-06 18:19:29,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:29,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:29,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:29,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:29,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:19:29,120 INFO L87 Difference]: Start difference. First operand 2053 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:29,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:29,472 INFO L93 Difference]: Finished difference Result 4036 states and 5874 transitions. [2025-02-06 18:19:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2025-02-06 18:19:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:29,480 INFO L225 Difference]: With dead ends: 4036 [2025-02-06 18:19:29,480 INFO L226 Difference]: Without dead ends: 2096 [2025-02-06 18:19:29,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:19:29,484 INFO L435 NwaCegarLoop]: 1304 mSDtfsCounter, 17 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:29,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3746 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:19:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2025-02-06 18:19:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2080. [2025-02-06 18:19:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2046 states have (on average 1.4506353861192571) internal successors, (2968), 2056 states have internal predecessors, (2968), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 18:19:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 3017 transitions. [2025-02-06 18:19:29,531 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 3017 transitions. Word has length 188 [2025-02-06 18:19:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 2080 states and 3017 transitions. [2025-02-06 18:19:29,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 3017 transitions. [2025-02-06 18:19:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-06 18:19:29,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:29,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:29,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:19:29,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:29,738 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:29,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1579706950, now seen corresponding path program 1 times [2025-02-06 18:19:29,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:29,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648969851] [2025-02-06 18:19:29,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:29,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:29,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 18:19:29,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 18:19:29,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:29,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:19:30,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:30,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648969851] [2025-02-06 18:19:30,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648969851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:30,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:30,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:19:30,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609013510] [2025-02-06 18:19:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:30,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:19:30,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:30,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:19:30,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:19:30,076 INFO L87 Difference]: Start difference. First operand 2080 states and 3017 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:30,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:30,718 INFO L93 Difference]: Finished difference Result 4055 states and 5893 transitions. [2025-02-06 18:19:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:19:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2025-02-06 18:19:30,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:30,725 INFO L225 Difference]: With dead ends: 4055 [2025-02-06 18:19:30,726 INFO L226 Difference]: Without dead ends: 2092 [2025-02-06 18:19:30,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:19:30,730 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 8 mSDsluCounter, 4740 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6043 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:30,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6043 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 18:19:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2025-02-06 18:19:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2088. [2025-02-06 18:19:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2054 states have (on average 1.4498539435248297) internal successors, (2978), 2064 states have internal predecessors, (2978), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 18:19:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3027 transitions. [2025-02-06 18:19:30,768 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3027 transitions. Word has length 189 [2025-02-06 18:19:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:30,770 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 3027 transitions. [2025-02-06 18:19:30,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3027 transitions. [2025-02-06 18:19:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 18:19:30,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:30,772 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:30,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:19:30,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:30,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1294170680, now seen corresponding path program 1 times [2025-02-06 18:19:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:30,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487775191] [2025-02-06 18:19:30,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:30,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 18:19:30,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 18:19:30,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:30,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 18:19:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487775191] [2025-02-06 18:19:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487775191] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:19:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253892334] [2025-02-06 18:19:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:19:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:31,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:19:31,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:19:31,104 INFO L87 Difference]: Start difference. First operand 2088 states and 3027 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:31,825 INFO L93 Difference]: Finished difference Result 4070 states and 5913 transitions. [2025-02-06 18:19:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:19:31,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2025-02-06 18:19:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:31,832 INFO L225 Difference]: With dead ends: 4070 [2025-02-06 18:19:31,833 INFO L226 Difference]: Without dead ends: 2110 [2025-02-06 18:19:31,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:19:31,836 INFO L435 NwaCegarLoop]: 1295 mSDtfsCounter, 12 mSDsluCounter, 5928 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 7223 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:31,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 7223 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 18:19:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2025-02-06 18:19:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2104. [2025-02-06 18:19:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2104 states, 2070 states have (on average 1.4492753623188406) internal successors, (3000), 2080 states have internal predecessors, (3000), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 18:19:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 3049 transitions. [2025-02-06 18:19:31,880 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 3049 transitions. Word has length 190 [2025-02-06 18:19:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 2104 states and 3049 transitions. [2025-02-06 18:19:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:19:31,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 3049 transitions. [2025-02-06 18:19:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 18:19:31,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:31,882 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:31,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:19:31,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_int_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_int_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-02-06 18:19:31,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1857404142, now seen corresponding path program 1 times [2025-02-06 18:19:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:31,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69760059] [2025-02-06 18:19:31,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:31,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:31,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 18:19:32,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 18:19:32,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:32,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-06 18:19:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69760059] [2025-02-06 18:19:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69760059] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:19:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2227848] [2025-02-06 18:19:32,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:32,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:32,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:19:32,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 18:19:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 18:19:32,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:32,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 1078 conjuncts, 112 conjuncts are in the unsatisfiable core [2025-02-06 18:19:32,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:32,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:32,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:19:33,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:33,020 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-06 18:19:33,211 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 43 treesize of output 20 [2025-02-06 18:19:33,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:19:33,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2025-02-06 18:19:33,253 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-02-06 18:19:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-02-06 18:19:33,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-02-06 18:19:33,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 18:19:33,271 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 13 treesize of output 9 [2025-02-06 18:19:33,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 10 [2025-02-06 18:19:33,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2025-02-06 18:19:33,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3