./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:19:23,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:19:23,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:19:23,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:19:23,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:19:23,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:19:23,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:19:23,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:19:23,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:19:23,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:19:23,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:19:23,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:19:23,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:19:23,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:19:23,881 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:19:23,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:19:23,882 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:19:23,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:19:23,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:19:23,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:19:23,884 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72a3b80a468e10df778a3b8ff41e4c2b1e0b82c1005f056b209a19315511b1a5 [2025-02-06 18:19:24,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:19:24,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:19:24,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:19:24,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:19:24,129 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:19:24,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-02-06 18:19:25,311 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834e313e5/dcdd93dc3ae74fb687f0e2e404917799/FLAG8b1070682 [2025-02-06 18:19:25,613 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:19:25,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test3-2.i [2025-02-06 18:19:25,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834e313e5/dcdd93dc3ae74fb687f0e2e404917799/FLAG8b1070682 [2025-02-06 18:19:25,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/834e313e5/dcdd93dc3ae74fb687f0e2e404917799 [2025-02-06 18:19:25,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:19:25,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:19:25,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:19:25,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:19:25,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:19:25,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:25" (1/1) ... [2025-02-06 18:19:25,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@718da415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:25, skipping insertion in model container [2025-02-06 18:19:25,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:19:25" (1/1) ... [2025-02-06 18:19:25,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:19:26,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:19:26,227 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:19:26,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:19:26,360 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:19:26,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26 WrapperNode [2025-02-06 18:19:26,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:19:26,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:19:26,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:19:26,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:19:26,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,456 INFO L138 Inliner]: procedures = 177, calls = 330, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1577 [2025-02-06 18:19:26,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:19:26,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:19:26,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:19:26,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:19:26,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,559 INFO L175 MemorySlicer]: Split 303 memory accesses to 3 slices as follows [2, 34, 267]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2025-02-06 18:19:26,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:19:26,621 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:19:26,621 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:19:26,621 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:19:26,621 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (1/1) ... [2025-02-06 18:19:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:19:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:26,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:19:26,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:19:26,675 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:19:26,675 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:19:26,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:19:26,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:19:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:19:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:19:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:19:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:19:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:19:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:19:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:19:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:19:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:19:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:19:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:19:26,869 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:19:26,870 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:19:27,820 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 18:19:27,905 INFO L? ?]: Removed 355 outVars from TransFormulas that were not future-live. [2025-02-06 18:19:27,906 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:19:27,941 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:19:27,941 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:19:27,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:19:27 BoogieIcfgContainer [2025-02-06 18:19:27,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:19:27,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:19:27,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:19:27,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:19:27,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:19:25" (1/3) ... [2025-02-06 18:19:27,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b291b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:19:27, skipping insertion in model container [2025-02-06 18:19:27,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:19:26" (2/3) ... [2025-02-06 18:19:27,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b291b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:19:27, skipping insertion in model container [2025-02-06 18:19:27,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:19:27" (3/3) ... [2025-02-06 18:19:27,947 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test3-2.i [2025-02-06 18:19:27,956 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:19:27,956 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test3-2.i that has 6 procedures, 465 locations, 1 initial locations, 43 loop locations, and 8 error locations. [2025-02-06 18:19:27,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:19:27,997 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;@28915ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:19:27,997 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 18:19:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 457 states, 435 states have (on average 1.625287356321839) internal successors, (707), 450 states have internal predecessors, (707), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-02-06 18:19:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:19:28,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:28,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:28,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -220289085, now seen corresponding path program 1 times [2025-02-06 18:19:28,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:28,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496638767] [2025-02-06 18:19:28,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:28,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:28,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:28,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:28,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:28,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:28,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496638767] [2025-02-06 18:19:28,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496638767] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:28,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:19:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206100526] [2025-02-06 18:19:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:28,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:19:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:28,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:19:28,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:19:28,108 INFO L87 Difference]: Start difference. First operand has 457 states, 435 states have (on average 1.625287356321839) internal successors, (707), 450 states have internal predecessors, (707), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:28,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:28,187 INFO L93 Difference]: Finished difference Result 910 states and 1456 transitions. [2025-02-06 18:19:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:19:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:19:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:28,195 INFO L225 Difference]: With dead ends: 910 [2025-02-06 18:19:28,195 INFO L226 Difference]: Without dead ends: 416 [2025-02-06 18:19:28,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:19:28,199 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:28,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 18:19:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-06 18:19:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-02-06 18:19:28,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 398 states have (on average 1.464824120603015) internal successors, (583), 410 states have internal predecessors, (583), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:19:28,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 599 transitions. [2025-02-06 18:19:28,233 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 599 transitions. Word has length 7 [2025-02-06 18:19:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:28,233 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 599 transitions. [2025-02-06 18:19:28,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 599 transitions. [2025-02-06 18:19:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:19:28,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:28,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:28,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:19:28,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:28,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -220288124, now seen corresponding path program 1 times [2025-02-06 18:19:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565776813] [2025-02-06 18:19:28,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:28,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:28,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:28,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:19:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967336014] [2025-02-06 18:19:28,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:28,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:28,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:28,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:19:28,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:19:28,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:19:28,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:28,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:19:28,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:28,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:28,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:19:28,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565776813] [2025-02-06 18:19:28,409 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:19:28,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967336014] [2025-02-06 18:19:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967336014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:28,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:28,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328261737] [2025-02-06 18:19:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:28,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:28,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:28,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:28,411 INFO L87 Difference]: Start difference. First operand 416 states and 599 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:28,617 INFO L93 Difference]: Finished difference Result 822 states and 1189 transitions. [2025-02-06 18:19:28,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:28,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 18:19:28,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:28,620 INFO L225 Difference]: With dead ends: 822 [2025-02-06 18:19:28,620 INFO L226 Difference]: Without dead ends: 820 [2025-02-06 18:19:28,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:28,621 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 567 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:28,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1596 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-02-06 18:19:28,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 422. [2025-02-06 18:19:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 404 states have (on average 1.4603960396039604) internal successors, (590), 416 states have internal predecessors, (590), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:19:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 606 transitions. [2025-02-06 18:19:28,642 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 606 transitions. Word has length 7 [2025-02-06 18:19:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 606 transitions. [2025-02-06 18:19:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 606 transitions. [2025-02-06 18:19:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 18:19:28,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:28,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:28,657 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-02-06 18:19:28,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:28,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:28,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:28,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2105160121, now seen corresponding path program 1 times [2025-02-06 18:19:28,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603738198] [2025-02-06 18:19:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:28,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:28,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:19:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:19:28,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603738198] [2025-02-06 18:19:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603738198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:28,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144717421] [2025-02-06 18:19:28,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:28,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:28,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:28,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:28,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:28,977 INFO L87 Difference]: Start difference. First operand 422 states and 606 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:29,163 INFO L93 Difference]: Finished difference Result 1028 states and 1490 transitions. [2025-02-06 18:19:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:29,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-02-06 18:19:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:29,166 INFO L225 Difference]: With dead ends: 1028 [2025-02-06 18:19:29,166 INFO L226 Difference]: Without dead ends: 819 [2025-02-06 18:19:29,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:29,167 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 568 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:29,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1677 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:19:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-02-06 18:19:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 422. [2025-02-06 18:19:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 404 states have (on average 1.4579207920792079) internal successors, (589), 416 states have internal predecessors, (589), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:19:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 605 transitions. [2025-02-06 18:19:29,183 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 605 transitions. Word has length 10 [2025-02-06 18:19:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:29,183 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 605 transitions. [2025-02-06 18:19:29,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 605 transitions. [2025-02-06 18:19:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 18:19:29,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:29,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:29,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:19:29,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:29,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 423774924, now seen corresponding path program 1 times [2025-02-06 18:19:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600566678] [2025-02-06 18:19:29,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:29,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:29,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 18:19:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 18:19:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:29,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:29,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:29,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600566678] [2025-02-06 18:19:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600566678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:19:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817860179] [2025-02-06 18:19:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:29,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:29,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:29,496 INFO L87 Difference]: Start difference. First operand 422 states and 605 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:29,608 INFO L93 Difference]: Finished difference Result 794 states and 1136 transitions. [2025-02-06 18:19:29,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:19:29,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2025-02-06 18:19:29,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:29,614 INFO L225 Difference]: With dead ends: 794 [2025-02-06 18:19:29,614 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 18:19:29,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:29,615 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 30 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:29,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1376 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:19:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 18:19:29,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-06 18:19:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 362 states have (on average 1.4143646408839778) internal successors, (512), 374 states have internal predecessors, (512), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:19:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 528 transitions. [2025-02-06 18:19:29,624 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 528 transitions. Word has length 80 [2025-02-06 18:19:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:29,624 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 528 transitions. [2025-02-06 18:19:29,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 528 transitions. [2025-02-06 18:19:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 18:19:29,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:29,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:29,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:19:29,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:29,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash 968450310, now seen corresponding path program 1 times [2025-02-06 18:19:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339457426] [2025-02-06 18:19:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:29,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 18:19:29,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 18:19:29,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:19:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339457426] [2025-02-06 18:19:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339457426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184850546] [2025-02-06 18:19:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:29,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:19:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:29,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:19:29,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:29,754 INFO L87 Difference]: Start difference. First operand 380 states and 528 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:29,909 INFO L93 Difference]: Finished difference Result 1018 states and 1434 transitions. [2025-02-06 18:19:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:19:29,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-02-06 18:19:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:29,912 INFO L225 Difference]: With dead ends: 1018 [2025-02-06 18:19:29,912 INFO L226 Difference]: Without dead ends: 646 [2025-02-06 18:19:29,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:19:29,913 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 314 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:29,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1139 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:19:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-02-06 18:19:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 625. [2025-02-06 18:19:29,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 607 states have (on average 1.42833607907743) internal successors, (867), 619 states have internal predecessors, (867), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-06 18:19:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 883 transitions. [2025-02-06 18:19:29,925 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 883 transitions. Word has length 80 [2025-02-06 18:19:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:29,926 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 883 transitions. [2025-02-06 18:19:29,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:19:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 883 transitions. [2025-02-06 18:19:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 18:19:29,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:29,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:19:29,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1740048809, now seen corresponding path program 1 times [2025-02-06 18:19:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058526018] [2025-02-06 18:19:29,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:29,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 18:19:29,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 18:19:29,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:29,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:19:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058526018] [2025-02-06 18:19:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058526018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:19:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:19:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111650961] [2025-02-06 18:19:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:19:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:19:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:19:30,238 INFO L87 Difference]: Start difference. First operand 625 states and 883 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:19:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:30,395 INFO L93 Difference]: Finished difference Result 927 states and 1313 transitions. [2025-02-06 18:19:30,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:19:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2025-02-06 18:19:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:30,399 INFO L225 Difference]: With dead ends: 927 [2025-02-06 18:19:30,399 INFO L226 Difference]: Without dead ends: 925 [2025-02-06 18:19:30,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:19:30,400 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 400 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:30,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1456 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:19:30,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-02-06 18:19:30,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 688. [2025-02-06 18:19:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 667 states have (on average 1.4152923538230884) internal successors, (944), 679 states have internal predecessors, (944), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 18:19:30,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 966 transitions. [2025-02-06 18:19:30,414 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 966 transitions. Word has length 95 [2025-02-06 18:19:30,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:30,414 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 966 transitions. [2025-02-06 18:19:30,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:19:30,415 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 966 transitions. [2025-02-06 18:19:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-06 18:19:30,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:30,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:30,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:19:30,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:30,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1679887001, now seen corresponding path program 1 times [2025-02-06 18:19:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:30,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855608496] [2025-02-06 18:19:30,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:30,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:19:30,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:19:30,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:19:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855608496] [2025-02-06 18:19:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855608496] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:19:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884558269] [2025-02-06 18:19:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:30,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:30,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:19:30,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 18:19:30,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 18:19:30,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:30,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:30,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 18:19:30,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:30,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:30,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 18:19:30,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-06 18:19:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:19:31,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:19:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884558269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:19:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:19:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:19:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817675133] [2025-02-06 18:19:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:19:31,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:19:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:19:31,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:19:31,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:19:31,548 INFO L87 Difference]: Start difference. First operand 688 states and 966 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:19:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:19:33,012 INFO L93 Difference]: Finished difference Result 1582 states and 2239 transitions. [2025-02-06 18:19:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:19:33,012 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-02-06 18:19:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:19:33,016 INFO L225 Difference]: With dead ends: 1582 [2025-02-06 18:19:33,016 INFO L226 Difference]: Without dead ends: 939 [2025-02-06 18:19:33,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:19:33,017 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 606 mSDsluCounter, 2885 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 3388 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:19:33,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 3388 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 18:19:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2025-02-06 18:19:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 688. [2025-02-06 18:19:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 667 states have (on average 1.4137931034482758) internal successors, (943), 679 states have internal predecessors, (943), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-06 18:19:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 965 transitions. [2025-02-06 18:19:33,035 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 965 transitions. Word has length 101 [2025-02-06 18:19:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:19:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 965 transitions. [2025-02-06 18:19:33,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:19:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 965 transitions. [2025-02-06 18:19:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-06 18:19:33,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:19:33,037 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:19:33,044 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-02-06 18:19:33,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:33,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:19:33,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:19:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 708109720, now seen corresponding path program 1 times [2025-02-06 18:19:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:19:33,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749959707] [2025-02-06 18:19:33,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:19:33,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:19:33,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:19:33,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:33,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:19:33,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:19:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749959707] [2025-02-06 18:19:33,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749959707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:19:33,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28480937] [2025-02-06 18:19:33,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:19:33,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:19:33,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:19:33,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:19:33,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:19:33,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 18:19:33,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 18:19:33,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:19:33,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:19:33,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 18:19:33,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:19:56,158 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:20:36,675 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:21:08,892 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)