./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_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_BER_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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:12:55,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:12:55,582 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:12:55,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:12:55,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:12:55,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:12:55,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:12:55,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:12:55,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:12:55,622 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:12:55,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:12:55,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:12:55,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:12:55,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:12:55,624 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:12:55,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:12:55,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:12:55,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:12:55,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:12:55,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:12:55,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:12:55,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:12:55,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:12:55,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:12:55,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:12:55,627 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:12:55,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:12:55,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:12:55,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:12:55,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:12:55,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:12:55,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:12:55,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:12:55,628 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2025-01-10 06:12:55,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:12:55,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:12:55,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:12:55,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:12:55,903 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:12:55,904 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_BER_test4-3.i [2025-01-10 06:12:57,152 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bafe384f8/c4bb6be7ce6245bc91fef789ba8a5ff7/FLAGb643ae817 [2025-01-10 06:12:57,534 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:12:57,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2025-01-10 06:12:57,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bafe384f8/c4bb6be7ce6245bc91fef789ba8a5ff7/FLAGb643ae817 [2025-01-10 06:12:57,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bafe384f8/c4bb6be7ce6245bc91fef789ba8a5ff7 [2025-01-10 06:12:57,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:12:57,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:12:57,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:12:57,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:12:57,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:12:57,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:12:57" (1/1) ... [2025-01-10 06:12:57,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4add3508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:57, skipping insertion in model container [2025-01-10 06:12:57,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:12:57" (1/1) ... [2025-01-10 06:12:57,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:12:58,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:12:58,107 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:12:58,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:12:58,258 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:12:58,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58 WrapperNode [2025-01-10 06:12:58,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:12:58,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:12:58,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:12:58,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:12:58,264 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:12:58" (1/1) ... [2025-01-10 06:12:58,298 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:12:58" (1/1) ... [2025-01-10 06:12:58,352 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-01-10 06:12:58,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:12:58,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:12:58,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:12:58,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:12:58,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,554 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:12:58,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,637 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:12:58,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:12:58,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:12:58,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:12:58,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (1/1) ... [2025-01-10 06:12:58,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:12:58,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:12:58,714 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:12:58,720 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:12:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:12:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:12:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:12:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:12:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:12:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:12:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:12:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:12:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:12:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:12:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:12:58,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:12:58,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:12:58,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:12:58,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:12:58,983 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:12:58,986 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:13:00,699 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-01-10 06:13:00,699 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:13:00,722 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:13:00,723 INFO L312 CfgBuilder]: Removed 36 assume(true) statements. [2025-01-10 06:13:00,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:13:00 BoogieIcfgContainer [2025-01-10 06:13:00,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:13:00,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:13:00,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:13:00,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:13:00,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:12:57" (1/3) ... [2025-01-10 06:13:00,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609af29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:13:00, skipping insertion in model container [2025-01-10 06:13:00,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:12:58" (2/3) ... [2025-01-10 06:13:00,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609af29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:13:00, skipping insertion in model container [2025-01-10 06:13:00,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:13:00" (3/3) ... [2025-01-10 06:13:00,733 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2025-01-10 06:13:00,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:13:00,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test4-3.i that has 4 procedures, 496 locations, 1 initial locations, 45 loop locations, and 6 error locations. [2025-01-10 06:13:00,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:13:00,818 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;@33f33aa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:13:00,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:13:00,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 492 states, 467 states have (on average 1.6188436830835118) internal successors, (756), 483 states have internal predecessors, (756), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-10 06:13:00,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:00,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:13:00,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:00,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:00,829 INFO L85 PathProgramCache]: Analyzing trace with hash 45424403, now seen corresponding path program 1 times [2025-01-10 06:13:00,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:00,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264620297] [2025-01-10 06:13:00,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:00,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:13:00,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:13:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:00,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:01,003 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:13:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264620297] [2025-01-10 06:13:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264620297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:01,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:01,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:01,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648174320] [2025-01-10 06:13:01,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:01,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:01,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:01,051 INFO L87 Difference]: Start difference. First operand has 492 states, 467 states have (on average 1.6188436830835118) internal successors, (756), 483 states have internal predecessors, (756), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:13:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:01,205 INFO L93 Difference]: Finished difference Result 1364 states and 2205 transitions. [2025-01-10 06:13:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-10 06:13:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:01,227 INFO L225 Difference]: With dead ends: 1364 [2025-01-10 06:13:01,227 INFO L226 Difference]: Without dead ends: 810 [2025-01-10 06:13:01,238 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:13:01,240 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 545 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:01,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1485 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2025-01-10 06:13:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 431. [2025-01-10 06:13:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4534313725490196) internal successors, (593), 422 states have internal predecessors, (593), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 625 transitions. [2025-01-10 06:13:01,322 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 625 transitions. Word has length 5 [2025-01-10 06:13:01,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:01,323 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 625 transitions. [2025-01-10 06:13:01,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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:13:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 625 transitions. [2025-01-10 06:13:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:13:01,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:01,332 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] [2025-01-10 06:13:01,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:13:01,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:01,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:01,334 INFO L85 PathProgramCache]: Analyzing trace with hash 191633172, now seen corresponding path program 1 times [2025-01-10 06:13:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581978135] [2025-01-10 06:13:01,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:01,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:01,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:13:01,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:13:01,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:02,092 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:13:02,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:02,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581978135] [2025-01-10 06:13:02,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581978135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:02,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:02,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:13:02,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190601492] [2025-01-10 06:13:02,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:02,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:02,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:02,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:02,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:02,096 INFO L87 Difference]: Start difference. First operand 431 states and 625 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:13:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:02,218 INFO L93 Difference]: Finished difference Result 858 states and 1246 transitions. [2025-01-10 06:13:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:02,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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 149 [2025-01-10 06:13:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:02,222 INFO L225 Difference]: With dead ends: 858 [2025-01-10 06:13:02,222 INFO L226 Difference]: Without dead ends: 434 [2025-01-10 06:13:02,223 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:13:02,226 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 105 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1686 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:13:02,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1686 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-10 06:13:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2025-01-10 06:13:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.4362745098039216) internal successors, (586), 422 states have internal predecessors, (586), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 618 transitions. [2025-01-10 06:13:02,251 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 618 transitions. Word has length 149 [2025-01-10 06:13:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:02,252 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 618 transitions. [2025-01-10 06:13:02,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 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:13:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 618 transitions. [2025-01-10 06:13:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-10 06:13:02,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:02,255 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] [2025-01-10 06:13:02,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:13:02,255 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:02,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1530373384, now seen corresponding path program 1 times [2025-01-10 06:13:02,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:02,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188626514] [2025-01-10 06:13:02,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:02,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:02,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-10 06:13:02,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-10 06:13:02,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:02,568 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:13:02,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188626514] [2025-01-10 06:13:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188626514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040681270] [2025-01-10 06:13:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:02,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:02,571 INFO L87 Difference]: Start difference. First operand 431 states and 618 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:13:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:02,652 INFO L93 Difference]: Finished difference Result 981 states and 1415 transitions. [2025-01-10 06:13:02,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:02,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-01-10 06:13:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:02,664 INFO L225 Difference]: With dead ends: 981 [2025-01-10 06:13:02,664 INFO L226 Difference]: Without dead ends: 557 [2025-01-10 06:13:02,665 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:13:02,665 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 134 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1217 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:13:02,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1217 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-10 06:13:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-10 06:13:02,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 534 states have (on average 1.4438202247191012) internal successors, (771), 548 states have internal predecessors, (771), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 803 transitions. [2025-01-10 06:13:02,694 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 803 transitions. Word has length 149 [2025-01-10 06:13:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:02,695 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 803 transitions. [2025-01-10 06:13:02,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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:13:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 803 transitions. [2025-01-10 06:13:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:13:02,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:02,700 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] [2025-01-10 06:13:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:13:02,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:02,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1371822598, now seen corresponding path program 1 times [2025-01-10 06:13:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613385295] [2025-01-10 06:13:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:02,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:13:02,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:13:02,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:02,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:03,198 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:13:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613385295] [2025-01-10 06:13:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613385295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:03,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:03,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:13:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474136999] [2025-01-10 06:13:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:03,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:03,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:03,203 INFO L87 Difference]: Start difference. First operand 557 states and 803 transitions. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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:13:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:03,307 INFO L93 Difference]: Finished difference Result 939 states and 1348 transitions. [2025-01-10 06:13:03,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:13:03,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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 164 [2025-01-10 06:13:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:03,313 INFO L225 Difference]: With dead ends: 939 [2025-01-10 06:13:03,313 INFO L226 Difference]: Without dead ends: 515 [2025-01-10 06:13:03,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:03,316 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 30 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:03,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1517 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-01-10 06:13:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-01-10 06:13:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 492 states have (on average 1.410569105691057) internal successors, (694), 506 states have internal predecessors, (694), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-10 06:13:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 726 transitions. [2025-01-10 06:13:03,338 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 726 transitions. Word has length 164 [2025-01-10 06:13:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:03,339 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 726 transitions. [2025-01-10 06:13:03,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 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:13:03,340 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 726 transitions. [2025-01-10 06:13:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 06:13:03,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:03,342 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] [2025-01-10 06:13:03,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:13:03,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:03,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -282471826, now seen corresponding path program 1 times [2025-01-10 06:13:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:03,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454473154] [2025-01-10 06:13:03,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:03,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:03,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 06:13:03,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 06:13:03,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:03,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:03,698 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:13:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454473154] [2025-01-10 06:13:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454473154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:03,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096638092] [2025-01-10 06:13:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:13:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:13:03,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:13:03,702 INFO L87 Difference]: Start difference. First operand 515 states and 726 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:13:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:03,781 INFO L93 Difference]: Finished difference Result 1042 states and 1457 transitions. [2025-01-10 06:13:03,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:13:03,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 164 [2025-01-10 06:13:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:03,788 INFO L225 Difference]: With dead ends: 1042 [2025-01-10 06:13:03,788 INFO L226 Difference]: Without dead ends: 660 [2025-01-10 06:13:03,789 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:13:03,790 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 243 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:03,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1050 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:03,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-01-10 06:13:03,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2025-01-10 06:13:03,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 634 states have (on average 1.3943217665615142) internal successors, (884), 648 states have internal predecessors, (884), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-10 06:13:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 922 transitions. [2025-01-10 06:13:03,833 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 922 transitions. Word has length 164 [2025-01-10 06:13:03,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:03,834 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 922 transitions. [2025-01-10 06:13:03,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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:13:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 922 transitions. [2025-01-10 06:13:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-10 06:13:03,836 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:03,837 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] [2025-01-10 06:13:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:13:03,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1774081106, now seen corresponding path program 1 times [2025-01-10 06:13:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609561523] [2025-01-10 06:13:03,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:03,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-10 06:13:03,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-10 06:13:03,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:03,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:04,270 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:13:04,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:04,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609561523] [2025-01-10 06:13:04,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609561523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:04,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:04,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:13:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807353356] [2025-01-10 06:13:04,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:04,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:04,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:04,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:04,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:13:04,274 INFO L87 Difference]: Start difference. First operand 660 states and 922 transitions. Second operand has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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:13:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:04,334 INFO L93 Difference]: Finished difference Result 726 states and 1008 transitions. [2025-01-10 06:13:04,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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 179 [2025-01-10 06:13:04,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:04,340 INFO L225 Difference]: With dead ends: 726 [2025-01-10 06:13:04,340 INFO L226 Difference]: Without dead ends: 724 [2025-01-10 06:13:04,341 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:13:04,342 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 295 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1649 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.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:04,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1649 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-10 06:13:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 724. [2025-01-10 06:13:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 695 states have (on average 1.3841726618705037) internal successors, (962), 709 states have internal predecessors, (962), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 06:13:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1006 transitions. [2025-01-10 06:13:04,370 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1006 transitions. Word has length 179 [2025-01-10 06:13:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:04,370 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1006 transitions. [2025-01-10 06:13:04,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.0) internal successors, (162), 4 states have internal predecessors, (162), 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:13:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1006 transitions. [2025-01-10 06:13:04,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-10 06:13:04,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:04,372 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:13:04,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:13:04,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:04,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:04,374 INFO L85 PathProgramCache]: Analyzing trace with hash 64135474, now seen corresponding path program 1 times [2025-01-10 06:13:04,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:04,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861753991] [2025-01-10 06:13:04,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:04,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:04,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:13:04,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:13:04,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:04,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:04,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861753991] [2025-01-10 06:13:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861753991] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065263958] [2025-01-10 06:13:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:04,808 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:13:04,809 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:13:05,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-10 06:13:05,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-10 06:13:05,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:05,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:05,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:13:05,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:05,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:13:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 06:13:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065263958] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:13:05,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:13:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 06:13:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371836466] [2025-01-10 06:13:05,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:13:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:13:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:13:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:13:05,962 INFO L87 Difference]: Start difference. First operand 724 states and 1006 transitions. Second operand has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:13:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:06,115 INFO L93 Difference]: Finished difference Result 1101 states and 1538 transitions. [2025-01-10 06:13:06,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 183 [2025-01-10 06:13:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:06,121 INFO L225 Difference]: With dead ends: 1101 [2025-01-10 06:13:06,121 INFO L226 Difference]: Without dead ends: 1069 [2025-01-10 06:13:06,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:13:06,122 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1762 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:06,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 2701 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:13:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-10 06:13:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2025-01-10 06:13:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1034 states have (on average 1.3820116054158607) internal successors, (1429), 1048 states have internal predecessors, (1429), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1485 transitions. [2025-01-10 06:13:06,153 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1485 transitions. Word has length 183 [2025-01-10 06:13:06,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:06,153 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1485 transitions. [2025-01-10 06:13:06,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.5) internal successors, (485), 10 states have internal predecessors, (485), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-10 06:13:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1485 transitions. [2025-01-10 06:13:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-10 06:13:06,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:06,156 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] [2025-01-10 06:13:06,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:13:06,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:06,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 100945493, now seen corresponding path program 1 times [2025-01-10 06:13:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093694698] [2025-01-10 06:13:06,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:06,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:13:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:13:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:07,467 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:13:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:07,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093694698] [2025-01-10 06:13:07,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093694698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317574302] [2025-01-10 06:13:07,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:07,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:07,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:07,472 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:13:07,475 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:13:07,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-10 06:13:08,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-10 06:13:08,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:08,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:08,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 06:13:08,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:08,172 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:13:08,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-10 06:13:09,075 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:13:09,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317574302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-01-10 06:13:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465806641] [2025-01-10 06:13:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:13:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:09,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:13:09,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:13:09,080 INFO L87 Difference]: Start difference. First operand 1069 states and 1485 transitions. Second operand has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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:13:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:12,039 INFO L93 Difference]: Finished difference Result 2100 states and 2911 transitions. [2025-01-10 06:13:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:13:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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 185 [2025-01-10 06:13:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:12,045 INFO L225 Difference]: With dead ends: 2100 [2025-01-10 06:13:12,045 INFO L226 Difference]: Without dead ends: 1117 [2025-01-10 06:13:12,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-01-10 06:13:12,047 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 940 mSDsluCounter, 3393 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 3960 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:12,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 3960 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-10 06:13:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2025-01-10 06:13:12,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1094. [2025-01-10 06:13:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1059 states have (on average 1.3777148253068934) internal successors, (1459), 1073 states have internal predecessors, (1459), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1515 transitions. [2025-01-10 06:13:12,078 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1515 transitions. Word has length 185 [2025-01-10 06:13:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1515 transitions. [2025-01-10 06:13:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.0) internal successors, (168), 12 states have internal predecessors, (168), 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:13:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1515 transitions. [2025-01-10 06:13:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-01-10 06:13:12,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:12,081 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:13:12,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:13:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:12,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash 459924266, now seen corresponding path program 1 times [2025-01-10 06:13:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207044323] [2025-01-10 06:13:12,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:12,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:13:12,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:13:12,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:12,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:13,023 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:13:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207044323] [2025-01-10 06:13:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207044323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:13,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465190326] [2025-01-10 06:13:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:13,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:13,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:13,026 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:13:13,028 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:13:13,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-10 06:13:13,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-10 06:13:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:13,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-10 06:13:13,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:13,737 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:13:13,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465190326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:13,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:13,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:13:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74637666] [2025-01-10 06:13:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:13,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:13,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:13,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:13,739 INFO L87 Difference]: Start difference. First operand 1094 states and 1515 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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:13:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:13,956 INFO L93 Difference]: Finished difference Result 2154 states and 2983 transitions. [2025-01-10 06:13:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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:13:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:13,961 INFO L225 Difference]: With dead ends: 2154 [2025-01-10 06:13:13,961 INFO L226 Difference]: Without dead ends: 1171 [2025-01-10 06:13:13,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 185 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:13:13,964 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 17 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1373 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:13:13,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1373 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:13:13,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-01-10 06:13:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1147. [2025-01-10 06:13:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1112 states have (on average 1.370503597122302) internal successors, (1524), 1126 states have internal predecessors, (1524), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1580 transitions. [2025-01-10 06:13:14,003 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1580 transitions. Word has length 186 [2025-01-10 06:13:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 1147 states and 1580 transitions. [2025-01-10 06:13:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 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:13:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1580 transitions. [2025-01-10 06:13:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-10 06:13:14,005 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:14,005 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:13:14,017 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:13:14,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:14,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1975150790, now seen corresponding path program 1 times [2025-01-10 06:13:14,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:14,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173333008] [2025-01-10 06:13:14,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-10 06:13:14,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-10 06:13:14,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:14,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:14,683 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:13:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173333008] [2025-01-10 06:13:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173333008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:14,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:13:14,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540280071] [2025-01-10 06:13:14,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:14,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:13:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:14,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:13:14,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:13:14,685 INFO L87 Difference]: Start difference. First operand 1147 states and 1580 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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:13:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:15,074 INFO L93 Difference]: Finished difference Result 2197 states and 3030 transitions. [2025-01-10 06:13:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:13:15,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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:13:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:15,080 INFO L225 Difference]: With dead ends: 2197 [2025-01-10 06:13:15,080 INFO L226 Difference]: Without dead ends: 1165 [2025-01-10 06:13:15,081 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:13:15,082 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 8 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:15,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1701 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:13:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-01-10 06:13:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1159. [2025-01-10 06:13:15,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1124 states have (on average 1.3692170818505338) internal successors, (1539), 1138 states have internal predecessors, (1539), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:15,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1595 transitions. [2025-01-10 06:13:15,113 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1595 transitions. Word has length 187 [2025-01-10 06:13:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:15,114 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1595 transitions. [2025-01-10 06:13:15,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 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:13:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1595 transitions. [2025-01-10 06:13:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:13:15,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:15,116 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:13:15,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:13:15,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1921694127, now seen corresponding path program 1 times [2025-01-10 06:13:15,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309188028] [2025-01-10 06:13:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:13:15,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:13:15,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:15,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:15,564 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:13:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309188028] [2025-01-10 06:13:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309188028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:15,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:13:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679496774] [2025-01-10 06:13:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:15,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:15,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:15,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:15,568 INFO L87 Difference]: Start difference. First operand 1159 states and 1595 transitions. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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:13:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:16,122 INFO L93 Difference]: Finished difference Result 2225 states and 3068 transitions. [2025-01-10 06:13:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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:13:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:16,128 INFO L225 Difference]: With dead ends: 2225 [2025-01-10 06:13:16,128 INFO L226 Difference]: Without dead ends: 1192 [2025-01-10 06:13:16,130 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:13:16,130 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 12 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2438 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.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:16,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2438 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 06:13:16,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2025-01-10 06:13:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1183. [2025-01-10 06:13:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1148 states have (on average 1.3693379790940767) internal successors, (1572), 1162 states have internal predecessors, (1572), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1628 transitions. [2025-01-10 06:13:16,165 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1628 transitions. Word has length 188 [2025-01-10 06:13:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:16,165 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1628 transitions. [2025-01-10 06:13:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 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:13:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1628 transitions. [2025-01-10 06:13:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-10 06:13:16,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:16,169 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:13:16,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:13:16,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:16,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2016805101, now seen corresponding path program 1 times [2025-01-10 06:13:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:16,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442913572] [2025-01-10 06:13:16,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:16,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:16,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:13:16,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:13:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:16,846 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:13:16,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442913572] [2025-01-10 06:13:16,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442913572] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:16,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329568984] [2025-01-10 06:13:16,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:16,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:16,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:16,849 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:13:16,851 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:13:17,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-10 06:13:17,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-10 06:13:17,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:17,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:17,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:13:17,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:13:18,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:18,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329568984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:18,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-01-10 06:13:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419657981] [2025-01-10 06:13:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:18,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:13:18,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:18,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:13:18,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:13:18,080 INFO L87 Difference]: Start difference. First operand 1183 states and 1628 transitions. Second operand has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:18,419 INFO L93 Difference]: Finished difference Result 2130 states and 2943 transitions. [2025-01-10 06:13:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:13:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-01-10 06:13:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:18,426 INFO L225 Difference]: With dead ends: 2130 [2025-01-10 06:13:18,426 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 06:13:18,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:13:18,428 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 25 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:18,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2760 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:13:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 06:13:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1204. [2025-01-10 06:13:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.3652694610778444) internal successors, (1596), 1183 states have internal predecessors, (1596), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1652 transitions. [2025-01-10 06:13:18,462 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1652 transitions. Word has length 188 [2025-01-10 06:13:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:18,462 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1652 transitions. [2025-01-10 06:13:18,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.333333333333332) internal successors, (174), 9 states have internal predecessors, (174), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1652 transitions. [2025-01-10 06:13:18,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-10 06:13:18,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:18,465 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:13:18,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:13:18,666 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,SelfDestructingSolverStorable11 [2025-01-10 06:13:18,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:18,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2011255522, now seen corresponding path program 1 times [2025-01-10 06:13:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:18,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102969044] [2025-01-10 06:13:18,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:18,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:18,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-10 06:13:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-10 06:13:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:18,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:19,274 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:13:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102969044] [2025-01-10 06:13:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102969044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:13:19,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576163567] [2025-01-10 06:13:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:19,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:19,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:19,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:19,278 INFO L87 Difference]: Start difference. First operand 1204 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:19,664 INFO L93 Difference]: Finished difference Result 2143 states and 2941 transitions. [2025-01-10 06:13:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:19,665 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 189 [2025-01-10 06:13:19,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:19,671 INFO L225 Difference]: With dead ends: 2143 [2025-01-10 06:13:19,671 INFO L226 Difference]: Without dead ends: 1216 [2025-01-10 06:13:19,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:13:19,673 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 20 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:19,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2724 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:13:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-01-10 06:13:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1195. [2025-01-10 06:13:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 1160 states have (on average 1.3629310344827585) internal successors, (1581), 1174 states have internal predecessors, (1581), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1637 transitions. [2025-01-10 06:13:19,707 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1637 transitions. Word has length 189 [2025-01-10 06:13:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:19,710 INFO L471 AbstractCegarLoop]: Abstraction has 1195 states and 1637 transitions. [2025-01-10 06:13:19,710 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), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:19,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1637 transitions. [2025-01-10 06:13:19,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-10 06:13:19,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:19,712 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:13:19,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:13:19,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:19,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1223294168, now seen corresponding path program 1 times [2025-01-10 06:13:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:19,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934011249] [2025-01-10 06:13:19,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:19,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:19,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-10 06:13:19,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-10 06:13:19,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:19,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:20,218 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:13:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:20,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934011249] [2025-01-10 06:13:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934011249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:20,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:13:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564394150] [2025-01-10 06:13:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:20,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:20,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:20,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:20,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:20,220 INFO L87 Difference]: Start difference. First operand 1195 states and 1637 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:20,438 INFO L93 Difference]: Finished difference Result 2141 states and 2935 transitions. [2025-01-10 06:13:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:20,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 190 [2025-01-10 06:13:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:20,444 INFO L225 Difference]: With dead ends: 2141 [2025-01-10 06:13:20,444 INFO L226 Difference]: Without dead ends: 1222 [2025-01-10 06:13:20,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:13:20,446 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 16 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:20,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1900 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:13:20,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-01-10 06:13:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1204. [2025-01-10 06:13:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.360136869118905) internal successors, (1590), 1183 states have internal predecessors, (1590), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:20,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1646 transitions. [2025-01-10 06:13:20,474 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1646 transitions. Word has length 190 [2025-01-10 06:13:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:20,475 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1646 transitions. [2025-01-10 06:13:20,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:13:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1646 transitions. [2025-01-10 06:13:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-10 06:13:20,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:20,477 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:13:20,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:13:20,477 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -764782677, now seen corresponding path program 1 times [2025-01-10 06:13:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:20,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581815704] [2025-01-10 06:13:20,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:20,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:20,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:13:20,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:13:20,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:20,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:20,995 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:13:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581815704] [2025-01-10 06:13:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581815704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391063156] [2025-01-10 06:13:20,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:20,998 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:13:21,000 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:13:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-10 06:13:21,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-10 06:13:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:21,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:21,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 06:13:21,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:21,980 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:13:21,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:21,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391063156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:21,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:13:21,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146893219] [2025-01-10 06:13:21,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:21,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:21,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:21,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:13:21,982 INFO L87 Difference]: Start difference. First operand 1204 states and 1646 transitions. Second operand has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 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:13:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:22,443 INFO L93 Difference]: Finished difference Result 2295 states and 3141 transitions. [2025-01-10 06:13:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:13:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 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:13:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:22,448 INFO L225 Difference]: With dead ends: 2295 [2025-01-10 06:13:22,448 INFO L226 Difference]: Without dead ends: 1225 [2025-01-10 06:13:22,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 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:13:22,451 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 12 mSDsluCounter, 1924 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2439 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.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:22,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2439 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:13:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-01-10 06:13:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1204. [2025-01-10 06:13:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1169 states have (on average 1.360136869118905) internal successors, (1590), 1183 states have internal predecessors, (1590), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1646 transitions. [2025-01-10 06:13:22,481 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1646 transitions. Word has length 191 [2025-01-10 06:13:22,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:22,481 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1646 transitions. [2025-01-10 06:13:22,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 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:13:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1646 transitions. [2025-01-10 06:13:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:13:22,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:22,484 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, 1] [2025-01-10 06:13:22,498 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:13:22,684 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:13:22,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash 766054770, now seen corresponding path program 1 times [2025-01-10 06:13:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:22,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004374579] [2025-01-10 06:13:22,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:22,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:13:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:13:22,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:23,187 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:13:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:23,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004374579] [2025-01-10 06:13:23,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004374579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:23,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:23,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 06:13:23,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233856829] [2025-01-10 06:13:23,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:23,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 06:13:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:23,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 06:13:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:13:23,190 INFO L87 Difference]: Start difference. First operand 1204 states and 1646 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 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:13:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:23,797 INFO L93 Difference]: Finished difference Result 2308 states and 3154 transitions. [2025-01-10 06:13:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:13:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 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 192 [2025-01-10 06:13:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:23,802 INFO L225 Difference]: With dead ends: 2308 [2025-01-10 06:13:23,802 INFO L226 Difference]: Without dead ends: 1243 [2025-01-10 06:13:23,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:13:23,805 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 20 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2975 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:13:23,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2975 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:13:23,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-01-10 06:13:23,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1225. [2025-01-10 06:13:23,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 1190 states have (on average 1.3588235294117648) internal successors, (1617), 1204 states have internal predecessors, (1617), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1673 transitions. [2025-01-10 06:13:23,840 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1673 transitions. Word has length 192 [2025-01-10 06:13:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:23,840 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1673 transitions. [2025-01-10 06:13:23,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 9 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:13:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1673 transitions. [2025-01-10 06:13:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-10 06:13:23,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:23,843 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, 1] [2025-01-10 06:13:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:13:23,843 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash -32301554, now seen corresponding path program 1 times [2025-01-10 06:13:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685532129] [2025-01-10 06:13:23,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:23,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:13:24,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:13:24,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:24,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:24,684 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:13:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685532129] [2025-01-10 06:13:24,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685532129] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:24,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021712574] [2025-01-10 06:13:24,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:24,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:24,707 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:13:24,710 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:13:25,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-10 06:13:25,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-10 06:13:25,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:25,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-10 06:13:25,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:25,536 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:13:25,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021712574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:25,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-01-10 06:13:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579187517] [2025-01-10 06:13:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:25,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:13:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:25,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:13:25,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:13:25,541 INFO L87 Difference]: Start difference. First operand 1225 states and 1673 transitions. Second operand has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 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:13:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:26,245 INFO L93 Difference]: Finished difference Result 2343 states and 3199 transitions. [2025-01-10 06:13:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:13:26,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 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 192 [2025-01-10 06:13:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:26,250 INFO L225 Difference]: With dead ends: 2343 [2025-01-10 06:13:26,250 INFO L226 Difference]: Without dead ends: 1264 [2025-01-10 06:13:26,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 187 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:13:26,252 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 17 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2866 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.7s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:26,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2866 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 06:13:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1264 states. [2025-01-10 06:13:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1264 to 1240. [2025-01-10 06:13:26,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1205 states have (on average 1.3568464730290457) internal successors, (1635), 1219 states have internal predecessors, (1635), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:26,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1691 transitions. [2025-01-10 06:13:26,307 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1691 transitions. Word has length 192 [2025-01-10 06:13:26,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:26,307 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1691 transitions. [2025-01-10 06:13:26,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.875) internal successors, (175), 8 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:13:26,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1691 transitions. [2025-01-10 06:13:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:13:26,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:26,310 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, 1, 1] [2025-01-10 06:13:26,324 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:13:26,510 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:13:26,511 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:26,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1285394373, now seen corresponding path program 1 times [2025-01-10 06:13:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334951162] [2025-01-10 06:13:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:26,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:26,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:26,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:26,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:27,081 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:13:27,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:27,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334951162] [2025-01-10 06:13:27,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334951162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:27,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:13:27,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 06:13:27,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424054300] [2025-01-10 06:13:27,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:13:27,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:27,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:13:27,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:13:27,083 INFO L87 Difference]: Start difference. First operand 1240 states and 1691 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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:13:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:27,753 INFO L93 Difference]: Finished difference Result 2361 states and 3223 transitions. [2025-01-10 06:13:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:13:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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 193 [2025-01-10 06:13:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:27,759 INFO L225 Difference]: With dead ends: 2361 [2025-01-10 06:13:27,759 INFO L226 Difference]: Without dead ends: 1267 [2025-01-10 06:13:27,761 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:13:27,762 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 23 mSDsluCounter, 3140 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3656 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.6s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:27,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3656 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-10 06:13:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-01-10 06:13:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1249. [2025-01-10 06:13:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1214 states have (on average 1.3542009884678747) internal successors, (1644), 1228 states have internal predecessors, (1644), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1700 transitions. [2025-01-10 06:13:27,792 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1700 transitions. Word has length 193 [2025-01-10 06:13:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:27,792 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1700 transitions. [2025-01-10 06:13:27,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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:13:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1700 transitions. [2025-01-10 06:13:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:13:27,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:27,794 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, 1, 1] [2025-01-10 06:13:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:13:27,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -264636641, now seen corresponding path program 1 times [2025-01-10 06:13:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846976847] [2025-01-10 06:13:27,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:27,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:27,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:28,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:28,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:28,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:28,664 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:13:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846976847] [2025-01-10 06:13:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846976847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416861547] [2025-01-10 06:13:28,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:28,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:28,667 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:13:28,669 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:13:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:29,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:29,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:29,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:29,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-10 06:13:29,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:30,243 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:13:30,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416861547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-01-10 06:13:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105615338] [2025-01-10 06:13:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:13:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:30,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:13:30,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:13:30,245 INFO L87 Difference]: Start difference. First operand 1249 states and 1700 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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:13:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:31,479 INFO L93 Difference]: Finished difference Result 2385 states and 3254 transitions. [2025-01-10 06:13:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:13:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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 193 [2025-01-10 06:13:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:31,485 INFO L225 Difference]: With dead ends: 2385 [2025-01-10 06:13:31,485 INFO L226 Difference]: Without dead ends: 1285 [2025-01-10 06:13:31,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:13:31,488 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 17 mSDsluCounter, 3146 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3662 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:31,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3662 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 06:13:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2025-01-10 06:13:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1270. [2025-01-10 06:13:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1235 states have (on average 1.3530364372469637) internal successors, (1671), 1249 states have internal predecessors, (1671), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1727 transitions. [2025-01-10 06:13:31,513 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1727 transitions. Word has length 193 [2025-01-10 06:13:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:31,513 INFO L471 AbstractCegarLoop]: Abstraction has 1270 states and 1727 transitions. [2025-01-10 06:13:31,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 10 states have internal predecessors, (176), 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:13:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1727 transitions. [2025-01-10 06:13:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:13:31,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:31,515 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, 1, 1] [2025-01-10 06:13:31,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-10 06:13:31,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:31,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:31,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:31,716 INFO L85 PathProgramCache]: Analyzing trace with hash -737820769, now seen corresponding path program 1 times [2025-01-10 06:13:31,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:31,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819977794] [2025-01-10 06:13:31,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:31,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:32,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:32,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:32,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:32,386 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:13:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819977794] [2025-01-10 06:13:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819977794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:32,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846351294] [2025-01-10 06:13:32,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:32,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:32,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:32,389 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:13:32,393 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:13:32,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:33,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:13:33,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:33,135 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:13:33,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846351294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:33,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-01-10 06:13:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239145215] [2025-01-10 06:13:33,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:33,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:13:33,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:33,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:13:33,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:13:33,137 INFO L87 Difference]: Start difference. First operand 1270 states and 1727 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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:13:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:33,508 INFO L93 Difference]: Finished difference Result 2421 states and 3298 transitions. [2025-01-10 06:13:33,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:13:33,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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 193 [2025-01-10 06:13:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:33,515 INFO L225 Difference]: With dead ends: 2421 [2025-01-10 06:13:33,515 INFO L226 Difference]: Without dead ends: 1312 [2025-01-10 06:13:33,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:13:33,517 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 39 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2524 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.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:33,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2524 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 06:13:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-01-10 06:13:33,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1291. [2025-01-10 06:13:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1256 states have (on average 1.3542993630573248) internal successors, (1701), 1270 states have internal predecessors, (1701), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 19 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-10 06:13:33,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1757 transitions. [2025-01-10 06:13:33,549 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1757 transitions. Word has length 193 [2025-01-10 06:13:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:33,549 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1757 transitions. [2025-01-10 06:13:33,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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:13:33,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1757 transitions. [2025-01-10 06:13:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-10 06:13:33,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:33,555 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, 1, 1] [2025-01-10 06:13:33,569 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:13:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:33,755 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1744929818, now seen corresponding path program 1 times [2025-01-10 06:13:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:33,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412374537] [2025-01-10 06:13:33,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:33,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:33,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:34,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:34,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:34,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:34,450 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:13:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412374537] [2025-01-10 06:13:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412374537] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796278662] [2025-01-10 06:13:34,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:34,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:34,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:34,453 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:13:34,455 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:13:34,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-10 06:13:35,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-10 06:13:35,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:35,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:35,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:13:35,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:35,215 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:13:35,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:13:35,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796278662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:13:35,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:13:35,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:13:35,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740299516] [2025-01-10 06:13:35,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:13:35,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:13:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:13:35,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:13:35,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:35,220 INFO L87 Difference]: Start difference. First operand 1291 states and 1757 transitions. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:13:35,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:13:35,267 INFO L93 Difference]: Finished difference Result 2382 states and 3255 transitions. [2025-01-10 06:13:35,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:13:35,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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 193 [2025-01-10 06:13:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:13:35,278 INFO L225 Difference]: With dead ends: 2382 [2025-01-10 06:13:35,278 INFO L226 Difference]: Without dead ends: 1294 [2025-01-10 06:13:35,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:13:35,281 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 0 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:13:35,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1568 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:13:35,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-01-10 06:13:35,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1294. [2025-01-10 06:13:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1258 states have (on average 1.354531001589825) internal successors, (1704), 1273 states have internal predecessors, (1704), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 19 states have call predecessors, (34), 28 states have call successors, (34) [2025-01-10 06:13:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1766 transitions. [2025-01-10 06:13:35,319 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1766 transitions. Word has length 193 [2025-01-10 06:13:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:13:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1766 transitions. [2025-01-10 06:13:35,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:13:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1766 transitions. [2025-01-10 06:13:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-10 06:13:35,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:13:35,322 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, 1, 1] [2025-01-10 06:13:35,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:13:35,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:35,523 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:13:35,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:13:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1620200482, now seen corresponding path program 1 times [2025-01-10 06:13:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:13:35,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660312559] [2025-01-10 06:13:35,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:13:35,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-10 06:13:36,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-10 06:13:36,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:36,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:36,475 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:13:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:13:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660312559] [2025-01-10 06:13:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660312559] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:13:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474841201] [2025-01-10 06:13:36,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:13:36,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:13:36,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:13:36,478 INFO L229 MonitoredProcess]: Starting monitored process 11 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:13:36,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:13:37,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-10 06:13:37,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-10 06:13:37,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:13:37,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:13:37,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-01-10 06:13:37,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:13:37,630 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:13:37,677 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:13:38,054 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:13:38,071 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:13:38,085 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:13:38,100 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-01-10 06:13:38,101 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:13:38,110 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:13:38,115 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:13:38,201 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:13:38,207 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:13:38,213 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:13:38,372 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-10 06:13:38,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2025-01-10 06:13:38,378 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:13:38,387 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