./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-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 e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:17:30,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:17:30,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:17:30,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:17:30,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:17:30,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:17:30,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:17:30,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:17:30,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:17:30,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:17:30,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:17:30,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:17:30,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:17:30,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:17:30,903 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:17:30,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:17:30,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:17:30,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:17:30,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:17:30,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:17:30,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:17:30,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:17:30,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:17:30,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:17:30,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:17:30,908 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-01-10 06:17:31,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:17:31,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:17:31,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:17:31,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:17:31,164 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:17:31,165 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_JEN_nondet_test2-1.i [2025-01-10 06:17:32,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d0761a2/23f99ceaabcd44f8bc38ad926392e4d3/FLAG3dd7ba590 [2025-01-10 06:17:32,833 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:17:32,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-1.i [2025-01-10 06:17:32,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d0761a2/23f99ceaabcd44f8bc38ad926392e4d3/FLAG3dd7ba590 [2025-01-10 06:17:32,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74d0761a2/23f99ceaabcd44f8bc38ad926392e4d3 [2025-01-10 06:17:32,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:17:32,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:17:32,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:17:32,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:17:32,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:17:32,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:17:32" (1/1) ... [2025-01-10 06:17:32,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76cfbddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:32, skipping insertion in model container [2025-01-10 06:17:32,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:17:32" (1/1) ... [2025-01-10 06:17:32,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:17:33,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:17:33,350 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:17:33,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:17:33,512 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:17:33,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33 WrapperNode [2025-01-10 06:17:33,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:17:33,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:17:33,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:17:33,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:17:33,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,624 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-01-10 06:17:33,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:17:33,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:17:33,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:17:33,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:17:33,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,707 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-01-10 06:17:33,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:17:33,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:17:33,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:17:33,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:17:33,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (1/1) ... [2025-01-10 06:17:33,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:17:33,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:33,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:17:33,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:17:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:17:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:17:33,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:17:33,864 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:17:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:17:33,865 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:17:33,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:17:33,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:17:33,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:17:34,049 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:17:34,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:17:35,305 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-01-10 06:17:35,305 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:17:35,321 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:17:35,321 INFO L312 CfgBuilder]: Removed 27 assume(true) statements. [2025-01-10 06:17:35,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:17:35 BoogieIcfgContainer [2025-01-10 06:17:35,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:17:35,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:17:35,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:17:35,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:17:35,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:17:32" (1/3) ... [2025-01-10 06:17:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6f2498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:17:35, skipping insertion in model container [2025-01-10 06:17:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:17:33" (2/3) ... [2025-01-10 06:17:35,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6f2498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:17:35, skipping insertion in model container [2025-01-10 06:17:35,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:17:35" (3/3) ... [2025-01-10 06:17:35,331 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-1.i [2025-01-10 06:17:35,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:17:35,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test2-1.i that has 4 procedures, 384 locations, 1 initial locations, 33 loop locations, and 6 error locations. [2025-01-10 06:17:35,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:17:35,412 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;@2104a623, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:17:35,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:17:35,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 365 states have (on average 1.6164383561643836) internal successors, (590), 371 states have internal predecessors, (590), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:35,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:17:35,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:35,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:17:35,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 223901251, now seen corresponding path program 1 times [2025-01-10 06:17:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:35,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712972468] [2025-01-10 06:17:35,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:35,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:17:35,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:17:35,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:35,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:35,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712972468] [2025-01-10 06:17:35,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712972468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:35,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:35,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:17:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761261510] [2025-01-10 06:17:35,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:35,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:17:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:35,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:17:35,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:17:35,610 INFO L87 Difference]: Start difference. First operand has 376 states, 365 states have (on average 1.6164383561643836) internal successors, (590), 371 states have internal predecessors, (590), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:35,684 INFO L93 Difference]: Finished difference Result 748 states and 1187 transitions. [2025-01-10 06:17:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:17:35,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-01-10 06:17:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:35,697 INFO L225 Difference]: With dead ends: 748 [2025-01-10 06:17:35,697 INFO L226 Difference]: Without dead ends: 370 [2025-01-10 06:17:35,702 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-01-10 06:17:35,706 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:35,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:17:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-01-10 06:17:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-01-10 06:17:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 360 states have (on average 1.4638888888888888) internal successors, (527), 365 states have internal predecessors, (527), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 533 transitions. [2025-01-10 06:17:35,804 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 533 transitions. Word has length 9 [2025-01-10 06:17:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:35,804 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 533 transitions. [2025-01-10 06:17:35,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 533 transitions. [2025-01-10 06:17:35,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 06:17:35,806 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:35,806 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:17:35,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:17:35,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:35,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 223903173, now seen corresponding path program 1 times [2025-01-10 06:17:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189624027] [2025-01-10 06:17:35,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:35,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:17:35,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:17:35,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:35,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:17:35,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117104170] [2025-01-10 06:17:35,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:35,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:35,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:35,841 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:17:35,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:17:35,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:17:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:17:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:35,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:17:35,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:17:36,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:17:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:36,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:17:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189624027] [2025-01-10 06:17:36,046 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:17:36,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117104170] [2025-01-10 06:17:36,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117104170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:36,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:36,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:17:36,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099932838] [2025-01-10 06:17:36,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:36,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:17:36,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:36,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:17:36,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:17:36,048 INFO L87 Difference]: Start difference. First operand 370 states and 533 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:36,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:36,206 INFO L93 Difference]: Finished difference Result 733 states and 1059 transitions. [2025-01-10 06:17:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:17:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-01-10 06:17:36,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:36,211 INFO L225 Difference]: With dead ends: 733 [2025-01-10 06:17:36,211 INFO L226 Difference]: Without dead ends: 731 [2025-01-10 06:17:36,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:17:36,212 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 512 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:36,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1524 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:36,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-01-10 06:17:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 377. [2025-01-10 06:17:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 367 states have (on average 1.457765667574932) internal successors, (535), 372 states have internal predecessors, (535), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:36,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 541 transitions. [2025-01-10 06:17:36,247 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 541 transitions. Word has length 9 [2025-01-10 06:17:36,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:36,247 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 541 transitions. [2025-01-10 06:17:36,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:36,247 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 541 transitions. [2025-01-10 06:17:36,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:17:36,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:36,251 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] [2025-01-10 06:17:36,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:17:36,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:36,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:36,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:36,454 INFO L85 PathProgramCache]: Analyzing trace with hash -822685057, now seen corresponding path program 1 times [2025-01-10 06:17:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:36,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261384598] [2025-01-10 06:17:36,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:36,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:36,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:17:36,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:17:36,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:36,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:36,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261384598] [2025-01-10 06:17:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261384598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:36,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:17:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250786066] [2025-01-10 06:17:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:17:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:36,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:17:36,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:17:36,777 INFO L87 Difference]: Start difference. First operand 377 states and 541 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:36,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:36,879 INFO L93 Difference]: Finished difference Result 539 states and 778 transitions. [2025-01-10 06:17:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:17:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-01-10 06:17:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:36,882 INFO L225 Difference]: With dead ends: 539 [2025-01-10 06:17:36,882 INFO L226 Difference]: Without dead ends: 380 [2025-01-10 06:17:36,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:17:36,886 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 105 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:36,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1425 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-10 06:17:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-01-10 06:17:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 367 states have (on average 1.438692098092643) internal successors, (528), 372 states have internal predecessors, (528), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 534 transitions. [2025-01-10 06:17:36,910 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 534 transitions. Word has length 66 [2025-01-10 06:17:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:36,910 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 534 transitions. [2025-01-10 06:17:36,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 534 transitions. [2025-01-10 06:17:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-10 06:17:36,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:36,914 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] [2025-01-10 06:17:36,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:17:36,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:36,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:36,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1248514419, now seen corresponding path program 1 times [2025-01-10 06:17:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957611057] [2025-01-10 06:17:36,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:36,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:36,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-10 06:17:36,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-10 06:17:36,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:36,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:37,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957611057] [2025-01-10 06:17:37,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957611057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:37,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:37,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:17:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505499587] [2025-01-10 06:17:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:37,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:17:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:37,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:17:37,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:17:37,261 INFO L87 Difference]: Start difference. First operand 377 states and 534 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:37,371 INFO L93 Difference]: Finished difference Result 731 states and 1043 transitions. [2025-01-10 06:17:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:17:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2025-01-10 06:17:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:37,380 INFO L225 Difference]: With dead ends: 731 [2025-01-10 06:17:37,380 INFO L226 Difference]: Without dead ends: 729 [2025-01-10 06:17:37,380 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-01-10 06:17:37,381 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 449 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:37,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1526 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-01-10 06:17:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 534. [2025-01-10 06:17:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 524 states have (on average 1.4370229007633588) internal successors, (753), 529 states have internal predecessors, (753), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 759 transitions. [2025-01-10 06:17:37,403 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 759 transitions. Word has length 66 [2025-01-10 06:17:37,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:37,406 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 759 transitions. [2025-01-10 06:17:37,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 759 transitions. [2025-01-10 06:17:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:17:37,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:37,409 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-01-10 06:17:37,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:17:37,409 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:37,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash 157669932, now seen corresponding path program 1 times [2025-01-10 06:17:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:37,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866386740] [2025-01-10 06:17:37,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:37,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:17:37,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:17:37,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:37,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866386740] [2025-01-10 06:17:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866386740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:37,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:37,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:17:37,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079646743] [2025-01-10 06:17:37,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:37,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:17:37,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:37,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:17:37,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:17:37,638 INFO L87 Difference]: Start difference. First operand 534 states and 759 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:37,734 INFO L93 Difference]: Finished difference Result 1078 states and 1537 transitions. [2025-01-10 06:17:37,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:17:37,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2025-01-10 06:17:37,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:37,737 INFO L225 Difference]: With dead ends: 1078 [2025-01-10 06:17:37,738 INFO L226 Difference]: Without dead ends: 554 [2025-01-10 06:17:37,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:17:37,739 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 8 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:37,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 997 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-10 06:17:37,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-10 06:17:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 544 states have (on average 1.4209558823529411) internal successors, (773), 549 states have internal predecessors, (773), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:37,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 779 transitions. [2025-01-10 06:17:37,766 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 779 transitions. Word has length 82 [2025-01-10 06:17:37,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:37,767 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 779 transitions. [2025-01-10 06:17:37,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 779 transitions. [2025-01-10 06:17:37,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:17:37,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:37,771 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-01-10 06:17:37,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:17:37,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:37,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:37,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1834202928, now seen corresponding path program 1 times [2025-01-10 06:17:37,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:37,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179356400] [2025-01-10 06:17:37,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:37,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:37,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:17:37,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:17:37,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:37,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:37,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179356400] [2025-01-10 06:17:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179356400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:37,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:17:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472687608] [2025-01-10 06:17:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:37,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:17:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:37,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:17:37,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:17:37,995 INFO L87 Difference]: Start difference. First operand 554 states and 779 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:38,073 INFO L93 Difference]: Finished difference Result 1036 states and 1458 transitions. [2025-01-10 06:17:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:17:38,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 82 [2025-01-10 06:17:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:38,076 INFO L225 Difference]: With dead ends: 1036 [2025-01-10 06:17:38,076 INFO L226 Difference]: Without dead ends: 492 [2025-01-10 06:17:38,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:17:38,078 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 32 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:38,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1252 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:38,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-01-10 06:17:38,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2025-01-10 06:17:38,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 482 states have (on average 1.396265560165975) internal successors, (673), 487 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 679 transitions. [2025-01-10 06:17:38,096 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 679 transitions. Word has length 82 [2025-01-10 06:17:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:38,096 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 679 transitions. [2025-01-10 06:17:38,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 679 transitions. [2025-01-10 06:17:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-10 06:17:38,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:38,098 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-01-10 06:17:38,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:17:38,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:38,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash -937684510, now seen corresponding path program 1 times [2025-01-10 06:17:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192447976] [2025-01-10 06:17:38,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:38,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-10 06:17:38,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-10 06:17:38,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:38,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:38,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:38,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192447976] [2025-01-10 06:17:38,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192447976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:38,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:17:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488706756] [2025-01-10 06:17:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:17:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:38,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:17:38,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:17:38,266 INFO L87 Difference]: Start difference. First operand 492 states and 679 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:38,358 INFO L93 Difference]: Finished difference Result 1333 states and 1855 transitions. [2025-01-10 06:17:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:17:38,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2025-01-10 06:17:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:38,362 INFO L225 Difference]: With dead ends: 1333 [2025-01-10 06:17:38,362 INFO L226 Difference]: Without dead ends: 851 [2025-01-10 06:17:38,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:17:38,366 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 257 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:38,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 869 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2025-01-10 06:17:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 849. [2025-01-10 06:17:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 839 states have (on average 1.4040524433849821) internal successors, (1178), 844 states have internal predecessors, (1178), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 06:17:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1184 transitions. [2025-01-10 06:17:38,393 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1184 transitions. Word has length 82 [2025-01-10 06:17:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:38,394 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1184 transitions. [2025-01-10 06:17:38,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:17:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1184 transitions. [2025-01-10 06:17:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:17:38,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:38,398 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-01-10 06:17:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:17:38,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1505282568, now seen corresponding path program 1 times [2025-01-10 06:17:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120900985] [2025-01-10 06:17:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:38,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:17:38,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:17:38,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:38,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:17:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120900985] [2025-01-10 06:17:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120900985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:17:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:17:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668389507] [2025-01-10 06:17:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:38,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:17:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:38,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:17:38,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:17:38,804 INFO L87 Difference]: Start difference. First operand 849 states and 1184 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:38,891 INFO L93 Difference]: Finished difference Result 915 states and 1270 transitions. [2025-01-10 06:17:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:17:38,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2025-01-10 06:17:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:38,896 INFO L225 Difference]: With dead ends: 915 [2025-01-10 06:17:38,896 INFO L226 Difference]: Without dead ends: 913 [2025-01-10 06:17:38,897 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-01-10 06:17:38,898 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 337 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:38,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1277 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2025-01-10 06:17:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2025-01-10 06:17:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 900 states have (on average 1.3955555555555557) internal successors, (1256), 905 states have internal predecessors, (1256), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:17:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1268 transitions. [2025-01-10 06:17:38,924 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1268 transitions. Word has length 97 [2025-01-10 06:17:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:38,925 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1268 transitions. [2025-01-10 06:17:38,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1268 transitions. [2025-01-10 06:17:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:17:38,926 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:38,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:17:38,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:17:38,927 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:38,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 671640385, now seen corresponding path program 1 times [2025-01-10 06:17:38,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165412827] [2025-01-10 06:17:38,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:17:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:17:39,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:39,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:17:39,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165412827] [2025-01-10 06:17:39,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165412827] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:17:39,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725202757] [2025-01-10 06:17:39,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:39,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:17:39,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:17:39,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:17:39,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:17:39,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:39,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 06:17:39,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:17:39,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:17:39,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:17:39,797 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 27 treesize of output 11 [2025-01-10 06:17:40,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:17:40,292 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 77 treesize of output 55 [2025-01-10 06:17:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:17:40,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:17:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725202757] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:17:40,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:17:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967721367] [2025-01-10 06:17:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:17:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:40,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:17:40,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:17:40,537 INFO L87 Difference]: Start difference. First operand 913 states and 1268 transitions. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:42,105 INFO L93 Difference]: Finished difference Result 1652 states and 2298 transitions. [2025-01-10 06:17:42,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:17:42,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-01-10 06:17:42,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:42,110 INFO L225 Difference]: With dead ends: 1652 [2025-01-10 06:17:42,110 INFO L226 Difference]: Without dead ends: 915 [2025-01-10 06:17:42,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:17:42,111 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 533 mSDsluCounter, 2630 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:42,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 3089 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 06:17:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-01-10 06:17:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2025-01-10 06:17:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 900 states have (on average 1.3944444444444444) internal successors, (1255), 905 states have internal predecessors, (1255), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-10 06:17:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1267 transitions. [2025-01-10 06:17:42,134 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1267 transitions. Word has length 104 [2025-01-10 06:17:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:42,134 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1267 transitions. [2025-01-10 06:17:42,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1267 transitions. [2025-01-10 06:17:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:17:42,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:42,139 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-01-10 06:17:42,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:17:42,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:42,340 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2075070918, now seen corresponding path program 1 times [2025-01-10 06:17:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569650941] [2025-01-10 06:17:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:42,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:17:42,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:17:42,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:42,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:17:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569650941] [2025-01-10 06:17:42,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569650941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:17:42,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792667216] [2025-01-10 06:17:42,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:42,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:17:42,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:17:42,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:17:43,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:17:43,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:43,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:43,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:17:43,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:17:43,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:17:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:17:43,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:17:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792667216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:43,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:17:43,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-01-10 06:17:43,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918691470] [2025-01-10 06:17:43,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:17:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:43,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:17:43,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:17:43,413 INFO L87 Difference]: Start difference. First operand 913 states and 1267 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:17:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:43,561 INFO L93 Difference]: Finished difference Result 1611 states and 2237 transitions. [2025-01-10 06:17:43,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:17:43,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-01-10 06:17:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:43,568 INFO L225 Difference]: With dead ends: 1611 [2025-01-10 06:17:43,568 INFO L226 Difference]: Without dead ends: 924 [2025-01-10 06:17:43,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:17:43,570 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 387 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:43,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 2102 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:17:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-01-10 06:17:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 916. [2025-01-10 06:17:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 902 states have (on average 1.394678492239468) internal successors, (1258), 908 states have internal predecessors, (1258), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-10 06:17:43,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1272 transitions. [2025-01-10 06:17:43,602 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1272 transitions. Word has length 105 [2025-01-10 06:17:43,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:43,602 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1272 transitions. [2025-01-10 06:17:43,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:17:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1272 transitions. [2025-01-10 06:17:43,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-10 06:17:43,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:43,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-01-10 06:17:43,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 06:17:43,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:43,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -487360676, now seen corresponding path program 1 times [2025-01-10 06:17:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162923271] [2025-01-10 06:17:43,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:43,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 06:17:44,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 06:17:44,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:44,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:17:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162923271] [2025-01-10 06:17:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162923271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:17:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351359284] [2025-01-10 06:17:44,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:17:44,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:44,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:44,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:17:44,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:17:44,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-10 06:17:44,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-10 06:17:44,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:17:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:44,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 06:17:44,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:17:44,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-10 06:17:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:17:45,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:17:45,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:17:45,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351359284] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:17:45,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:17:45,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-01-10 06:17:45,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063973051] [2025-01-10 06:17:45,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:17:45,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-10 06:17:45,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:45,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-10 06:17:45,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-01-10 06:17:45,643 INFO L87 Difference]: Start difference. First operand 916 states and 1272 transitions. Second operand has 17 states, 17 states have (on average 12.058823529411764) internal successors, (205), 17 states have internal predecessors, (205), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:17:50,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:17:54,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:17:58,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-10 06:17:58,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:58,632 INFO L93 Difference]: Finished difference Result 1707 states and 2366 transitions. [2025-01-10 06:17:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-10 06:17:58,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.058823529411764) internal successors, (205), 17 states have internal predecessors, (205), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 107 [2025-01-10 06:17:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:58,639 INFO L225 Difference]: With dead ends: 1707 [2025-01-10 06:17:58,639 INFO L226 Difference]: Without dead ends: 1015 [2025-01-10 06:17:58,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=969, Unknown=0, NotChecked=0, Total=1190 [2025-01-10 06:17:58,641 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 782 mSDsluCounter, 4388 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 32 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 4883 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:58,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 4883 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 400 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-01-10 06:17:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-01-10 06:17:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1002. [2025-01-10 06:17:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 982 states have (on average 1.3930753564154785) internal successors, (1368), 989 states have internal predecessors, (1368), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-10 06:17:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1388 transitions. [2025-01-10 06:17:58,675 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1388 transitions. Word has length 107 [2025-01-10 06:17:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:58,675 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1388 transitions. [2025-01-10 06:17:58,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.058823529411764) internal successors, (205), 17 states have internal predecessors, (205), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-01-10 06:17:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1388 transitions. [2025-01-10 06:17:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-10 06:17:58,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:58,678 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 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] [2025-01-10 06:17:58,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 06:17:58,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 06:17:58,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:17:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:17:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1482806726, now seen corresponding path program 2 times [2025-01-10 06:17:58,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:17:58,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482794400] [2025-01-10 06:17:58,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:17:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:17:58,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-01-10 06:17:59,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-01-10 06:17:59,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:17:59,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 06:17:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:17:59,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482794400] [2025-01-10 06:17:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482794400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:17:59,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641673159] [2025-01-10 06:17:59,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:17:59,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:17:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:17:59,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:17:59,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:17:59,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-01-10 06:17:59,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 111 statements. [2025-01-10 06:17:59,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:17:59,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:17:59,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 06:17:59,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:17:59,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2025-01-10 06:17:59,741 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-10 06:17:59,742 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:17:59,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641673159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:17:59,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:17:59,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-01-10 06:17:59,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331296287] [2025-01-10 06:17:59,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:17:59,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:17:59,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:17:59,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:17:59,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:17:59,745 INFO L87 Difference]: Start difference. First operand 1002 states and 1388 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:17:59,769 INFO L93 Difference]: Finished difference Result 1002 states and 1388 transitions. [2025-01-10 06:17:59,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:17:59,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2025-01-10 06:17:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:17:59,774 INFO L225 Difference]: With dead ends: 1002 [2025-01-10 06:17:59,775 INFO L226 Difference]: Without dead ends: 1001 [2025-01-10 06:17:59,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:17:59,775 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 1 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:17:59,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 876 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:17:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-01-10 06:17:59,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2025-01-10 06:17:59,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 982 states have (on average 1.3920570264765784) internal successors, (1367), 988 states have internal predecessors, (1367), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-01-10 06:17:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1387 transitions. [2025-01-10 06:17:59,807 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1387 transitions. Word has length 111 [2025-01-10 06:17:59,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:17:59,808 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1387 transitions. [2025-01-10 06:17:59,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:17:59,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1387 transitions. [2025-01-10 06:17:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-10 06:17:59,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:17:59,809 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:17:59,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:18:00,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:18:00,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:18:00,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:18:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1277631833, now seen corresponding path program 1 times [2025-01-10 06:18:00,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:18:00,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128109765] [2025-01-10 06:18:00,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:18:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:18:00,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 06:18:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 06:18:00,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:18:00,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:18:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-10 06:18:00,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:18:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128109765] [2025-01-10 06:18:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128109765] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:18:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880173779] [2025-01-10 06:18:00,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:18:00,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:18:00,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:18:00,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:18:00,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:18:00,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-10 06:18:00,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-10 06:18:00,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:18:00,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:18:00,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:18:00,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:18:34,200 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-10 06:19:00,568 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)