./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/verifythis/duplets.c --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/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:39:05,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:39:05,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:39:05,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:39:05,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:39:05,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:39:05,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:39:05,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:39:05,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:39:05,953 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:39:05,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:39:05,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:39:05,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:39:05,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:39:05,953 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:39:05,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:39:05,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:39:05,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:39:05,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:05,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:39:05,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:05,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:39:05,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:39:05,956 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2025-01-10 02:39:06,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:39:06,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:39:06,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:39:06,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:39:06,153 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:39:06,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/duplets.c [2025-01-10 02:39:07,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/927b77d08/0398359f96c14a7ebff69d5fb56b5dba/FLAG6677e5103 [2025-01-10 02:39:07,699 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:39:07,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2025-01-10 02:39:07,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/927b77d08/0398359f96c14a7ebff69d5fb56b5dba/FLAG6677e5103 [2025-01-10 02:39:07,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/927b77d08/0398359f96c14a7ebff69d5fb56b5dba [2025-01-10 02:39:07,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:39:07,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:39:07,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:07,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:39:07,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:39:07,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:07" (1/1) ... [2025-01-10 02:39:08,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d3d26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08, skipping insertion in model container [2025-01-10 02:39:08,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:39:07" (1/1) ... [2025-01-10 02:39:08,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:39:08,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:08,147 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:39:08,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:39:08,181 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:39:08,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08 WrapperNode [2025-01-10 02:39:08,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:39:08,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:08,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:39:08,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:39:08,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,216 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2025-01-10 02:39:08,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:39:08,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:39:08,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:39:08,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:39:08,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,245 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 5, 5]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 3, 1, 1]. [2025-01-10 02:39:08,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:39:08,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:39:08,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:39:08,267 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:39:08,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (1/1) ... [2025-01-10 02:39:08,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:39:08,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:08,304 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 02:39:08,310 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 02:39:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:39:08,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 02:39:08,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 02:39:08,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:39:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:39:08,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:39:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:39:08,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:39:08,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:39:08,633 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-01-10 02:39:08,633 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:39:08,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:39:08,644 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:39:08,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:08 BoogieIcfgContainer [2025-01-10 02:39:08,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:39:08,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:39:08,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:39:08,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:39:08,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:39:07" (1/3) ... [2025-01-10 02:39:08,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577f29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:08, skipping insertion in model container [2025-01-10 02:39:08,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:39:08" (2/3) ... [2025-01-10 02:39:08,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577f29c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:39:08, skipping insertion in model container [2025-01-10 02:39:08,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:08" (3/3) ... [2025-01-10 02:39:08,651 INFO L128 eAbstractionObserver]: Analyzing ICFG duplets.c [2025-01-10 02:39:08,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:39:08,666 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG duplets.c that has 3 procedures, 50 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2025-01-10 02:39:08,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:39:08,721 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;@6f4b1d73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:39:08,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 02:39:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.40625) internal successors, (45), 38 states have internal predecessors, (45), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-10 02:39:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:39:08,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:08,729 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:08,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 131890572, now seen corresponding path program 1 times [2025-01-10 02:39:08,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:08,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529721400] [2025-01-10 02:39:08,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:08,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:39:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:39:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:39:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529721400] [2025-01-10 02:39:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529721400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:08,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198095093] [2025-01-10 02:39:08,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:08,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:08,874 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 02:39:08,875 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 02:39:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:39:08,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:39:08,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:08,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:08,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-10 02:39:08,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-10 02:39:08,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198095093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-10 02:39:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207198633] [2025-01-10 02:39:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:08,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 02:39:08,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:08,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 02:39:08,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:39:09,000 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.40625) internal successors, (45), 38 states have internal predecessors, (45), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:39:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:09,014 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2025-01-10 02:39:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 02:39:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-01-10 02:39:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:09,019 INFO L225 Difference]: With dead ends: 96 [2025-01-10 02:39:09,019 INFO L226 Difference]: Without dead ends: 29 [2025-01-10 02:39:09,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 02:39:09,023 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:09,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:09,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-10 02:39:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-01-10 02:39:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-01-10 02:39:09,047 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 28 [2025-01-10 02:39:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-01-10 02:39:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 02:39:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-01-10 02:39:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 02:39:09,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:09,048 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:09,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:09,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 02:39:09,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 442701964, now seen corresponding path program 1 times [2025-01-10 02:39:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-01-10 02:39:09,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:09,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 02:39:09,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 02:39:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:09,431 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 02:39:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627037862] [2025-01-10 02:39:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627037862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 02:39:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870235587] [2025-01-10 02:39:09,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:09,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 02:39:09,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:09,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 02:39:09,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:09,435 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:39:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:09,453 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-01-10 02:39:09,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 02:39:09,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 28 [2025-01-10 02:39:09,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:09,454 INFO L225 Difference]: With dead ends: 40 [2025-01-10 02:39:09,454 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 02:39:09,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 02:39:09,455 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:09,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 02:39:09,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2025-01-10 02:39:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-10 02:39:09,462 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 28 [2025-01-10 02:39:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:09,464 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-10 02:39:09,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 02:39:09,464 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-01-10 02:39:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-10 02:39:09,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:09,465 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] [2025-01-10 02:39:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:39:09,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:09,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1310298416, now seen corresponding path program 1 times [2025-01-10 02:39:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:09,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212792145] [2025-01-10 02:39:09,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:09,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-10 02:39:09,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-10 02:39:09,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:09,604 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 02:39:09,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:09,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212792145] [2025-01-10 02:39:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212792145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:09,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:09,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190845365] [2025-01-10 02:39:09,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:09,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:09,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:09,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:09,607 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 02:39:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:09,648 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2025-01-10 02:39:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:09,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 31 [2025-01-10 02:39:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:09,649 INFO L225 Difference]: With dead ends: 42 [2025-01-10 02:39:09,649 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 02:39:09,649 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 02:39:09,650 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 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 02:39:09,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:09,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 02:39:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-01-10 02:39:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-01-10 02:39:09,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 31 [2025-01-10 02:39:09,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:09,657 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-01-10 02:39:09,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 02:39:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-01-10 02:39:09,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:39:09,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:09,659 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] [2025-01-10 02:39:09,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:39:09,660 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 02:39:09,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:09,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1964555982, now seen corresponding path program 1 times [2025-01-10 02:39:09,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:09,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242048151] [2025-01-10 02:39:09,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:09,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:39:09,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:39:09,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:09,777 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 02:39:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242048151] [2025-01-10 02:39:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242048151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:39:09,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644251458] [2025-01-10 02:39:09,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:09,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:39:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:39:09,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:39:09,779 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 02:39:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:09,837 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-01-10 02:39:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 32 [2025-01-10 02:39:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:09,838 INFO L225 Difference]: With dead ends: 40 [2025-01-10 02:39:09,838 INFO L226 Difference]: Without dead ends: 39 [2025-01-10 02:39:09,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:09,839 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:09,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 113 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-10 02:39:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-10 02:39:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-10 02:39:09,844 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 32 [2025-01-10 02:39:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-10 02:39:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 02:39:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-10 02:39:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-10 02:39:09,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:09,846 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] [2025-01-10 02:39:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:39:09,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:09,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash -771693227, now seen corresponding path program 1 times [2025-01-10 02:39:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593374264] [2025-01-10 02:39:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:09,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 02:39:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 02:39:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:09,976 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 02:39:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593374264] [2025-01-10 02:39:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593374264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:39:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568349518] [2025-01-10 02:39:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:09,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:39:09,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:09,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:39:09,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:39:09,978 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 02:39:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:10,053 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-01-10 02:39:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 33 [2025-01-10 02:39:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:10,054 INFO L225 Difference]: With dead ends: 44 [2025-01-10 02:39:10,054 INFO L226 Difference]: Without dead ends: 43 [2025-01-10 02:39:10,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:10,055 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:10,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-10 02:39:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-01-10 02:39:10,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 36 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:10,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-01-10 02:39:10,058 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 33 [2025-01-10 02:39:10,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:10,058 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-01-10 02:39:10,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 02:39:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2025-01-10 02:39:10,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-10 02:39:10,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:10,059 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:10,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:39:10,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1857718015, now seen corresponding path program 1 times [2025-01-10 02:39:10,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:10,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546643341] [2025-01-10 02:39:10,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:10,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:10,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:39:10,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:39:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:10,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:10,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546643341] [2025-01-10 02:39:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546643341] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:10,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900945742] [2025-01-10 02:39:10,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:10,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:10,207 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 02:39:10,208 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 02:39:10,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 02:39:10,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 02:39:10,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:10,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 02:39:10,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:10,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900945742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:10,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-10 02:39:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095708850] [2025-01-10 02:39:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:10,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:10,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:10,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:10,319 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 02:39:10,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:10,337 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-01-10 02:39:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:10,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 34 [2025-01-10 02:39:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:10,337 INFO L225 Difference]: With dead ends: 42 [2025-01-10 02:39:10,337 INFO L226 Difference]: Without dead ends: 40 [2025-01-10 02:39:10,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:10,338 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:10,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-10 02:39:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-10 02:39:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-01-10 02:39:10,341 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 34 [2025-01-10 02:39:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:10,341 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-01-10 02:39:10,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 02:39:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-01-10 02:39:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 02:39:10,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:10,342 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:10,348 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 02:39:10,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:10,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:10,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:10,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1754683675, now seen corresponding path program 1 times [2025-01-10 02:39:10,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:10,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203425804] [2025-01-10 02:39:10,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:10,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:10,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:39:10,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:39:10,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203425804] [2025-01-10 02:39:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203425804] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258740106] [2025-01-10 02:39:10,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:10,621 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 02:39:10,623 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 02:39:10,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 02:39:10,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 02:39:10,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:10,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:10,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 02:39:10,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:10,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:10,764 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258740106] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:10,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 02:39:10,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343383024] [2025-01-10 02:39:10,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 02:39:10,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:10,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 02:39:10,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:39:10,765 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 02:39:10,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:10,808 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2025-01-10 02:39:10,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:39:10,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 35 [2025-01-10 02:39:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:10,809 INFO L225 Difference]: With dead ends: 57 [2025-01-10 02:39:10,809 INFO L226 Difference]: Without dead ends: 55 [2025-01-10 02:39:10,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 64 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 02:39:10,810 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:10,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 139 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-10 02:39:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2025-01-10 02:39:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2025-01-10 02:39:10,814 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 35 [2025-01-10 02:39:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2025-01-10 02:39:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 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 02:39:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2025-01-10 02:39:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-10 02:39:10,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:10,815 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:10,821 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 02:39:11,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:11,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:11,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1909548540, now seen corresponding path program 1 times [2025-01-10 02:39:11,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:11,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107915362] [2025-01-10 02:39:11,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:11,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:39:11,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:39:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:11,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107915362] [2025-01-10 02:39:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107915362] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031001993] [2025-01-10 02:39:11,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:11,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:11,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:11,174 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 02:39:11,175 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 02:39:11,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 02:39:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 02:39:11,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:11,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:11,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:39:11,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:11,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031001993] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:11,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:11,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-01-10 02:39:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738879007] [2025-01-10 02:39:11,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:11,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:39:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:11,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:39:11,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:39:11,330 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 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 02:39:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:11,442 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2025-01-10 02:39:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:39:11,443 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 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 37 [2025-01-10 02:39:11,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:11,444 INFO L225 Difference]: With dead ends: 66 [2025-01-10 02:39:11,444 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 02:39:11,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:39:11,445 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:11,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 114 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 02:39:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-01-10 02:39:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 58 states have internal predecessors, (69), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-01-10 02:39:11,450 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 37 [2025-01-10 02:39:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:11,451 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-01-10 02:39:11,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 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 02:39:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2025-01-10 02:39:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:39:11,451 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:11,451 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:11,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 02:39:11,656 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,SelfDestructingSolverStorable7 [2025-01-10 02:39:11,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -265535963, now seen corresponding path program 1 times [2025-01-10 02:39:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-01-10 02:39:11,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:11,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:39:11,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:39:11,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:11,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:11,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-01-10 02:39:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668214146] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574183062] [2025-01-10 02:39:11,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:11,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:11,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:11,753 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 02:39:11,754 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 02:39:11,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:39:11,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:39:11,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:11,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:11,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:39:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:11,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:39:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574183062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:11,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 02:39:11,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-01-10 02:39:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857818939] [2025-01-10 02:39:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:11,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:11,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:11,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:11,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:39:11,927 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 02:39:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:11,972 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2025-01-10 02:39:11,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:11,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 38 [2025-01-10 02:39:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:11,973 INFO L225 Difference]: With dead ends: 101 [2025-01-10 02:39:11,973 INFO L226 Difference]: Without dead ends: 70 [2025-01-10 02:39:11,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:39:11,975 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:11,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-10 02:39:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-01-10 02:39:11,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 62 states have internal predecessors, (73), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2025-01-10 02:39:11,987 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 38 [2025-01-10 02:39:11,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2025-01-10 02:39:11,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 02:39:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2025-01-10 02:39:11,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:39:11,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:11,989 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:11,996 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 02:39:12,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:12,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:12,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1000672734, now seen corresponding path program 1 times [2025-01-10 02:39:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:12,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707054667] [2025-01-10 02:39:12,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:12,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:12,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:39:12,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:39:12,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:12,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-10 02:39:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707054667] [2025-01-10 02:39:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707054667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528993355] [2025-01-10 02:39:12,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:12,344 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 02:39:12,345 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 02:39:12,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:39:12,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:39:12,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:12,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:12,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:39:12,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:12,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-10 02:39:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528993355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:12,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2025-01-10 02:39:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-01-10 02:39:12,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 02:39:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:12,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 02:39:12,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-10 02:39:12,584 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 02:39:12,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:12,808 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2025-01-10 02:39:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 02:39:12,808 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 42 [2025-01-10 02:39:12,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:12,809 INFO L225 Difference]: With dead ends: 122 [2025-01-10 02:39:12,809 INFO L226 Difference]: Without dead ends: 91 [2025-01-10 02:39:12,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-01-10 02:39:12,810 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:12,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:12,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-10 02:39:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2025-01-10 02:39:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 81 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2025-01-10 02:39:12,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 42 [2025-01-10 02:39:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:12,818 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2025-01-10 02:39:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 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 02:39:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2025-01-10 02:39:12,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:39:12,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:12,819 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:12,828 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 02:39:13,019 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,SelfDestructingSolverStorable9 [2025-01-10 02:39:13,020 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:13,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -815937008, now seen corresponding path program 1 times [2025-01-10 02:39:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-01-10 02:39:13,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:13,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:39:13,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:39:13,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:13,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019922530] [2025-01-10 02:39:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019922530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:13,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767116382] [2025-01-10 02:39:13,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:13,106 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 02:39:13,111 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 02:39:13,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:39:13,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:39:13,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:13,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:13,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:39:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:13,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-10 02:39:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767116382] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:13,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-10 02:39:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329699193] [2025-01-10 02:39:13,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:13,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 02:39:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:13,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 02:39:13,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-10 02:39:13,290 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 02:39:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:13,435 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2025-01-10 02:39:13,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 02:39:13,435 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 47 [2025-01-10 02:39:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:13,436 INFO L225 Difference]: With dead ends: 105 [2025-01-10 02:39:13,436 INFO L226 Difference]: Without dead ends: 104 [2025-01-10 02:39:13,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2025-01-10 02:39:13,437 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:13,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 154 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-10 02:39:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2025-01-10 02:39:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 88 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2025-01-10 02:39:13,453 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 47 [2025-01-10 02:39:13,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:13,453 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2025-01-10 02:39:13,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.230769230769231) internal successors, (55), 14 states have internal predecessors, (55), 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 02:39:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2025-01-10 02:39:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 02:39:13,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:13,454 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:13,468 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 02:39:13,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:13,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:13,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 17949425, now seen corresponding path program 2 times [2025-01-10 02:39:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-01-10 02:39:13,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:13,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 02:39:13,675 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 49 statements. [2025-01-10 02:39:13,675 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:13,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 02:39:13,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-01-10 02:39:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435623504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64727775] [2025-01-10 02:39:13,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:13,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:13,712 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 02:39:13,713 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 02:39:13,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-01-10 02:39:13,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 49 statements. [2025-01-10 02:39:13,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:13,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:13,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 02:39:13,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 02:39:13,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-01-10 02:39:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64727775] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:13,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-01-10 02:39:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202532107] [2025-01-10 02:39:13,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:39:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:39:13,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:39:13,868 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 02:39:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:13,907 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2025-01-10 02:39:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:39:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 49 [2025-01-10 02:39:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:13,909 INFO L225 Difference]: With dead ends: 94 [2025-01-10 02:39:13,909 INFO L226 Difference]: Without dead ends: 93 [2025-01-10 02:39:13,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:39:13,910 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:13,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 81 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-10 02:39:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2025-01-10 02:39:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 69 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2025-01-10 02:39:13,917 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 49 [2025-01-10 02:39:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:13,917 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2025-01-10 02:39:13,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 02:39:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2025-01-10 02:39:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-10 02:39:13,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:13,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:13,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 02:39:14,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:14,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:14,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1613657550, now seen corresponding path program 1 times [2025-01-10 02:39:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:14,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342933002] [2025-01-10 02:39:14,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:14,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-10 02:39:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-10 02:39:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-10 02:39:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342933002] [2025-01-10 02:39:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342933002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 02:39:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029659226] [2025-01-10 02:39:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:14,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 02:39:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:14,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 02:39:14,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 02:39:14,170 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 02:39:14,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:14,187 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2025-01-10 02:39:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 02:39:14,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 56 [2025-01-10 02:39:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:14,188 INFO L225 Difference]: With dead ends: 75 [2025-01-10 02:39:14,189 INFO L226 Difference]: Without dead ends: 66 [2025-01-10 02:39:14,189 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 02:39:14,189 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:14,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-10 02:39:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-10 02:39:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2025-01-10 02:39:14,194 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 56 [2025-01-10 02:39:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2025-01-10 02:39:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 02:39:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2025-01-10 02:39:14,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 02:39:14,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:14,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:14,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 02:39:14,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 02:39:14,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:14,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1761264580, now seen corresponding path program 2 times [2025-01-10 02:39:14,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:14,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160225033] [2025-01-10 02:39:14,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:14,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:14,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-01-10 02:39:14,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 60 statements. [2025-01-10 02:39:14,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:14,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-10 02:39:14,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:14,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160225033] [2025-01-10 02:39:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160225033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:39:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:39:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:39:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923784749] [2025-01-10 02:39:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:39:14,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:14,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:14,233 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 02:39:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:14,262 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2025-01-10 02:39:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 60 [2025-01-10 02:39:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:14,263 INFO L225 Difference]: With dead ends: 66 [2025-01-10 02:39:14,263 INFO L226 Difference]: Without dead ends: 65 [2025-01-10 02:39:14,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:14,264 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:14,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-10 02:39:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-10 02:39:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 states have internal predecessors, (64), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-01-10 02:39:14,269 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 60 [2025-01-10 02:39:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-01-10 02:39:14,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 02:39:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-01-10 02:39:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-10 02:39:14,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:14,270 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:14,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:39:14,270 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 02:39:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1252609608, now seen corresponding path program 1 times [2025-01-10 02:39:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-01-10 02:39:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:14,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:39:14,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:39:14,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:14,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 50 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:39:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802137587] [2025-01-10 02:39:14,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802137587] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:14,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204955810] [2025-01-10 02:39:14,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:39:14,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:14,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:14,575 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 02:39:14,578 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 02:39:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-10 02:39:14,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-10 02:39:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:39:14,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:14,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 02:39:14,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 53 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:39:14,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 53 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-10 02:39:14,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204955810] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:14,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:14,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2025-01-10 02:39:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681752905] [2025-01-10 02:39:14,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:14,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 02:39:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:14,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 02:39:14,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-10 02:39:14,828 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 02:39:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:14,938 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-01-10 02:39:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-10 02:39:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 67 [2025-01-10 02:39:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:14,939 INFO L225 Difference]: With dead ends: 134 [2025-01-10 02:39:14,939 INFO L226 Difference]: Without dead ends: 95 [2025-01-10 02:39:14,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 119 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-01-10 02:39:14,940 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:39:14,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 177 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:39:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-10 02:39:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2025-01-10 02:39:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-10 02:39:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-01-10 02:39:14,945 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 67 [2025-01-10 02:39:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:14,945 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-01-10 02:39:14,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 02:39:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-01-10 02:39:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 02:39:14,946 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:39:14,946 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:14,952 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 02:39:15,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:15,147 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 02:39:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:39:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -663992161, now seen corresponding path program 2 times [2025-01-10 02:39:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:39:15,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-01-10 02:39:15,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:39:15,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 02:39:15,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 71 statements. [2025-01-10 02:39:15,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:15,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-10 02:39:15,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:39:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930794511] [2025-01-10 02:39:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930794511] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:39:15,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694452761] [2025-01-10 02:39:15,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:39:15,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:39:15,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:39:15,180 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 02:39:15,180 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 02:39:15,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 71 statements into 2 equivalence classes. [2025-01-10 02:39:15,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 71 statements. [2025-01-10 02:39:15,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 02:39:15,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:39:15,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 02:39:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:39:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-10 02:39:15,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:39:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-01-10 02:39:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694452761] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:39:15,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:39:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-10 02:39:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190983680] [2025-01-10 02:39:15,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:39:15,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:39:15,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:39:15,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:39:15,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:39:15,356 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 02:39:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:39:15,377 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2025-01-10 02:39:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:39:15,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 71 [2025-01-10 02:39:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:39:15,378 INFO L225 Difference]: With dead ends: 92 [2025-01-10 02:39:15,378 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 02:39:15,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:39:15,379 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 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 02:39:15,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:39:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 02:39:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 02:39:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 02:39:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 02:39:15,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2025-01-10 02:39:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:39:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 02:39:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 02:39:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 02:39:15,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-01-10 02:39:15,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-01-10 02:39:15,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 02:39:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 02:39:15,585 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:39:15,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 02:39:15,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 02:39:15,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:39:15 BoogieIcfgContainer [2025-01-10 02:39:15,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 02:39:15,805 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 02:39:15,805 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 02:39:15,805 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 02:39:15,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:39:08" (3/4) ... [2025-01-10 02:39:15,807 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 02:39:15,811 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-01-10 02:39:15,811 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-01-10 02:39:15,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-01-10 02:39:15,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-10 02:39:15,814 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 02:39:15,815 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 02:39:15,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 02:39:15,883 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 02:39:15,883 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 02:39:15,884 INFO L158 Benchmark]: Toolchain (without parser) took 7891.72ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 115.0MB in the beginning and 235.1MB in the end (delta: -120.1MB). Peak memory consumption was 166.0MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,884 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:15,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.10ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 103.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.90ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,885 INFO L158 Benchmark]: Boogie Preprocessor took 46.40ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 02:39:15,885 INFO L158 Benchmark]: RCFGBuilder took 377.10ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 83.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,885 INFO L158 Benchmark]: TraceAbstraction took 7158.64ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.1MB in the beginning and 243.1MB in the end (delta: -160.0MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,885 INFO L158 Benchmark]: Witness Printer took 78.18ms. Allocated memory is still 427.8MB. Free memory was 243.1MB in the beginning and 235.1MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 02:39:15,886 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.10ms. Allocated memory is still 142.6MB. Free memory was 115.0MB in the beginning and 103.3MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.90ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 101.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.40ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 99.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 377.10ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 83.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7158.64ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 83.1MB in the beginning and 243.1MB in the end (delta: -160.0MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. * Witness Printer took 78.18ms. Allocated memory is still 427.8MB. Free memory was 243.1MB in the beginning and 235.1MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 50 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 16, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 226 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 226 mSDsluCounter, 1575 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1182 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 980 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 393 mSDtfsCounter, 980 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 742 SyntacticMatches, 19 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=11, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 51 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1136 NumberOfCodeBlocks, 907 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1451 ConstructedInterpolants, 0 QuantifiedInterpolants, 2723 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 33 InterpolantComputations, 9 PerfectInterpolantSequences, 1488/1681 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((((((2 <= j) && (i <= 1)) && (n <= j)) && (j <= ((long long) i + 1))) || (((((n <= 2147483647) && (0 <= (j + 2147483648))) && (0 <= (i + 2147483648))) && (i <= 2147483646)) && (n <= 2147483647))) || (((((n <= 2147483647) && (0 <= (i + 2147483648))) && (i <= 2147483646)) && (n <= j)) && (j <= ((long long) i + 1)))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((n <= 2) && (i == 1)) || ((0 <= (i + 2147483648)) && (n <= i))) || (((n <= 2147483647) && (0 <= (i + 2147483648))) && (n <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-01-10 02:39:15,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE