./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/du-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/du-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:00:52,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:00:52,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:00:52,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:00:52,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:00:52,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:00:52,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:00:52,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:00:52,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:00:52,629 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:00:52,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:00:52,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:00:52,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:00:52,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:00:52,630 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:00:52,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:00:52,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:00:52,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:00:52,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:00:52,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:00:52,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:00:52,632 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:52,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:52,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:52,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:00:52,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:00:52,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:00:52,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:00:52,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:00:52,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:00:52,634 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2683078e371eec45b7d8e6b27d52453497eec01e33c8b2caf576905064dc4b71 [2025-01-10 06:00:52,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:00:52,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:00:52,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:00:52,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:00:52,889 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:00:52,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-01-10 06:00:54,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f71bf39cb/b79635990bc44f509967766bddecf74a/FLAG74813c519 [2025-01-10 06:00:54,530 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:00:54,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/du-1.i [2025-01-10 06:00:54,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f71bf39cb/b79635990bc44f509967766bddecf74a/FLAG74813c519 [2025-01-10 06:00:54,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f71bf39cb/b79635990bc44f509967766bddecf74a [2025-01-10 06:00:54,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:00:54,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:00:54,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:54,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:00:54,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:00:54,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600e9271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:54, skipping insertion in model container [2025-01-10 06:00:54,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:00:54" (1/1) ... [2025-01-10 06:00:54,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:00:55,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:56,091 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:00:56,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:00:56,621 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:00:56,638 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:00:56,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56 WrapperNode [2025-01-10 06:00:56,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:00:56,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:56,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:00:56,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:00:56,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:56,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,138 INFO L138 Inliner]: procedures = 670, calls = 9382, calls flagged for inlining = 35, calls inlined = 33, statements flattened = 11035 [2025-01-10 06:00:57,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:00:57,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:00:57,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:00:57,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:00:57,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,236 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:00:57,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,439 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:00:57,603 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:00:57,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:00:57,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:00:57,605 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (1/1) ... [2025-01-10 06:00:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:00:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:00:57,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:00:57,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-01-10 06:00:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure du [2025-01-10 06:00:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure du [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure xzalloc [2025-01-10 06:00:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure xzalloc [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure print [2025-01-10 06:00:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure print [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:00:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:00:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:00:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:00:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:00:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:00:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:00:57,663 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:00:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:00:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:00:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:00:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure bb_simple_perror_msg [2025-01-10 06:00:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_simple_perror_msg [2025-01-10 06:00:57,664 INFO L130 BoogieDeclarations]: Found specification of procedure stat [2025-01-10 06:00:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure stat [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-01-10 06:00:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:00:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:00:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:00:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-01-10 06:00:57,666 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-01-10 06:00:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:00:57,666 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:00:57,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:00:58,227 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:00:58,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:01:19,603 INFO L? ?]: Removed 728 outVars from TransFormulas that were not future-live. [2025-01-10 06:01:19,604 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:01:19,642 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:01:19,642 INFO L312 CfgBuilder]: Removed 32 assume(true) statements. [2025-01-10 06:01:19,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:19 BoogieIcfgContainer [2025-01-10 06:01:19,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:01:19,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:01:19,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:01:19,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:01:19,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:00:54" (1/3) ... [2025-01-10 06:01:19,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:19, skipping insertion in model container [2025-01-10 06:01:19,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:00:56" (2/3) ... [2025-01-10 06:01:19,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc0441e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:19, skipping insertion in model container [2025-01-10 06:01:19,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:19" (3/3) ... [2025-01-10 06:01:19,691 INFO L128 eAbstractionObserver]: Analyzing ICFG du-1.i [2025-01-10 06:01:19,704 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:01:19,708 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG du-1.i that has 14 procedures, 686 locations, 1 initial locations, 39 loop locations, and 69 error locations. [2025-01-10 06:01:19,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:01:19,799 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;@270421f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:01:19,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2025-01-10 06:01:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 686 states, 562 states have (on average 1.6281138790035588) internal successors, (915), 637 states have internal predecessors, (915), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2025-01-10 06:01:19,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:01:19,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:19,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:01:19,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash 23274820, now seen corresponding path program 1 times [2025-01-10 06:01:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:19,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332057713] [2025-01-10 06:01:19,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:22,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:01:23,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:01:23,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:23,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:24,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332057713] [2025-01-10 06:01:24,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332057713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:24,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982052176] [2025-01-10 06:01:24,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:24,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:24,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:24,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:24,780 INFO L87 Difference]: Start difference. First operand has 686 states, 562 states have (on average 1.6281138790035588) internal successors, (915), 637 states have internal predecessors, (915), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:24,895 INFO L93 Difference]: Finished difference Result 1270 states and 1896 transitions. [2025-01-10 06:01:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 06:01:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:24,907 INFO L225 Difference]: With dead ends: 1270 [2025-01-10 06:01:24,907 INFO L226 Difference]: Without dead ends: 588 [2025-01-10 06:01:24,912 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 06:01:24,914 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 1 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:24,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1656 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2025-01-10 06:01:25,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2025-01-10 06:01:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 493 states have (on average 1.561866125760649) internal successors, (770), 548 states have internal predecessors, (770), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 835 transitions. [2025-01-10 06:01:25,031 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 835 transitions. Word has length 4 [2025-01-10 06:01:25,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:25,033 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 835 transitions. [2025-01-10 06:01:25,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:25,033 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 835 transitions. [2025-01-10 06:01:25,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:01:25,033 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:25,033 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:01:25,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:01:25,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1891188476, now seen corresponding path program 1 times [2025-01-10 06:01:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475973225] [2025-01-10 06:01:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:27,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:27,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:27,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:27,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:29,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:29,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:29,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475973225] [2025-01-10 06:01:29,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475973225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:29,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413463709] [2025-01-10 06:01:29,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:29,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:29,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:29,270 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:29,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:01:31,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:01:33,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:01:33,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:33,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:33,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 18366 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:34,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:34,037 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413463709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:34,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:34,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:01:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647999152] [2025-01-10 06:01:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:34,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:01:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:34,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:01:34,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:34,039 INFO L87 Difference]: Start difference. First operand 588 states and 835 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:34,088 INFO L93 Difference]: Finished difference Result 588 states and 835 transitions. [2025-01-10 06:01:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:01:34,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 06:01:34,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:34,093 INFO L225 Difference]: With dead ends: 588 [2025-01-10 06:01:34,093 INFO L226 Difference]: Without dead ends: 587 [2025-01-10 06:01:34,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:34,094 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 1 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:34,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1651 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-01-10 06:01:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2025-01-10 06:01:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 493 states have (on average 1.5598377281947262) internal successors, (769), 547 states have internal predecessors, (769), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 834 transitions. [2025-01-10 06:01:34,121 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 834 transitions. Word has length 7 [2025-01-10 06:01:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:34,122 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 834 transitions. [2025-01-10 06:01:34,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 834 transitions. [2025-01-10 06:01:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:01:34,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:34,122 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:01:34,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:01:34,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:34,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:34,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1502698622, now seen corresponding path program 1 times [2025-01-10 06:01:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791070593] [2025-01-10 06:01:34,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:36,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:01:36,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:01:36,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:36,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791070593] [2025-01-10 06:01:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791070593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:37,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102545855] [2025-01-10 06:01:37,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:37,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:37,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:37,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:37,444 INFO L87 Difference]: Start difference. First operand 587 states and 834 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:37,467 INFO L93 Difference]: Finished difference Result 587 states and 834 transitions. [2025-01-10 06:01:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:01:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:37,470 INFO L225 Difference]: With dead ends: 587 [2025-01-10 06:01:37,471 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 06:01:37,471 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 06:01:37,471 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 0 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:37,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1652 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 06:01:37,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2025-01-10 06:01:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 491 states have (on average 1.560081466395112) internal successors, (766), 544 states have internal predecessors, (766), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 831 transitions. [2025-01-10 06:01:37,493 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 831 transitions. Word has length 8 [2025-01-10 06:01:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:37,494 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 831 transitions. [2025-01-10 06:01:37,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:01:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 831 transitions. [2025-01-10 06:01:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:01:37,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:37,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:37,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:01:37,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:37,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 326035772, now seen corresponding path program 1 times [2025-01-10 06:01:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816032394] [2025-01-10 06:01:37,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:37,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:39,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:39,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:40,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816032394] [2025-01-10 06:01:40,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816032394] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:40,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027821043] [2025-01-10 06:01:40,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:40,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:40,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:40,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:40,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:01:42,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:01:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:01:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:44,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 18383 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:01:44,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:44,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:01:44,566 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:01:44,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027821043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:44,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:01:44,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:01:44,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118755341] [2025-01-10 06:01:44,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:44,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:44,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:44,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:44,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:44,567 INFO L87 Difference]: Start difference. First operand 584 states and 831 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:44,603 INFO L93 Difference]: Finished difference Result 584 states and 831 transitions. [2025-01-10 06:01:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:44,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 06:01:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:44,607 INFO L225 Difference]: With dead ends: 584 [2025-01-10 06:01:44,607 INFO L226 Difference]: Without dead ends: 582 [2025-01-10 06:01:44,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:44,611 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 525 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:44,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1110 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-01-10 06:01:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2025-01-10 06:01:44,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 491 states have (on average 1.5560081466395113) internal successors, (764), 542 states have internal predecessors, (764), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:44,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 829 transitions. [2025-01-10 06:01:44,624 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 829 transitions. Word has length 12 [2025-01-10 06:01:44,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:44,625 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 829 transitions. [2025-01-10 06:01:44,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:44,626 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 829 transitions. [2025-01-10 06:01:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:01:44,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:44,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:44,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:01:44,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:44,827 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1517175113, now seen corresponding path program 1 times [2025-01-10 06:01:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:44,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343749495] [2025-01-10 06:01:44,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:44,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:47,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:47,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:47,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343749495] [2025-01-10 06:01:47,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343749495] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:01:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217039639] [2025-01-10 06:01:47,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:47,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:01:47,998 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:01:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:01:50,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:01:52,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:01:52,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:52,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:52,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 18384 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:01:52,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:01:52,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:52,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:01:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:01:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217039639] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:01:52,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:01:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:01:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467598099] [2025-01-10 06:01:52,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:01:52,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:01:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:01:52,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:52,302 INFO L87 Difference]: Start difference. First operand 582 states and 829 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:52,364 INFO L93 Difference]: Finished difference Result 1167 states and 1663 transitions. [2025-01-10 06:01:52,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:01:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-01-10 06:01:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:52,368 INFO L225 Difference]: With dead ends: 1167 [2025-01-10 06:01:52,368 INFO L226 Difference]: Without dead ends: 591 [2025-01-10 06:01:52,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:01:52,372 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 4 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:52,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2471 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:52,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-01-10 06:01:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2025-01-10 06:01:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 500 states have (on average 1.546) internal successors, (773), 551 states have internal predecessors, (773), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 838 transitions. [2025-01-10 06:01:52,401 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 838 transitions. Word has length 13 [2025-01-10 06:01:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:52,402 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 838 transitions. [2025-01-10 06:01:52,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:01:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 838 transitions. [2025-01-10 06:01:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:01:52,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:52,403 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:52,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:01:52,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:01:52,603 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:52,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2118065041, now seen corresponding path program 2 times [2025-01-10 06:01:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91363033] [2025-01-10 06:01:52,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:01:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:54,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:01:55,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:01:55,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:01:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91363033] [2025-01-10 06:01:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91363033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:01:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691483775] [2025-01-10 06:01:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:56,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:01:56,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:01:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:56,530 INFO L87 Difference]: Start difference. First operand 591 states and 838 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:56,639 INFO L93 Difference]: Finished difference Result 591 states and 838 transitions. [2025-01-10 06:01:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:01:56,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:01:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:56,642 INFO L225 Difference]: With dead ends: 591 [2025-01-10 06:01:56,642 INFO L226 Difference]: Without dead ends: 589 [2025-01-10 06:01:56,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:01:56,643 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 524 mSDsluCounter, 1891 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:56,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2703 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:01:56,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-01-10 06:01:56,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2025-01-10 06:01:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 500 states have (on average 1.542) internal successors, (771), 549 states have internal predecessors, (771), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 836 transitions. [2025-01-10 06:01:56,665 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 836 transitions. Word has length 22 [2025-01-10 06:01:56,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:56,665 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 836 transitions. [2025-01-10 06:01:56,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 836 transitions. [2025-01-10 06:01:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:01:56,666 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:56,666 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:01:56,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:01:56,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash -948000548, now seen corresponding path program 1 times [2025-01-10 06:01:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151916900] [2025-01-10 06:01:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:01:58,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:01:58,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:01:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:01:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:01:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:01:59,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:01:59,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151916900] [2025-01-10 06:01:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151916900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:01:59,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:01:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:01:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532646238] [2025-01-10 06:01:59,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:01:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:01:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:01:59,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:01:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:01:59,620 INFO L87 Difference]: Start difference. First operand 589 states and 836 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:01:59,653 INFO L93 Difference]: Finished difference Result 1161 states and 1656 transitions. [2025-01-10 06:01:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:01:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:01:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:01:59,656 INFO L225 Difference]: With dead ends: 1161 [2025-01-10 06:01:59,656 INFO L226 Difference]: Without dead ends: 592 [2025-01-10 06:01:59,657 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 06:01:59,658 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 1 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:01:59,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1641 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:01:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-10 06:01:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-01-10 06:01:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 503 states have (on average 1.5387673956262427) internal successors, (774), 552 states have internal predecessors, (774), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:01:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 839 transitions. [2025-01-10 06:01:59,670 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 839 transitions. Word has length 27 [2025-01-10 06:01:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:01:59,671 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 839 transitions. [2025-01-10 06:01:59,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:01:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 839 transitions. [2025-01-10 06:01:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:01:59,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:01:59,671 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] [2025-01-10 06:01:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:01:59,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:01:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:01:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1821396379, now seen corresponding path program 1 times [2025-01-10 06:01:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:01:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365174348] [2025-01-10 06:01:59,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:01:59,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:01,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:01,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:01,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:01,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:02:02,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:02,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365174348] [2025-01-10 06:02:02,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365174348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:02:02,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81851504] [2025-01-10 06:02:02,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:02:02,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:02:02,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:02:02,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:02:05,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:02:06,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:02:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:06,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 18569 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:02:06,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:02:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:06,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:02:06,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:02:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81851504] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:02:06,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:02:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:02:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241276866] [2025-01-10 06:02:06,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:02:06,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:02:06,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:06,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:02:06,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:06,929 INFO L87 Difference]: Start difference. First operand 592 states and 839 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:02:07,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:07,066 INFO L93 Difference]: Finished difference Result 1186 states and 1686 transitions. [2025-01-10 06:02:07,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:02:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-10 06:02:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:07,070 INFO L225 Difference]: With dead ends: 1186 [2025-01-10 06:02:07,070 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 06:02:07,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:02:07,072 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 5 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4892 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:07,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4892 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 06:02:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-01-10 06:02:07,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 521 states have (on average 1.5182341650671785) internal successors, (791), 569 states have internal predecessors, (791), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 856 transitions. [2025-01-10 06:02:07,090 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 856 transitions. Word has length 30 [2025-01-10 06:02:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:07,090 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 856 transitions. [2025-01-10 06:02:07,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:02:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 856 transitions. [2025-01-10 06:02:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 06:02:07,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:07,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:07,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:02:07,292 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 06:02:07,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:02:07,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:07,293 INFO L85 PathProgramCache]: Analyzing trace with hash 221732187, now seen corresponding path program 1 times [2025-01-10 06:02:07,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:07,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397176593] [2025-01-10 06:02:07,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:09,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 06:02:09,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 06:02:09,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:09,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397176593] [2025-01-10 06:02:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397176593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:10,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609080432] [2025-01-10 06:02:10,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:10,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:10,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:10,182 INFO L87 Difference]: Start difference. First operand 609 states and 856 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:10,227 INFO L93 Difference]: Finished difference Result 621 states and 870 transitions. [2025-01-10 06:02:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-01-10 06:02:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:10,230 INFO L225 Difference]: With dead ends: 621 [2025-01-10 06:02:10,230 INFO L226 Difference]: Without dead ends: 619 [2025-01-10 06:02:10,230 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 06:02:10,231 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 2 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1636 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 06:02:10,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1636 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-10 06:02:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 618. [2025-01-10 06:02:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 530 states have (on average 1.5150943396226415) internal successors, (803), 578 states have internal predecessors, (803), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 868 transitions. [2025-01-10 06:02:10,247 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 868 transitions. Word has length 48 [2025-01-10 06:02:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:10,248 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 868 transitions. [2025-01-10 06:02:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 868 transitions. [2025-01-10 06:02:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:02:10,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:10,249 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:10,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:02:10,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:02:10,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1716241958, now seen corresponding path program 1 times [2025-01-10 06:02:10,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:10,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794337572] [2025-01-10 06:02:10,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:10,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:12,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:02:12,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:02:12,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:12,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:02:13,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794337572] [2025-01-10 06:02:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794337572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:13,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354241024] [2025-01-10 06:02:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:13,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:13,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:13,317 INFO L87 Difference]: Start difference. First operand 618 states and 868 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:13,338 INFO L93 Difference]: Finished difference Result 618 states and 868 transitions. [2025-01-10 06:02:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 06:02:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:13,341 INFO L225 Difference]: With dead ends: 618 [2025-01-10 06:02:13,341 INFO L226 Difference]: Without dead ends: 617 [2025-01-10 06:02:13,342 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 06:02:13,342 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:13,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1639 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-10 06:02:13,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2025-01-10 06:02:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 526 states have (on average 1.515209125475285) internal successors, (797), 573 states have internal predecessors, (797), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:13,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 862 transitions. [2025-01-10 06:02:13,358 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 862 transitions. Word has length 49 [2025-01-10 06:02:13,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:13,359 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 862 transitions. [2025-01-10 06:02:13,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:13,359 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 862 transitions. [2025-01-10 06:02:13,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:02:13,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:13,359 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:13,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:02:13,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:02:13,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1383043906, now seen corresponding path program 1 times [2025-01-10 06:02:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95783643] [2025-01-10 06:02:13,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:15,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:02:15,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:02:15,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:15,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:16,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95783643] [2025-01-10 06:02:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95783643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:16,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:16,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:02:16,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779498223] [2025-01-10 06:02:16,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:02:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:16,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:02:16,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:02:16,798 INFO L87 Difference]: Start difference. First operand 613 states and 862 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:16,828 INFO L93 Difference]: Finished difference Result 1171 states and 1662 transitions. [2025-01-10 06:02:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:02:16,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:02:16,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:16,832 INFO L225 Difference]: With dead ends: 1171 [2025-01-10 06:02:16,832 INFO L226 Difference]: Without dead ends: 615 [2025-01-10 06:02:16,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:02:16,834 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:16,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2461 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:02:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-10 06:02:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-01-10 06:02:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 528 states have (on average 1.5132575757575757) internal successors, (799), 575 states have internal predecessors, (799), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 864 transitions. [2025-01-10 06:02:16,852 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 864 transitions. Word has length 50 [2025-01-10 06:02:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:16,853 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 864 transitions. [2025-01-10 06:02:16,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 864 transitions. [2025-01-10 06:02:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:02:16,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:16,856 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:02:16,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:02:16,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:02:16,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1384890948, now seen corresponding path program 1 times [2025-01-10 06:02:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332920921] [2025-01-10 06:02:16,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:02:18,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:02:19,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:02:19,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:02:19,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:02:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:02:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:02:19,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332920921] [2025-01-10 06:02:19,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332920921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:02:19,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:02:19,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:02:19,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662355748] [2025-01-10 06:02:19,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:02:19,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:02:19,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:02:19,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:02:19,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:02:19,825 INFO L87 Difference]: Start difference. First operand 615 states and 864 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:02:19,928 INFO L93 Difference]: Finished difference Result 917 states and 1305 transitions. [2025-01-10 06:02:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:02:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:02:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:02:19,932 INFO L225 Difference]: With dead ends: 917 [2025-01-10 06:02:19,932 INFO L226 Difference]: Without dead ends: 915 [2025-01-10 06:02:19,933 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 06:02:19,934 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 417 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:02:19,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1624 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:02:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-10 06:02:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 619. [2025-01-10 06:02:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 532 states have (on average 1.5112781954887218) internal successors, (804), 579 states have internal predecessors, (804), 36 states have call successors, (36), 13 states have call predecessors, (36), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-10 06:02:19,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 869 transitions. [2025-01-10 06:02:19,952 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 869 transitions. Word has length 50 [2025-01-10 06:02:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:02:19,953 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 869 transitions. [2025-01-10 06:02:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:02:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 869 transitions. [2025-01-10 06:02:19,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 06:02:19,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:02:19,955 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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 06:02:19,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:02:19,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [duErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, duErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 65 more)] === [2025-01-10 06:02:19,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:02:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -937664481, now seen corresponding path program 1 times [2025-01-10 06:02:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:02:19,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142533566] [2025-01-10 06:02:19,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:02:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms