./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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_nondet_test4-3.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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:21:41,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:21:41,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:21:41,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:21:41,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:21:41,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:21:41,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:21:41,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:21:41,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:21:41,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:21:41,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:21:41,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:21:41,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:21:41,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:21:41,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:21:41,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:21:41,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:21:41,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:21:41,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:21:41,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:21:41,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:21:41,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:21:41,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:21:41,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:21:41,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:21:41,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:21:41,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:21:41,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:21:41,667 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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2025-01-10 06:21:41,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:21:41,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:21:41,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:21:41,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:21:41,951 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:21:41,952 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_nondet_test4-3.i [2025-01-10 06:21:43,299 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/343257e62/2059ba8ab1114b71be8a07118d179feb/FLAGfd15d3e51 [2025-01-10 06:21:43,715 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:21:43,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test4-3.i [2025-01-10 06:21:43,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/343257e62/2059ba8ab1114b71be8a07118d179feb/FLAGfd15d3e51 [2025-01-10 06:21:43,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/343257e62/2059ba8ab1114b71be8a07118d179feb [2025-01-10 06:21:43,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:21:43,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:21:43,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:21:43,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:21:43,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:21:43,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:21:43" (1/1) ... [2025-01-10 06:21:43,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eee25a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:43, skipping insertion in model container [2025-01-10 06:21:43,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:21:43" (1/1) ... [2025-01-10 06:21:43,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:21:44,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:21:44,323 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:21:44,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:21:44,455 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:21:44,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44 WrapperNode [2025-01-10 06:21:44,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:21:44,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:21:44,457 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:21:44,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:21:44,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,554 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1813 [2025-01-10 06:21:44,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:21:44,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:21:44,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:21:44,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:21:44,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,728 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-01-10 06:21:44,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:21:44,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:21:44,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:21:44,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:21:44,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (1/1) ... [2025-01-10 06:21:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:21:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:21:44,864 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-01-10 06:21:44,868 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-01-10 06:21:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:21:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:21:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:21:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:21:44,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:21:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:21:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:21:44,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:21:44,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:21:45,138 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:21:45,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:21:46,910 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-01-10 06:21:46,911 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:21:46,933 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:21:46,934 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-10 06:21:46,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:21:46 BoogieIcfgContainer [2025-01-10 06:21:46,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:21:46,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:21:46,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:21:46,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:21:46,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:21:43" (1/3) ... [2025-01-10 06:21:46,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739e8556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:21:46, skipping insertion in model container [2025-01-10 06:21:46,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:21:44" (2/3) ... [2025-01-10 06:21:46,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739e8556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:21:46, skipping insertion in model container [2025-01-10 06:21:46,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:21:46" (3/3) ... [2025-01-10 06:21:46,943 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test4-3.i [2025-01-10 06:21:46,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:21:46,957 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_nondet_test4-3.i that has 3 procedures, 471 locations, 1 initial locations, 45 loop locations, and 4 error locations. [2025-01-10 06:21:47,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:21:47,033 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;@1a10d6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:21:47,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 06:21:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 455 states have (on average 1.6131868131868132) internal successors, (734), 459 states have internal predecessors, (734), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:21:47,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:47,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:21:47,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -699598054, now seen corresponding path program 1 times [2025-01-10 06:21:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402811378] [2025-01-10 06:21:47,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:47,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:21:47,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:21:47,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:47,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:21:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402811378] [2025-01-10 06:21:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402811378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:21:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015208454] [2025-01-10 06:21:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:47,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:21:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:21:47,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:21:47,278 INFO L87 Difference]: Start difference. First operand has 467 states, 455 states have (on average 1.6131868131868132) internal successors, (734), 459 states have internal predecessors, (734), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 1 states have (on average 7.0) 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-01-10 06:21:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:47,352 INFO L93 Difference]: Finished difference Result 929 states and 1487 transitions. [2025-01-10 06:21:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:21:47,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 7.0) 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-01-10 06:21:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:47,362 INFO L225 Difference]: With dead ends: 929 [2025-01-10 06:21:47,363 INFO L226 Difference]: Without dead ends: 396 [2025-01-10 06:21:47,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 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-01-10 06:21:47,371 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:47,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:21:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-01-10 06:21:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2025-01-10 06:21:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 386 states have (on average 1.4455958549222798) internal successors, (558), 388 states have internal predecessors, (558), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 570 transitions. [2025-01-10 06:21:47,436 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 570 transitions. Word has length 7 [2025-01-10 06:21:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:47,437 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 570 transitions. [2025-01-10 06:21:47,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 7.0) 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-01-10 06:21:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 570 transitions. [2025-01-10 06:21:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:21:47,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:47,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:21:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:21:47,439 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:47,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -212703126, now seen corresponding path program 1 times [2025-01-10 06:21:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180665561] [2025-01-10 06:21:47,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:47,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:47,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:21:47,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:21:47,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:47,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:21:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658094062] [2025-01-10 06:21:47,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:47,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:21:47,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:21:47,486 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-01-10 06:21:47,488 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-01-10 06:21:47,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:21:47,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:21:47,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:47,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:47,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:21:47,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:21:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:21:47,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:21:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180665561] [2025-01-10 06:21:47,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:21:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658094062] [2025-01-10 06:21:47,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658094062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:47,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:47,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:21:47,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59326515] [2025-01-10 06:21:47,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:47,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:21:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:47,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:21:47,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:21:47,708 INFO L87 Difference]: Start difference. First operand 396 states and 570 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 06:21:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:47,795 INFO L93 Difference]: Finished difference Result 781 states and 1129 transitions. [2025-01-10 06:21:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:21:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-01-10 06:21:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:47,804 INFO L225 Difference]: With dead ends: 781 [2025-01-10 06:21:47,804 INFO L226 Difference]: Without dead ends: 780 [2025-01-10 06:21:47,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-01-10 06:21:47,805 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 541 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:47,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1216 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:21:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-10 06:21:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 401. [2025-01-10 06:21:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.4398976982097187) internal successors, (563), 393 states have internal predecessors, (563), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 575 transitions. [2025-01-10 06:21:47,843 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 575 transitions. Word has length 8 [2025-01-10 06:21:47,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:47,843 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 575 transitions. [2025-01-10 06:21:47,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-01-10 06:21:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 575 transitions. [2025-01-10 06:21:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-10 06:21:47,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:47,855 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] [2025-01-10 06:21:47,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:21:48,057 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-01-10 06:21:48,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:48,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1546571738, now seen corresponding path program 1 times [2025-01-10 06:21:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:48,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228959051] [2025-01-10 06:21:48,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:48,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:48,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-10 06:21:48,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-10 06:21:48,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:48,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:21:48,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:48,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228959051] [2025-01-10 06:21:48,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228959051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:48,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:48,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:21:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042103066] [2025-01-10 06:21:48,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:48,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:21:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:48,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:21:48,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:21:48,827 INFO L87 Difference]: Start difference. First operand 401 states and 575 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-01-10 06:21:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:48,944 INFO L93 Difference]: Finished difference Result 797 states and 1145 transitions. [2025-01-10 06:21:48,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:21:48,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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 150 [2025-01-10 06:21:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:48,948 INFO L225 Difference]: With dead ends: 797 [2025-01-10 06:21:48,948 INFO L226 Difference]: Without dead ends: 404 [2025-01-10 06:21:48,951 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-01-10 06:21:48,952 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 105 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:48,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1536 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:21:48,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-10 06:21:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2025-01-10 06:21:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 391 states have (on average 1.421994884910486) internal successors, (556), 393 states have internal predecessors, (556), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 568 transitions. [2025-01-10 06:21:48,978 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 568 transitions. Word has length 150 [2025-01-10 06:21:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 568 transitions. [2025-01-10 06:21:48,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 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-01-10 06:21:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 568 transitions. [2025-01-10 06:21:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-10 06:21:48,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:48,985 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] [2025-01-10 06:21:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:21:48,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash -926309222, now seen corresponding path program 1 times [2025-01-10 06:21:48,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:48,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286306478] [2025-01-10 06:21:48,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:48,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:49,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-10 06:21:49,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-10 06:21:49,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:49,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:21:49,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:49,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286306478] [2025-01-10 06:21:49,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286306478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:49,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:49,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:21:49,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047255106] [2025-01-10 06:21:49,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:21:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:49,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:21:49,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:21:49,343 INFO L87 Difference]: Start difference. First operand 401 states and 568 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-01-10 06:21:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:49,409 INFO L93 Difference]: Finished difference Result 920 states and 1314 transitions. [2025-01-10 06:21:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:21:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 150 [2025-01-10 06:21:49,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:49,414 INFO L225 Difference]: With dead ends: 920 [2025-01-10 06:21:49,414 INFO L226 Difference]: Without dead ends: 527 [2025-01-10 06:21:49,416 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-01-10 06:21:49,418 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 134 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:49,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1116 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:21:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-10 06:21:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2025-01-10 06:21:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 517 states have (on average 1.4332688588007736) internal successors, (741), 519 states have internal predecessors, (741), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 753 transitions. [2025-01-10 06:21:49,438 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 753 transitions. Word has length 150 [2025-01-10 06:21:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:49,439 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 753 transitions. [2025-01-10 06:21:49,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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-01-10 06:21:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 753 transitions. [2025-01-10 06:21:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:21:49,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:49,442 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] [2025-01-10 06:21:49,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:21:49,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:49,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:49,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1947826921, now seen corresponding path program 1 times [2025-01-10 06:21:49,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:49,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631047394] [2025-01-10 06:21:49,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:49,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:21:49,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:21:49,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:49,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:21:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631047394] [2025-01-10 06:21:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631047394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:21:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326508765] [2025-01-10 06:21:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:49,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:21:49,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:49,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:21:49,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:21:49,819 INFO L87 Difference]: Start difference. First operand 527 states and 753 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-01-10 06:21:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:49,917 INFO L93 Difference]: Finished difference Result 940 states and 1343 transitions. [2025-01-10 06:21:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:21:49,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 165 [2025-01-10 06:21:49,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:49,924 INFO L225 Difference]: With dead ends: 940 [2025-01-10 06:21:49,924 INFO L226 Difference]: Without dead ends: 547 [2025-01-10 06:21:49,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:21:49,927 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 8 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:49,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1071 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:21:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-10 06:21:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-01-10 06:21:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 537 states have (on average 1.4171322160148976) internal successors, (761), 539 states have internal predecessors, (761), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 773 transitions. [2025-01-10 06:21:49,946 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 773 transitions. Word has length 165 [2025-01-10 06:21:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:49,947 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 773 transitions. [2025-01-10 06:21:49,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-01-10 06:21:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 773 transitions. [2025-01-10 06:21:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:21:49,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:49,950 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] [2025-01-10 06:21:49,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:21:49,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:49,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1811667219, now seen corresponding path program 1 times [2025-01-10 06:21:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:49,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095031964] [2025-01-10 06:21:49,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:50,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:21:50,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:21:50,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:50,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:21:50,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:50,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095031964] [2025-01-10 06:21:50,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095031964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:50,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:50,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:21:50,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035894321] [2025-01-10 06:21:50,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:50,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:21:50,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:50,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:21:50,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:21:50,342 INFO L87 Difference]: Start difference. First operand 547 states and 773 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-01-10 06:21:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:50,423 INFO L93 Difference]: Finished difference Result 898 states and 1264 transitions. [2025-01-10 06:21:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:21:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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 165 [2025-01-10 06:21:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:50,428 INFO L225 Difference]: With dead ends: 898 [2025-01-10 06:21:50,428 INFO L226 Difference]: Without dead ends: 485 [2025-01-10 06:21:50,430 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-01-10 06:21:50,430 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 32 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:50,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1363 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:21:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-01-10 06:21:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-01-10 06:21:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 475 states have (on average 1.391578947368421) internal successors, (661), 477 states have internal predecessors, (661), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:21:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 673 transitions. [2025-01-10 06:21:50,457 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 673 transitions. Word has length 165 [2025-01-10 06:21:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:50,457 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 673 transitions. [2025-01-10 06:21:50,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 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-01-10 06:21:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 673 transitions. [2025-01-10 06:21:50,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-10 06:21:50,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:50,459 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] [2025-01-10 06:21:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:21:50,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:50,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -288587361, now seen corresponding path program 1 times [2025-01-10 06:21:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688862193] [2025-01-10 06:21:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-10 06:21:50,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-10 06:21:50,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:50,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:21:50,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688862193] [2025-01-10 06:21:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688862193] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:50,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:50,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:21:50,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826915319] [2025-01-10 06:21:50,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:50,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:21:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:50,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:21:50,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:21:50,765 INFO L87 Difference]: Start difference. First operand 485 states and 673 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-01-10 06:21:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:50,813 INFO L93 Difference]: Finished difference Result 981 states and 1347 transitions. [2025-01-10 06:21:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:21:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 165 [2025-01-10 06:21:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:50,820 INFO L225 Difference]: With dead ends: 981 [2025-01-10 06:21:50,820 INFO L226 Difference]: Without dead ends: 630 [2025-01-10 06:21:50,821 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-01-10 06:21:50,822 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 243 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:50,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 950 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:21:50,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2025-01-10 06:21:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2025-01-10 06:21:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 617 states have (on average 1.3743922204213939) internal successors, (848), 619 states have internal predecessors, (848), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 06:21:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 866 transitions. [2025-01-10 06:21:50,843 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 866 transitions. Word has length 165 [2025-01-10 06:21:50,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:50,843 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 866 transitions. [2025-01-10 06:21:50,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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-01-10 06:21:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 866 transitions. [2025-01-10 06:21:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-10 06:21:50,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:50,845 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] [2025-01-10 06:21:50,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:21:50,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:50,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash -981800990, now seen corresponding path program 1 times [2025-01-10 06:21:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064751331] [2025-01-10 06:21:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-10 06:21:50,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-10 06:21:50,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:21:51,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:51,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064751331] [2025-01-10 06:21:51,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064751331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:51,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:51,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:21:51,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083828655] [2025-01-10 06:21:51,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:51,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:21:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:51,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:21:51,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:21:51,251 INFO L87 Difference]: Start difference. First operand 630 states and 866 transitions. Second operand has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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-01-10 06:21:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:51,333 INFO L93 Difference]: Finished difference Result 696 states and 952 transitions. [2025-01-10 06:21:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:21:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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 180 [2025-01-10 06:21:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:51,337 INFO L225 Difference]: With dead ends: 696 [2025-01-10 06:21:51,337 INFO L226 Difference]: Without dead ends: 694 [2025-01-10 06:21:51,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:21:51,338 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 295 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:51,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1499 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:21:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-10 06:21:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2025-01-10 06:21:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 678 states have (on average 1.3657817109144543) internal successors, (926), 680 states have internal predecessors, (926), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:21:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 950 transitions. [2025-01-10 06:21:51,358 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 950 transitions. Word has length 180 [2025-01-10 06:21:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:51,358 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 950 transitions. [2025-01-10 06:21:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 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-01-10 06:21:51,359 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 950 transitions. [2025-01-10 06:21:51,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 06:21:51,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:51,361 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] [2025-01-10 06:21:51,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:21:51,361 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:51,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash -470442647, now seen corresponding path program 1 times [2025-01-10 06:21:51,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:51,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088880686] [2025-01-10 06:21:51,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:51,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:21:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:21:52,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:52,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:21:52,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088880686] [2025-01-10 06:21:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088880686] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:21:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443715765] [2025-01-10 06:21:52,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:52,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:21:52,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:21:52,483 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-01-10 06:21:52,487 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-01-10 06:21:52,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:21:53,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:21:53,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:53,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:53,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:21:53,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:21:53,221 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-01-10 06:21:53,247 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 21 treesize of output 20 [2025-01-10 06:21:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:21:54,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:21:54,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443715765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:54,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:21:54,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-10 06:21:54,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940091501] [2025-01-10 06:21:54,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:54,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:21:54,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:54,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:21:54,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:21:54,162 INFO L87 Difference]: Start difference. First operand 694 states and 950 transitions. Second operand has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 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-01-10 06:21:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:57,162 INFO L93 Difference]: Finished difference Result 1349 states and 1840 transitions. [2025-01-10 06:21:57,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:21:57,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 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 186 [2025-01-10 06:21:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:57,166 INFO L225 Difference]: With dead ends: 1349 [2025-01-10 06:21:57,166 INFO L226 Difference]: Without dead ends: 742 [2025-01-10 06:21:57,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 06:21:57,168 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 719 mSDsluCounter, 2475 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:57,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2949 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-10 06:21:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-01-10 06:21:57,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 719. [2025-01-10 06:21:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 703 states have (on average 1.3598862019914653) internal successors, (956), 705 states have internal predecessors, (956), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:21:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 980 transitions. [2025-01-10 06:21:57,190 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 980 transitions. Word has length 186 [2025-01-10 06:21:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:57,190 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 980 transitions. [2025-01-10 06:21:57,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.083333333333334) internal successors, (169), 12 states have internal predecessors, (169), 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-01-10 06:21:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 980 transitions. [2025-01-10 06:21:57,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:21:57,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:57,193 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-01-10 06:21:57,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:21:57,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:21:57,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:57,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276197, now seen corresponding path program 1 times [2025-01-10 06:21:57,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:57,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492888044] [2025-01-10 06:21:57,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:57,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:21:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:21:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:21:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492888044] [2025-01-10 06:21:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492888044] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:21:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113532074] [2025-01-10 06:21:58,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:58,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:21:58,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:21:58,232 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-01-10 06:21:58,235 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-01-10 06:21:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:21:58,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:21:58,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:58,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:21:58,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:21:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:21:58,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:21:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113532074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:58,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:21:58,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:21:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262802566] [2025-01-10 06:21:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:21:58,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:58,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:21:58,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:21:58,957 INFO L87 Difference]: Start difference. First operand 719 states and 980 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-01-10 06:21:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:21:59,166 INFO L93 Difference]: Finished difference Result 1369 states and 1867 transitions. [2025-01-10 06:21:59,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:21:59,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-01-10 06:21:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:21:59,171 INFO L225 Difference]: With dead ends: 1369 [2025-01-10 06:21:59,172 INFO L226 Difference]: Without dead ends: 762 [2025-01-10 06:21:59,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 186 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-01-10 06:21:59,173 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 17 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:21:59,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1223 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:21:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-10 06:21:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 746. [2025-01-10 06:21:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 730 states have (on average 1.3547945205479452) internal successors, (989), 732 states have internal predecessors, (989), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:21:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1013 transitions. [2025-01-10 06:21:59,196 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1013 transitions. Word has length 187 [2025-01-10 06:21:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:21:59,196 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1013 transitions. [2025-01-10 06:21:59,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 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-01-10 06:21:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1013 transitions. [2025-01-10 06:21:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:21:59,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:21:59,198 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-01-10 06:21:59,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:21:59,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:21:59,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:21:59,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:21:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1329958418, now seen corresponding path program 1 times [2025-01-10 06:21:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:21:59,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103128166] [2025-01-10 06:21:59,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:21:59,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:21:59,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:21:59,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:21:59,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:21:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:21:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:21:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:21:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103128166] [2025-01-10 06:21:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103128166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:21:59,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:21:59,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:21:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027692767] [2025-01-10 06:21:59,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:21:59,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:21:59,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:21:59,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:21:59,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:21:59,907 INFO L87 Difference]: Start difference. First operand 746 states and 1013 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 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-01-10 06:22:00,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:00,401 INFO L93 Difference]: Finished difference Result 1388 states and 1886 transitions. [2025-01-10 06:22:00,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:22:00,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 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-01-10 06:22:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:00,406 INFO L225 Difference]: With dead ends: 1388 [2025-01-10 06:22:00,406 INFO L226 Difference]: Without dead ends: 758 [2025-01-10 06:22:00,407 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-01-10 06:22:00,408 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 8 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:00,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1807 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:22:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-01-10 06:22:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 754. [2025-01-10 06:22:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 738 states have (on average 1.353658536585366) internal successors, (999), 740 states have internal predecessors, (999), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1023 transitions. [2025-01-10 06:22:00,435 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1023 transitions. Word has length 188 [2025-01-10 06:22:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:00,435 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1023 transitions. [2025-01-10 06:22:00,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 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-01-10 06:22:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1023 transitions. [2025-01-10 06:22:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:22:00,437 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:00,438 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-01-10 06:22:00,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:22:00,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:00,439 INFO L85 PathProgramCache]: Analyzing trace with hash -845637086, now seen corresponding path program 1 times [2025-01-10 06:22:00,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:00,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54690106] [2025-01-10 06:22:00,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:00,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:22:00,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:22:00,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:00,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:22:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:00,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54690106] [2025-01-10 06:22:00,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54690106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:22:00,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:22:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704043218] [2025-01-10 06:22:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:22:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:00,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:22:00,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:22:00,944 INFO L87 Difference]: Start difference. First operand 754 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:01,559 INFO L93 Difference]: Finished difference Result 1403 states and 1906 transitions. [2025-01-10 06:22:01,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:22:01,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:01,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:01,564 INFO L225 Difference]: With dead ends: 1403 [2025-01-10 06:22:01,564 INFO L226 Difference]: Without dead ends: 776 [2025-01-10 06:22:01,565 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-01-10 06:22:01,566 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 12 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:01,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2138 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:22:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-01-10 06:22:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 770. [2025-01-10 06:22:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 754 states have (on average 1.3541114058355437) internal successors, (1021), 756 states have internal predecessors, (1021), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1045 transitions. [2025-01-10 06:22:01,596 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1045 transitions. Word has length 189 [2025-01-10 06:22:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:01,596 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1045 transitions. [2025-01-10 06:22:01,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1045 transitions. [2025-01-10 06:22:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:22:01,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:01,602 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-01-10 06:22:01,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:22:01,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:01,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1202105154, now seen corresponding path program 1 times [2025-01-10 06:22:01,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:01,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877893511] [2025-01-10 06:22:01,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:01,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:01,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:22:02,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:22:02,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:02,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:22:02,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877893511] [2025-01-10 06:22:02,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877893511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:02,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553544250] [2025-01-10 06:22:02,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:02,559 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-01-10 06:22:02,561 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-01-10 06:22:02,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:22:03,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:22:03,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:03,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:22:03,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:22:05,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:22:05,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553544250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:05,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:22:05,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:22:05,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165348772] [2025-01-10 06:22:05,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:05,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:22:05,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:05,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:22:05,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:22:05,073 INFO L87 Difference]: Start difference. First operand 770 states and 1045 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:05,736 INFO L93 Difference]: Finished difference Result 1419 states and 1927 transitions. [2025-01-10 06:22:05,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:22:05,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:05,740 INFO L225 Difference]: With dead ends: 1419 [2025-01-10 06:22:05,741 INFO L226 Difference]: Without dead ends: 784 [2025-01-10 06:22:05,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:22:05,742 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 12 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:05,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2145 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:22:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-10 06:22:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 770. [2025-01-10 06:22:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 754 states have (on average 1.3541114058355437) internal successors, (1021), 756 states have internal predecessors, (1021), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:05,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1045 transitions. [2025-01-10 06:22:05,766 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1045 transitions. Word has length 189 [2025-01-10 06:22:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1045 transitions. [2025-01-10 06:22:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 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-01-10 06:22:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1045 transitions. [2025-01-10 06:22:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:22:05,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:05,768 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-01-10 06:22:05,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:22:05,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:22:05,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:05,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash -287837478, now seen corresponding path program 1 times [2025-01-10 06:22:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369962986] [2025-01-10 06:22:05,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:06,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:22:06,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:22:06,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:06,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:06,481 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:22:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:06,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369962986] [2025-01-10 06:22:06,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369962986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:06,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:22:06,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:22:06,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591729135] [2025-01-10 06:22:06,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:06,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:22:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:06,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:22:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:22:06,484 INFO L87 Difference]: Start difference. First operand 770 states and 1045 transitions. Second operand has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 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-01-10 06:22:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:07,090 INFO L93 Difference]: Finished difference Result 1426 states and 1933 transitions. [2025-01-10 06:22:07,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:22:07,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 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-01-10 06:22:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:07,094 INFO L225 Difference]: With dead ends: 1426 [2025-01-10 06:22:07,094 INFO L226 Difference]: Without dead ends: 796 [2025-01-10 06:22:07,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:22:07,097 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 20 mSDsluCounter, 2172 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:07,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2632 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:22:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-01-10 06:22:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 784. [2025-01-10 06:22:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 768 states have (on average 1.3528645833333333) internal successors, (1039), 770 states have internal predecessors, (1039), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:07,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1063 transitions. [2025-01-10 06:22:07,118 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1063 transitions. Word has length 190 [2025-01-10 06:22:07,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:07,119 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1063 transitions. [2025-01-10 06:22:07,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.22222222222222) internal successors, (173), 9 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-01-10 06:22:07,119 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1063 transitions. [2025-01-10 06:22:07,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:22:07,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:07,121 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-01-10 06:22:07,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:22:07,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1546554302, now seen corresponding path program 1 times [2025-01-10 06:22:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322860058] [2025-01-10 06:22:07,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:07,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:22:07,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:22:07,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:07,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:07,958 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:22:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322860058] [2025-01-10 06:22:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322860058] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019784130] [2025-01-10 06:22:07,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:07,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:07,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:07,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:22:07,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:22:08,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:22:08,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:22:08,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:08,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:08,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-10 06:22:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:22:08,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:22:08,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019784130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:08,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:22:08,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-01-10 06:22:08,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391789701] [2025-01-10 06:22:08,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:08,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:22:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:08,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:22:08,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:22:08,822 INFO L87 Difference]: Start difference. First operand 784 states and 1063 transitions. Second operand has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 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-01-10 06:22:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:09,716 INFO L93 Difference]: Finished difference Result 1447 states and 1960 transitions. [2025-01-10 06:22:09,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:22:09,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 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-01-10 06:22:09,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:09,721 INFO L225 Difference]: With dead ends: 1447 [2025-01-10 06:22:09,721 INFO L226 Difference]: Without dead ends: 810 [2025-01-10 06:22:09,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:22:09,723 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 17 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2523 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:09,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2523 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-10 06:22:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-10 06:22:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 794. [2025-01-10 06:22:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 778 states have (on average 1.3508997429305913) internal successors, (1051), 780 states have internal predecessors, (1051), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1075 transitions. [2025-01-10 06:22:09,749 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1075 transitions. Word has length 190 [2025-01-10 06:22:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1075 transitions. [2025-01-10 06:22:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.625) internal successors, (173), 8 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-01-10 06:22:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1075 transitions. [2025-01-10 06:22:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:22:09,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:09,752 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, 1] [2025-01-10 06:22:09,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:22:09,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-10 06:22:09,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:09,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1706043762, now seen corresponding path program 1 times [2025-01-10 06:22:09,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:09,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680888232] [2025-01-10 06:22:09,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:10,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:22:10,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:22:10,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:10,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:22:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:10,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680888232] [2025-01-10 06:22:10,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680888232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:22:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:22:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585269770] [2025-01-10 06:22:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:10,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:22:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:22:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:22:10,541 INFO L87 Difference]: Start difference. First operand 794 states and 1075 transitions. Second operand has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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-01-10 06:22:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:11,385 INFO L93 Difference]: Finished difference Result 1459 states and 1976 transitions. [2025-01-10 06:22:11,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:22:11,386 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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 191 [2025-01-10 06:22:11,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:11,389 INFO L225 Difference]: With dead ends: 1459 [2025-01-10 06:22:11,389 INFO L226 Difference]: Without dead ends: 812 [2025-01-10 06:22:11,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:22:11,391 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 23 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:11,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3215 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-10 06:22:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-10 06:22:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 800. [2025-01-10 06:22:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 784 states have (on average 1.3482142857142858) internal successors, (1057), 786 states have internal predecessors, (1057), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-10 06:22:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1081 transitions. [2025-01-10 06:22:11,409 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1081 transitions. Word has length 191 [2025-01-10 06:22:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1081 transitions. [2025-01-10 06:22:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.4) internal successors, (174), 10 states have internal predecessors, (174), 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-01-10 06:22:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1081 transitions. [2025-01-10 06:22:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:22:11,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:11,411 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, 1] [2025-01-10 06:22:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:22:11,412 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:11,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:11,412 INFO L85 PathProgramCache]: Analyzing trace with hash -674473430, now seen corresponding path program 1 times [2025-01-10 06:22:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000096554] [2025-01-10 06:22:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:11,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:22:11,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:22:11,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:11,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-10 06:22:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000096554] [2025-01-10 06:22:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000096554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034770148] [2025-01-10 06:22:12,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:12,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:12,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:22:12,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:22:12,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:22:12,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:22:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:12,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:22:12,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 06:22:12,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:22:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034770148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:22:12,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 6 [2025-01-10 06:22:12,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783634039] [2025-01-10 06:22:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:22:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:12,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:22:12,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:22:12,825 INFO L87 Difference]: Start difference. First operand 800 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:22:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:12,915 INFO L93 Difference]: Finished difference Result 1413 states and 1915 transitions. [2025-01-10 06:22:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:22:12,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2025-01-10 06:22:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:12,923 INFO L225 Difference]: With dead ends: 1413 [2025-01-10 06:22:12,923 INFO L226 Difference]: Without dead ends: 803 [2025-01-10 06:22:12,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:22:12,925 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 449 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:12,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1999 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:22:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-01-10 06:22:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-01-10 06:22:12,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 786 states have (on average 1.3486005089058524) internal successors, (1060), 789 states have internal predecessors, (1060), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:22:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1088 transitions. [2025-01-10 06:22:12,953 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1088 transitions. Word has length 191 [2025-01-10 06:22:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:12,953 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1088 transitions. [2025-01-10 06:22:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:22:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1088 transitions. [2025-01-10 06:22:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:22:12,956 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:12,956 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-01-10 06:22:12,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-10 06:22:13,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 06:22:13,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:13,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash 390723882, now seen corresponding path program 1 times [2025-01-10 06:22:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807372766] [2025-01-10 06:22:13,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:13,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:13,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:13,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:13,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:22:13,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807372766] [2025-01-10 06:22:13,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807372766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:13,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965405333] [2025-01-10 06:22:13,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:13,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:13,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:22:13,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:22:14,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:15,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:15,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-10 06:22:15,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:22:15,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:22:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965405333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:22:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 13 [2025-01-10 06:22:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701871783] [2025-01-10 06:22:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:22:15,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:22:15,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:22:15,918 INFO L87 Difference]: Start difference. First operand 803 states and 1088 transitions. Second operand has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-01-10 06:22:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:17,003 INFO L93 Difference]: Finished difference Result 1480 states and 2010 transitions. [2025-01-10 06:22:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:22:17,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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 195 [2025-01-10 06:22:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:17,010 INFO L225 Difference]: With dead ends: 1480 [2025-01-10 06:22:17,011 INFO L226 Difference]: Without dead ends: 827 [2025-01-10 06:22:17,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:22:17,013 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 17 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:17,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3147 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-10 06:22:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-10 06:22:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 817. [2025-01-10 06:22:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 800 states have (on average 1.3475) internal successors, (1078), 803 states have internal predecessors, (1078), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:22:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1106 transitions. [2025-01-10 06:22:17,070 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1106 transitions. Word has length 195 [2025-01-10 06:22:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1106 transitions. [2025-01-10 06:22:17,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.5) internal successors, (175), 10 states have internal predecessors, (175), 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-01-10 06:22:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1106 transitions. [2025-01-10 06:22:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:22:17,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:17,073 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-01-10 06:22:17,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:22:17,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:17,274 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:17,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:17,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1393082198, now seen corresponding path program 1 times [2025-01-10 06:22:17,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:17,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056917008] [2025-01-10 06:22:17,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:17,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:17,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:18,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:18,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:22:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056917008] [2025-01-10 06:22:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056917008] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:18,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251559424] [2025-01-10 06:22:18,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:18,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:18,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:18,436 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:22:18,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:22:19,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:19,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:19,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:19,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:19,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 06:22:19,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-10 06:22:19,411 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:22:19,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251559424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:22:19,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:22:19,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-01-10 06:22:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977701896] [2025-01-10 06:22:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:22:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:22:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:22:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:22:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:22:19,415 INFO L87 Difference]: Start difference. First operand 817 states and 1106 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-01-10 06:22:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:22:19,828 INFO L93 Difference]: Finished difference Result 1500 states and 2034 transitions. [2025-01-10 06:22:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:22:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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 195 [2025-01-10 06:22:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:22:19,831 INFO L225 Difference]: With dead ends: 1500 [2025-01-10 06:22:19,832 INFO L226 Difference]: Without dead ends: 845 [2025-01-10 06:22:19,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:22:19,833 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 39 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:22:19,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2230 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:22:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-01-10 06:22:19,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 831. [2025-01-10 06:22:19,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 814 states have (on average 1.348894348894349) internal successors, (1098), 817 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-01-10 06:22:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1126 transitions. [2025-01-10 06:22:19,862 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1126 transitions. Word has length 195 [2025-01-10 06:22:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:22:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1126 transitions. [2025-01-10 06:22:19,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 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-01-10 06:22:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1126 transitions. [2025-01-10 06:22:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-10 06:22:19,864 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:22:19,865 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-01-10 06:22:19,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:22:20,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:20,065 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 06:22:20,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:22:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1746275651, now seen corresponding path program 1 times [2025-01-10 06:22:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:22:20,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324854452] [2025-01-10 06:22:20,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:22:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:20,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:20,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:20,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-10 06:22:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:22:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324854452] [2025-01-10 06:22:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324854452] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:22:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228305696] [2025-01-10 06:22:20,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:22:20,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:22:20,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:22:20,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:22:20,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:22:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-10 06:22:21,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-10 06:22:21,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:22:21,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:22:21,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-01-10 06:22:21,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:22:21,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-01-10 06:22:21,965 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 11 treesize of output 7 [2025-01-10 06:22:22,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2025-01-10 06:22:22,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-01-10 06:22:22,417 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 11 treesize of output 7 [2025-01-10 06:22:22,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-10 06:22:22,425 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 15 treesize of output 1 [2025-01-10 06:22:22,442 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:22:22,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-01-10 06:22:22,545 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 18 treesize of output 10 [2025-01-10 06:22:22,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 06:22:22,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-10 06:22:22,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 43 [2025-01-10 06:22:22,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-10 06:22:22,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11