./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-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_SFH_test7-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 c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:30:21,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:30:21,309 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:30:21,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:30:21,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:30:21,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:30:21,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:30:21,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:30:21,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:30:21,351 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:30:21,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:30:21,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:30:21,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:30:21,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:30:21,352 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:30:21,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:30:21,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:30:21,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:30:21,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:30:21,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:30:21,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:30:21,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:21,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:30:21,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:30:21,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:30:21,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:21,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:30:21,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:30:21,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:30:21,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:30:21,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:30:21,358 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 -> c2bb9f0c15e3c3296f863c26b4377b27546cf1c417a60e9663a6ff48eb617ef8 [2025-01-10 06:30:21,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:30:21,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:30:21,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:30:21,649 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:30:21,650 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:30:21,651 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_SFH_test7-1.i [2025-01-10 06:30:22,926 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a543f86/5f04c2a01c8a45c3a350727705f3e7ea/FLAGb974d495f [2025-01-10 06:30:23,311 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:30:23,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-1.i [2025-01-10 06:30:23,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a543f86/5f04c2a01c8a45c3a350727705f3e7ea/FLAGb974d495f [2025-01-10 06:30:23,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/95a543f86/5f04c2a01c8a45c3a350727705f3e7ea [2025-01-10 06:30:23,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:30:23,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:30:23,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:30:23,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:30:23,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:30:23,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:30:23" (1/1) ... [2025-01-10 06:30:23,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d60a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:23, skipping insertion in model container [2025-01-10 06:30:23,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:30:23" (1/1) ... [2025-01-10 06:30:23,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:30:23,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:30:23,835 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:30:23,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:30:24,010 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:30:24,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24 WrapperNode [2025-01-10 06:30:24,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:30:24,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:30:24,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:30:24,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:30:24,020 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:30:24" (1/1) ... [2025-01-10 06:30:24,050 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:30:24" (1/1) ... [2025-01-10 06:30:24,113 INFO L138 Inliner]: procedures = 176, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1384 [2025-01-10 06:30:24,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:30:24,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:30:24,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:30:24,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:30:24,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,219 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2025-01-10 06:30:24,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,277 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:30:24,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:30:24,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:30:24,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:30:24,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (1/1) ... [2025-01-10 06:30:24,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:24,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:24,340 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:30:24,348 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:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:30:24,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:30:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:30:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:30:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:30:24,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:30:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:30:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:30:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:30:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:30:24,582 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:30:24,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:30:26,043 INFO L? ?]: Removed 319 outVars from TransFormulas that were not future-live. [2025-01-10 06:30:26,043 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:30:26,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:30:26,066 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-10 06:30:26,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:30:26 BoogieIcfgContainer [2025-01-10 06:30:26,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:30:26,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:30:26,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:30:26,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:30:26,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:30:23" (1/3) ... [2025-01-10 06:30:26,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21177dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:30:26, skipping insertion in model container [2025-01-10 06:30:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:24" (2/3) ... [2025-01-10 06:30:26,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21177dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:30:26, skipping insertion in model container [2025-01-10 06:30:26,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:30:26" (3/3) ... [2025-01-10 06:30:26,077 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-1.i [2025-01-10 06:30:26,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:30:26,090 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test7-1.i that has 5 procedures, 415 locations, 1 initial locations, 38 loop locations, and 6 error locations. [2025-01-10 06:30:26,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:30:26,166 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;@1fb447e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:30:26,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 06:30:26,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 407 states, 393 states have (on average 1.618320610687023) internal successors, (636), 400 states have internal predecessors, (636), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-10 06:30:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:30:26,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:26,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:26,178 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:30:26,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1000487724, now seen corresponding path program 1 times [2025-01-10 06:30:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134470782] [2025-01-10 06:30:26,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:26,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:26,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:30:26,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:30:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:26,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:30:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945943071] [2025-01-10 06:30:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:26,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:26,301 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:30:26,303 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:30:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:30:26,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:30:26,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:26,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:26,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:30:26,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:26,494 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:30:26,537 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:30:26,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:26,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134470782] [2025-01-10 06:30:26,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:30:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945943071] [2025-01-10 06:30:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945943071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:26,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577168024] [2025-01-10 06:30:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:26,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:26,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:26,568 INFO L87 Difference]: Start difference. First operand has 407 states, 393 states have (on average 1.618320610687023) internal successors, (636), 400 states have internal predecessors, (636), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:26,783 INFO L93 Difference]: Finished difference Result 1201 states and 1922 transitions. [2025-01-10 06:30:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:26,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:30:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:26,800 INFO L225 Difference]: With dead ends: 1201 [2025-01-10 06:30:26,800 INFO L226 Difference]: Without dead ends: 784 [2025-01-10 06:30:26,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:30:26,810 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 553 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:26,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1653 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-01-10 06:30:26,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 403. [2025-01-10 06:30:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4529262086513994) internal successors, (571), 398 states have internal predecessors, (571), 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:30:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 577 transitions. [2025-01-10 06:30:26,896 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 577 transitions. Word has length 8 [2025-01-10 06:30:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:26,896 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 577 transitions. [2025-01-10 06:30:26,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 577 transitions. [2025-01-10 06:30:26,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-10 06:30:26,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:26,902 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] [2025-01-10 06:30:26,912 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:30:27,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-10 06:30:27,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:27,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1392051061, now seen corresponding path program 1 times [2025-01-10 06:30:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639954132] [2025-01-10 06:30:27,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:27,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-10 06:30:27,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-10 06:30:27,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:27,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:27,621 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:30:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639954132] [2025-01-10 06:30:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639954132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:27,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417986677] [2025-01-10 06:30:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:27,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:27,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:27,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:27,625 INFO L87 Difference]: Start difference. First operand 403 states and 577 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:30:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:27,778 INFO L93 Difference]: Finished difference Result 970 states and 1401 transitions. [2025-01-10 06:30:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2025-01-10 06:30:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:27,785 INFO L225 Difference]: With dead ends: 970 [2025-01-10 06:30:27,786 INFO L226 Difference]: Without dead ends: 783 [2025-01-10 06:30:27,787 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:30:27,790 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 551 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:27,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1724 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:27,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-01-10 06:30:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 403. [2025-01-10 06:30:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.450381679389313) internal successors, (570), 398 states have internal predecessors, (570), 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:30:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 576 transitions. [2025-01-10 06:30:27,821 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 576 transitions. Word has length 70 [2025-01-10 06:30:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:27,821 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 576 transitions. [2025-01-10 06:30:27,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:30:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 576 transitions. [2025-01-10 06:30:27,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:30:27,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:27,825 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] [2025-01-10 06:30:27,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:30:27,826 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:27,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:27,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1666939625, now seen corresponding path program 1 times [2025-01-10 06:30:27,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:27,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053955863] [2025-01-10 06:30:27,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:27,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:27,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:30:27,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:30:27,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:27,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:28,128 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:30:28,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:28,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053955863] [2025-01-10 06:30:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053955863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:28,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084147054] [2025-01-10 06:30:28,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:28,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:28,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:28,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:28,130 INFO L87 Difference]: Start difference. First operand 403 states and 576 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:30:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:28,217 INFO L93 Difference]: Finished difference Result 800 states and 1146 transitions. [2025-01-10 06:30:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:28,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2025-01-10 06:30:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:28,221 INFO L225 Difference]: With dead ends: 800 [2025-01-10 06:30:28,222 INFO L226 Difference]: Without dead ends: 406 [2025-01-10 06:30:28,222 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:30:28,223 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 105 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1533 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:30:28,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1533 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:28,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-01-10 06:30:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2025-01-10 06:30:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4325699745547074) internal successors, (563), 398 states have internal predecessors, (563), 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:30:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 569 transitions. [2025-01-10 06:30:28,245 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 569 transitions. Word has length 81 [2025-01-10 06:30:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:28,245 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 569 transitions. [2025-01-10 06:30:28,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:30:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 569 transitions. [2025-01-10 06:30:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-10 06:30:28,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:28,250 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] [2025-01-10 06:30:28,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:30:28,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1538676899, now seen corresponding path program 1 times [2025-01-10 06:30:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597416454] [2025-01-10 06:30:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:28,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:28,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-10 06:30:28,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-10 06:30:28,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:28,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:28,457 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:30:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597416454] [2025-01-10 06:30:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597416454] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550084022] [2025-01-10 06:30:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:30:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:30:28,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:30:28,459 INFO L87 Difference]: Start difference. First operand 403 states and 569 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:30:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:28,557 INFO L93 Difference]: Finished difference Result 1087 states and 1556 transitions. [2025-01-10 06:30:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:30:28,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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 81 [2025-01-10 06:30:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:28,561 INFO L225 Difference]: With dead ends: 1087 [2025-01-10 06:30:28,563 INFO L226 Difference]: Without dead ends: 693 [2025-01-10 06:30:28,564 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:30:28,565 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 371 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:28,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 1285 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-01-10 06:30:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 690. [2025-01-10 06:30:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 680 states have (on average 1.451470588235294) internal successors, (987), 685 states have internal predecessors, (987), 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:30:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 993 transitions. [2025-01-10 06:30:28,593 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 993 transitions. Word has length 81 [2025-01-10 06:30:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:28,593 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 993 transitions. [2025-01-10 06:30:28,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:30:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 993 transitions. [2025-01-10 06:30:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 06:30:28,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:28,595 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] [2025-01-10 06:30:28,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:30:28,595 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:30:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1513740607, now seen corresponding path program 1 times [2025-01-10 06:30:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:28,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473877835] [2025-01-10 06:30:28,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:28,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-10 06:30:28,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-10 06:30:28,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:28,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:29,080 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:30:29,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:29,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473877835] [2025-01-10 06:30:29,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473877835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:29,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992029327] [2025-01-10 06:30:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:29,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:29,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:29,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:29,083 INFO L87 Difference]: Start difference. First operand 690 states and 993 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (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:30:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:29,206 INFO L93 Difference]: Finished difference Result 975 states and 1395 transitions. [2025-01-10 06:30:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (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 96 [2025-01-10 06:30:29,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:29,212 INFO L225 Difference]: With dead ends: 975 [2025-01-10 06:30:29,212 INFO L226 Difference]: Without dead ends: 973 [2025-01-10 06:30:29,212 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:30:29,214 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 458 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:29,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1702 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-01-10 06:30:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 754. [2025-01-10 06:30:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 741 states have (on average 1.437246963562753) internal successors, (1065), 746 states have internal predecessors, (1065), 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:30:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1077 transitions. [2025-01-10 06:30:29,248 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1077 transitions. Word has length 96 [2025-01-10 06:30:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:29,249 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1077 transitions. [2025-01-10 06:30:29,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (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:30:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1077 transitions. [2025-01-10 06:30:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:30:29,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:29,253 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] [2025-01-10 06:30:29,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:30:29,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:29,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 472850780, now seen corresponding path program 1 times [2025-01-10 06:30:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:29,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576533425] [2025-01-10 06:30:29,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:29,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:30:29,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:30:29,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:29,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:29,669 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:30:29,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576533425] [2025-01-10 06:30:29,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576533425] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:29,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428356241] [2025-01-10 06:30:29,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:29,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:29,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:29,673 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:30:29,675 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:30:29,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:30:29,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:30:29,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:29,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:30,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-10 06:30:30,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:30,016 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:30:30,037 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:30:30,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-10 06:30:30,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:30:30,623 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:30:30,918 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:30:30,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428356241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:30:30,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:30:30,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165326417] [2025-01-10 06:30:30,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:30,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:30:30,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:30,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:30:30,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:30:30,921 INFO L87 Difference]: Start difference. First operand 754 states and 1077 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 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:30:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:32,514 INFO L93 Difference]: Finished difference Result 1689 states and 2412 transitions. [2025-01-10 06:30:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:30:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 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 103 [2025-01-10 06:30:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:32,533 INFO L225 Difference]: With dead ends: 1689 [2025-01-10 06:30:32,534 INFO L226 Difference]: Without dead ends: 1023 [2025-01-10 06:30:32,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:30:32,535 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 831 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:32,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 2817 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-10 06:30:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-01-10 06:30:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 783. [2025-01-10 06:30:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 770 states have (on average 1.42987012987013) internal successors, (1101), 775 states have internal predecessors, (1101), 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:30:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1113 transitions. [2025-01-10 06:30:32,562 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1113 transitions. Word has length 103 [2025-01-10 06:30:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:32,562 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1113 transitions. [2025-01-10 06:30:32,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 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:30:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1113 transitions. [2025-01-10 06:30:32,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:30:32,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:32,564 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] [2025-01-10 06:30:32,574 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:30:32,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:32,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:32,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:32,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1360073626, now seen corresponding path program 1 times [2025-01-10 06:30:32,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:32,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834233140] [2025-01-10 06:30:32,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:32,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:32,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:30:32,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:30:32,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:32,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:32,942 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:30:32,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:32,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834233140] [2025-01-10 06:30:32,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834233140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:32,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:32,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802483283] [2025-01-10 06:30:32,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:32,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:30:32,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:32,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:30:32,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:30:32,948 INFO L87 Difference]: Start difference. First operand 783 states and 1113 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:30:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:33,000 INFO L93 Difference]: Finished difference Result 1484 states and 2118 transitions. [2025-01-10 06:30:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:30:33,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 103 [2025-01-10 06:30:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:33,004 INFO L225 Difference]: With dead ends: 1484 [2025-01-10 06:30:33,004 INFO L226 Difference]: Without dead ends: 799 [2025-01-10 06:30:33,006 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:30:33,008 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 2 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:33,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1090 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:30:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-01-10 06:30:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 797. [2025-01-10 06:30:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 784 states have (on average 1.4196428571428572) internal successors, (1113), 789 states have internal predecessors, (1113), 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:30:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1125 transitions. [2025-01-10 06:30:33,034 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1125 transitions. Word has length 103 [2025-01-10 06:30:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:33,034 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1125 transitions. [2025-01-10 06:30:33,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:30:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1125 transitions. [2025-01-10 06:30:33,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:30:33,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:33,036 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] [2025-01-10 06:30:33,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:30:33,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-01-10 06:30:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -717263272, now seen corresponding path program 1 times [2025-01-10 06:30:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645295234] [2025-01-10 06:30:33,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:33,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:30:33,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:30:33,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:33,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:33,183 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:30:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645295234] [2025-01-10 06:30:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645295234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:33,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:33,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751028818] [2025-01-10 06:30:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:33,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:33,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:33,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:33,186 INFO L87 Difference]: Start difference. First operand 797 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:30:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:33,257 INFO L93 Difference]: Finished difference Result 1425 states and 2013 transitions. [2025-01-10 06:30:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:30:33,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 103 [2025-01-10 06:30:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:33,261 INFO L225 Difference]: With dead ends: 1425 [2025-01-10 06:30:33,261 INFO L226 Difference]: Without dead ends: 658 [2025-01-10 06:30:33,262 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:30:33,263 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 9 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:33,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1382 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:30:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-10 06:30:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2025-01-10 06:30:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 645 states have (on average 1.4015503875968993) internal successors, (904), 650 states have internal predecessors, (904), 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:30:33,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 916 transitions. [2025-01-10 06:30:33,285 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 916 transitions. Word has length 103 [2025-01-10 06:30:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:33,286 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 916 transitions. [2025-01-10 06:30:33,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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:30:33,286 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 916 transitions. [2025-01-10 06:30:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-10 06:30:33,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:33,289 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:30:33,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:30:33,289 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:30:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2055262145, now seen corresponding path program 1 times [2025-01-10 06:30:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301416566] [2025-01-10 06:30:33,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:33,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:30:33,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:30:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:33,711 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:30:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301416566] [2025-01-10 06:30:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301416566] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596112095] [2025-01-10 06:30:33,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:33,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:33,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:33,715 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:30:33,717 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:30:33,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-10 06:30:34,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-10 06:30:34,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:34,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:34,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:30:34,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:31:17,982 WARN L286 SmtUtils]: Spent 6.22s 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)