./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.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_BER_test8-1.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 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:10:32,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:10:32,697 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:10:32,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:10:32,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:10:32,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:10:32,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:10:32,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:10:32,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:10:32,728 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:10:32,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:10:32,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:10:32,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:10:32,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:10:32,729 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:10:32,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:10:32,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:10:32,730 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:10:32,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:10:32,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:10:32,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:10:32,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:10:32,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:10:32,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:10:32,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:10:32,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:10:32,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:10:32,733 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 -> 58fb5e591c63ebc056bfb6417ddf45efba9827c2f78526eb3c8a68d018ffd43a [2025-02-06 18:10:32,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:10:33,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:10:33,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:10:33,010 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:10:33,010 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:10:33,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2025-02-06 18:10:34,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21ce6bb4/bbe802f11ded44f2ae4ca45056832906/FLAGdd466d814 [2025-02-06 18:10:34,713 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:10:34,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-1.i [2025-02-06 18:10:34,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21ce6bb4/bbe802f11ded44f2ae4ca45056832906/FLAGdd466d814 [2025-02-06 18:10:34,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e21ce6bb4/bbe802f11ded44f2ae4ca45056832906 [2025-02-06 18:10:34,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:10:34,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:10:34,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:10:34,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:10:34,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:10:34,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:10:34" (1/1) ... [2025-02-06 18:10:34,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcca4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:34, skipping insertion in model container [2025-02-06 18:10:34,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:10:34" (1/1) ... [2025-02-06 18:10:34,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:10:35,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:10:35,460 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:10:35,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:10:35,609 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:10:35,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35 WrapperNode [2025-02-06 18:10:35,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:10:35,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:10:35,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:10:35,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:10:35,617 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:10:35" (1/1) ... [2025-02-06 18:10:35,653 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:10:35" (1/1) ... [2025-02-06 18:10:35,720 INFO L138 Inliner]: procedures = 177, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1387 [2025-02-06 18:10:35,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:10:35,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:10:35,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:10:35,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:10:35,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,817 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-02-06 18:10:35,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,867 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:10:35,879 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:10:35,879 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:10:35,879 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:10:35,882 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (1/1) ... [2025-02-06 18:10:35,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:10:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:35,919 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:10:35,922 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:10:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 18:10:35,946 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 18:10:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:10:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:10:35,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:10:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 18:10:35,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 18:10:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:10:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:10:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:10:35,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-06 18:10:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-06 18:10:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-02-06 18:10:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-06 18:10:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-06 18:10:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-02-06 18:10:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-02-06 18:10:35,948 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-02-06 18:10:35,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:10:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:10:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 18:10:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 18:10:35,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:10:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:10:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:10:36,177 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:10:36,179 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:10:37,652 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: 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:10:37,768 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-02-06 18:10:37,769 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:10:37,829 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:10:37,829 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 18:10:37,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:10:37 BoogieIcfgContainer [2025-02-06 18:10:37,830 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:10:37,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:10:37,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:10:37,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:10:37,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:10:34" (1/3) ... [2025-02-06 18:10:37,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e641f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:10:37, skipping insertion in model container [2025-02-06 18:10:37,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:10:35" (2/3) ... [2025-02-06 18:10:37,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e641f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:10:37, skipping insertion in model container [2025-02-06 18:10:37,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:10:37" (3/3) ... [2025-02-06 18:10:37,846 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-1.i [2025-02-06 18:10:37,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:10:37,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_BER_test8-1.i that has 7 procedures, 457 locations, 1 initial locations, 37 loop locations, and 8 error locations. [2025-02-06 18:10:37,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:10:37,962 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;@7ced1b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:10:37,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 18:10:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 449 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 439 states have internal predecessors, (674), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-06 18:10:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:10:37,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:37,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:37,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1473526581, now seen corresponding path program 1 times [2025-02-06 18:10:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971511790] [2025-02-06 18:10:37,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:37,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:38,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:10:38,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:10:38,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:38,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:38,135 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:10:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:38,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971511790] [2025-02-06 18:10:38,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971511790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:38,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:38,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:10:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526942786] [2025-02-06 18:10:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:38,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 18:10:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:38,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 18:10:38,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 18:10:38,163 INFO L87 Difference]: Start difference. First operand has 449 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 439 states have internal predecessors, (674), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) 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:10:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:38,310 INFO L93 Difference]: Finished difference Result 894 states and 1450 transitions. [2025-02-06 18:10:38,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 18:10:38,312 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:10:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:38,327 INFO L225 Difference]: With dead ends: 894 [2025-02-06 18:10:38,328 INFO L226 Difference]: Without dead ends: 440 [2025-02-06 18:10:38,337 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:10:38,342 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:38,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:38,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-06 18:10:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-02-06 18:10:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 409 states have (on average 1.4743276283618583) internal successors, (603), 431 states have internal predecessors, (603), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:10:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 643 transitions. [2025-02-06 18:10:38,411 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 643 transitions. Word has length 7 [2025-02-06 18:10:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 643 transitions. [2025-02-06 18:10:38,412 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:10:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 643 transitions. [2025-02-06 18:10:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 18:10:38,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:38,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:38,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:10:38,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:38,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1473525620, now seen corresponding path program 1 times [2025-02-06 18:10:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674173182] [2025-02-06 18:10:38,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:38,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:10:38,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:10:38,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:38,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 18:10:38,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2067401585] [2025-02-06 18:10:38,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:38,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:38,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:38,467 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:10:38,470 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:10:38,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:10:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:10:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:38,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:10:38,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:38,666 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:10:38,703 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:10:38,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:10:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674173182] [2025-02-06 18:10:38,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 18:10:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067401585] [2025-02-06 18:10:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067401585] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665168684] [2025-02-06 18:10:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:38,708 INFO L87 Difference]: Start difference. First operand 440 states and 643 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:10:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:39,008 INFO L93 Difference]: Finished difference Result 832 states and 1210 transitions. [2025-02-06 18:10:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:39,010 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:10:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:39,015 INFO L225 Difference]: With dead ends: 832 [2025-02-06 18:10:39,015 INFO L226 Difference]: Without dead ends: 830 [2025-02-06 18:10:39,016 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:10:39,016 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 550 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1727 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:39,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1727 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-02-06 18:10:39,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 446. [2025-02-06 18:10:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4698795180722892) internal successors, (610), 437 states have internal predecessors, (610), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:10:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 650 transitions. [2025-02-06 18:10:39,074 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 650 transitions. Word has length 7 [2025-02-06 18:10:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:39,074 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 650 transitions. [2025-02-06 18:10:39,074 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:10:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 650 transitions. [2025-02-06 18:10:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 18:10:39,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:39,078 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] [2025-02-06 18:10:39,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:10:39,282 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:10:39,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:39,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:39,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2096347921, now seen corresponding path program 1 times [2025-02-06 18:10:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959973550] [2025-02-06 18:10:39,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:39,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:10:39,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:10:39,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:39,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:39,758 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:10:39,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:39,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959973550] [2025-02-06 18:10:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959973550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:10:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705464176] [2025-02-06 18:10:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:39,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:39,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:39,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:39,760 INFO L87 Difference]: Start difference. First operand 446 states and 650 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:40,071 INFO L93 Difference]: Finished difference Result 1060 states and 1552 transitions. [2025-02-06 18:10:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 18:10:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:40,081 INFO L225 Difference]: With dead ends: 1060 [2025-02-06 18:10:40,082 INFO L226 Difference]: Without dead ends: 829 [2025-02-06 18:10:40,084 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:10:40,085 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 551 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:40,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1810 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 18:10:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-02-06 18:10:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 446. [2025-02-06 18:10:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4674698795180723) internal successors, (609), 437 states have internal predecessors, (609), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:10:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 649 transitions. [2025-02-06 18:10:40,116 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 649 transitions. Word has length 71 [2025-02-06 18:10:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:40,117 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 649 transitions. [2025-02-06 18:10:40,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 649 transitions. [2025-02-06 18:10:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 18:10:40,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:40,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:40,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:10:40,123 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:40,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 944006506, now seen corresponding path program 1 times [2025-02-06 18:10:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142361760] [2025-02-06 18:10:40,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:40,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 18:10:40,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 18:10:40,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:40,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:40,410 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:10:40,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:40,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142361760] [2025-02-06 18:10:40,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142361760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:40,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:40,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:10:40,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703660923] [2025-02-06 18:10:40,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:40,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:40,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:40,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:40,413 INFO L87 Difference]: Start difference. First operand 446 states and 649 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:40,584 INFO L93 Difference]: Finished difference Result 887 states and 1293 transitions. [2025-02-06 18:10:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:40,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-06 18:10:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:40,589 INFO L225 Difference]: With dead ends: 887 [2025-02-06 18:10:40,590 INFO L226 Difference]: Without dead ends: 449 [2025-02-06 18:10:40,592 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:10:40,593 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 105 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:40,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1638 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:40,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-06 18:10:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2025-02-06 18:10:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 415 states have (on average 1.4506024096385541) internal successors, (602), 437 states have internal predecessors, (602), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-06 18:10:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 642 transitions. [2025-02-06 18:10:40,619 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 642 transitions. Word has length 82 [2025-02-06 18:10:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 642 transitions. [2025-02-06 18:10:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 642 transitions. [2025-02-06 18:10:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-06 18:10:40,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:40,628 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:10:40,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 491954307, now seen corresponding path program 1 times [2025-02-06 18:10:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011350608] [2025-02-06 18:10:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:40,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 18:10:40,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 18:10:40,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:40,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:40,840 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:10:40,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:40,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011350608] [2025-02-06 18:10:40,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011350608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:40,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:40,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:40,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573126201] [2025-02-06 18:10:40,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:40,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:10:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:40,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:10:40,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:10:40,843 INFO L87 Difference]: Start difference. First operand 446 states and 642 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:41,068 INFO L93 Difference]: Finished difference Result 1176 states and 1706 transitions. [2025-02-06 18:10:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:10:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-02-06 18:10:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:41,073 INFO L225 Difference]: With dead ends: 1176 [2025-02-06 18:10:41,073 INFO L226 Difference]: Without dead ends: 738 [2025-02-06 18:10:41,074 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:10:41,075 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 372 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:41,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1338 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-02-06 18:10:41,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 735. [2025-02-06 18:10:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 703 states have (on average 1.460881934566145) internal successors, (1027), 725 states have internal predecessors, (1027), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-06 18:10:41,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1069 transitions. [2025-02-06 18:10:41,113 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1069 transitions. Word has length 82 [2025-02-06 18:10:41,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:41,115 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1069 transitions. [2025-02-06 18:10:41,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:10:41,115 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1069 transitions. [2025-02-06 18:10:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 18:10:41,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:41,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:41,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:10:41,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:41,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash -744496018, now seen corresponding path program 1 times [2025-02-06 18:10:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:41,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829896329] [2025-02-06 18:10:41,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:41,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 18:10:41,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 18:10:41,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:41,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:41,487 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:10:41,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:41,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829896329] [2025-02-06 18:10:41,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829896329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:41,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:41,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304605124] [2025-02-06 18:10:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:41,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:41,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:41,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:41,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:41,489 INFO L87 Difference]: Start difference. First operand 735 states and 1069 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:41,702 INFO L93 Difference]: Finished difference Result 835 states and 1218 transitions. [2025-02-06 18:10:41,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:10:41,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-02-06 18:10:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:41,710 INFO L225 Difference]: With dead ends: 835 [2025-02-06 18:10:41,710 INFO L226 Difference]: Without dead ends: 833 [2025-02-06 18:10:41,710 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:10:41,711 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 223 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:41,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1737 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-02-06 18:10:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 804. [2025-02-06 18:10:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 767 states have (on average 1.4458930899608866) internal successors, (1109), 789 states have internal predecessors, (1109), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:10:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1159 transitions. [2025-02-06 18:10:41,745 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1159 transitions. Word has length 97 [2025-02-06 18:10:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:41,746 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1159 transitions. [2025-02-06 18:10:41,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 18:10:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1159 transitions. [2025-02-06 18:10:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 18:10:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:41,748 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:41,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:10:41,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 219221013, now seen corresponding path program 1 times [2025-02-06 18:10:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162018132] [2025-02-06 18:10:41,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:41,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 18:10:41,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 18:10:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:42,134 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:10:42,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:42,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162018132] [2025-02-06 18:10:42,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162018132] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:42,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:42,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:10:42,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714297485] [2025-02-06 18:10:42,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:42,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:42,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:42,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:42,136 INFO L87 Difference]: Start difference. First operand 804 states and 1159 transitions. Second operand has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:10:42,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:42,403 INFO L93 Difference]: Finished difference Result 1032 states and 1486 transitions. [2025-02-06 18:10:42,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:10:42,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 109 [2025-02-06 18:10:42,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:42,410 INFO L225 Difference]: With dead ends: 1032 [2025-02-06 18:10:42,410 INFO L226 Difference]: Without dead ends: 1030 [2025-02-06 18:10:42,412 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:10:42,413 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 458 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:42,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1710 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 18:10:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-06 18:10:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 807. [2025-02-06 18:10:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 770 states have (on average 1.4441558441558442) internal successors, (1112), 791 states have internal predecessors, (1112), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:10:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1162 transitions. [2025-02-06 18:10:42,445 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1162 transitions. Word has length 109 [2025-02-06 18:10:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:42,446 INFO L471 AbstractCegarLoop]: Abstraction has 807 states and 1162 transitions. [2025-02-06 18:10:42,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:10:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1162 transitions. [2025-02-06 18:10:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 18:10:42,448 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:42,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:10:42,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1178869191, now seen corresponding path program 1 times [2025-02-06 18:10:42,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407441770] [2025-02-06 18:10:42,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:42,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 18:10:42,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 18:10:42,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:42,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:42,941 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:10:42,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:42,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407441770] [2025-02-06 18:10:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407441770] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416494818] [2025-02-06 18:10:42,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:42,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:42,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:42,945 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:10:42,947 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:10:43,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 18:10:43,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 18:10:43,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:43,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 18:10:43,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:10:43,320 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:10:43,343 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:10:43,368 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:10:43,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:10:43,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-02-06 18:10:44,201 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:10:44,202 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:10:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416494818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:44,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:10:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-02-06 18:10:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585784799] [2025-02-06 18:10:44,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:44,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:10:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:44,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:10:44,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-02-06 18:10:44,205 INFO L87 Difference]: Start difference. First operand 807 states and 1162 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:10:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:48,398 INFO L93 Difference]: Finished difference Result 1802 states and 2592 transitions. [2025-02-06 18:10:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:10:48,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 115 [2025-02-06 18:10:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:48,403 INFO L225 Difference]: With dead ends: 1802 [2025-02-06 18:10:48,404 INFO L226 Difference]: Without dead ends: 1082 [2025-02-06 18:10:48,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:10:48,406 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 830 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 4154 SdHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:48,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 4154 Invalid, 1730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 18:10:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2025-02-06 18:10:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 840. [2025-02-06 18:10:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 803 states have (on average 1.4371108343711083) internal successors, (1154), 824 states have internal predecessors, (1154), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:10:48,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1204 transitions. [2025-02-06 18:10:48,439 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1204 transitions. Word has length 115 [2025-02-06 18:10:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:48,440 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1204 transitions. [2025-02-06 18:10:48,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-06 18:10:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1204 transitions. [2025-02-06 18:10:48,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 18:10:48,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:48,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:48,452 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:10:48,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:48,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:48,647 INFO L85 PathProgramCache]: Analyzing trace with hash 793502408, now seen corresponding path program 1 times [2025-02-06 18:10:48,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:48,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012432603] [2025-02-06 18:10:48,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:48,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 18:10:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 18:10:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:48,811 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:10:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012432603] [2025-02-06 18:10:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012432603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:10:48,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:10:48,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:10:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789447250] [2025-02-06 18:10:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:10:48,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:10:48,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:10:48,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:10:48,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:10:48,813 INFO L87 Difference]: Start difference. First operand 840 states and 1204 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:10:48,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:10:48,939 INFO L93 Difference]: Finished difference Result 1522 states and 2183 transitions. [2025-02-06 18:10:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:10:48,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 115 [2025-02-06 18:10:48,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 18:10:48,943 INFO L225 Difference]: With dead ends: 1522 [2025-02-06 18:10:48,944 INFO L226 Difference]: Without dead ends: 711 [2025-02-06 18:10:48,946 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:10:48,947 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 9 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 18:10:48,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1505 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 18:10:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-02-06 18:10:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-02-06 18:10:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 674 states have (on average 1.410979228486647) internal successors, (951), 695 states have internal predecessors, (951), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 18:10:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1001 transitions. [2025-02-06 18:10:48,971 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1001 transitions. Word has length 115 [2025-02-06 18:10:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 18:10:48,972 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1001 transitions. [2025-02-06 18:10:48,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-06 18:10:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1001 transitions. [2025-02-06 18:10:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 18:10:48,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 18:10:48,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:10:48,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:10:48,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-02-06 18:10:48,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:10:48,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2043830654, now seen corresponding path program 1 times [2025-02-06 18:10:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:10:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795738871] [2025-02-06 18:10:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:10:49,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 18:10:49,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:10:49,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:49,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:49,309 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:10:49,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:10:49,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795738871] [2025-02-06 18:10:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795738871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:10:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476138951] [2025-02-06 18:10:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:10:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:10:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:10:49,318 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:10:49,319 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:10:49,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 18:10:49,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 18:10:49,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:10:49,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:10:50,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 18:10:50,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:11:18,923 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:11:30,935 WARN L286 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:11:47,196 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:11:56,976 WARN L286 SmtUtils]: Spent 9.78s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 18:12:03,942 WARN L286 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 37 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)