./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:04:47,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:04:47,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:04:47,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:04:47,345 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:04:47,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:04:47,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:04:47,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:04:47,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:04:47,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:04:47,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:04:47,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:04:47,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:04:47,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:04:47,363 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:04:47,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:04:47,363 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:04:47,363 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:04:47,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:04:47,364 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:04:47,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:04:47,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:04:47,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:04:47,365 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/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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2025-03-04 15:04:47,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:04:47,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:04:47,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:04:47,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:04:47,574 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:04:47,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2025-03-04 15:04:48,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c7363a/6822d205e26f43ed90529aa8e8a3d8c9/FLAG610109ff3 [2025-03-04 15:04:48,970 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:04:48,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2025-03-04 15:04:48,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c7363a/6822d205e26f43ed90529aa8e8a3d8c9/FLAG610109ff3 [2025-03-04 15:04:49,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8c7363a/6822d205e26f43ed90529aa8e8a3d8c9 [2025-03-04 15:04:49,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:04:49,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:04:49,260 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:04:49,260 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:04:49,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:04:49,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0e6169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49, skipping insertion in model container [2025-03-04 15:04:49,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:04:49,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:04:49,702 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:04:49,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:04:49,829 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:04:49,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49 WrapperNode [2025-03-04 15:04:49,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:04:49,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:04:49,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:04:49,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:04:49,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,926 INFO L138 Inliner]: procedures = 208, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1431 [2025-03-04 15:04:49,927 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:04:49,927 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:04:49,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:04:49,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:04:49,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:49,945 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,002 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [34, 2, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [4, 0, 50]. [2025-03-04 15:04:50,002 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:04:50,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:04:50,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:04:50,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:04:50,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (1/1) ... [2025-03-04 15:04:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:04:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:50,080 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:04:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:04:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 15:04:50,097 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 15:04:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 15:04:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 15:04:50,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 15:04:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 15:04:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 15:04:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 15:04:50,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 15:04:50,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:04:50,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:04:50,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:04:50,281 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:04:50,282 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:04:51,334 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 15:04:51,405 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-03-04 15:04:51,406 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:04:51,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:04:51,438 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 15:04:51,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:51 BoogieIcfgContainer [2025-03-04 15:04:51,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:04:51,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:04:51,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:04:51,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:04:51,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:04:49" (1/3) ... [2025-03-04 15:04:51,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da0fe81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:51, skipping insertion in model container [2025-03-04 15:04:51,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:04:49" (2/3) ... [2025-03-04 15:04:51,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da0fe81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:04:51, skipping insertion in model container [2025-03-04 15:04:51,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:04:51" (3/3) ... [2025-03-04 15:04:51,445 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2025-03-04 15:04:51,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:04:51,462 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test2-2.i that has 6 procedures, 434 locations, 1 initial locations, 36 loop locations, and 8 error locations. [2025-03-04 15:04:51,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:04:51,519 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;@2abe8214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:04:51,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 15:04:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 404 states have (on average 1.6262376237623761) internal successors, (657), 419 states have internal predecessors, (657), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 15:04:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 15:04:51,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:51,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:51,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:51,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 252907184, now seen corresponding path program 1 times [2025-03-04 15:04:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617110122] [2025-03-04 15:04:51,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:51,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:04:51,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:04:51,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:51,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:51,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617110122] [2025-03-04 15:04:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617110122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:04:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40364241] [2025-03-04 15:04:51,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:51,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:04:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:51,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:04:51,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:04:51,680 INFO L87 Difference]: Start difference. First operand has 426 states, 404 states have (on average 1.6262376237623761) internal successors, (657), 419 states have internal predecessors, (657), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:04:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:51,778 INFO L93 Difference]: Finished difference Result 848 states and 1356 transitions. [2025-03-04 15:04:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:04:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 15:04:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:51,786 INFO L225 Difference]: With dead ends: 848 [2025-03-04 15:04:51,788 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 15:04:51,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:04:51,795 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:51,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 568 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 15:04:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-04 15:04:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 366 states have (on average 1.4754098360655739) internal successors, (540), 378 states have internal predecessors, (540), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 15:04:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 556 transitions. [2025-03-04 15:04:51,845 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 556 transitions. Word has length 7 [2025-03-04 15:04:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:51,846 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 556 transitions. [2025-03-04 15:04:51,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:04:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 556 transitions. [2025-03-04 15:04:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 15:04:51,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:51,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:51,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:04:51,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:51,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 252908145, now seen corresponding path program 1 times [2025-03-04 15:04:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:51,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519895339] [2025-03-04 15:04:51,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:51,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:04:51,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:04:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:04:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652817370] [2025-03-04 15:04:51,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:51,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:51,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:04:51,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:04:51,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:04:52,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:04:52,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:52,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:04:52,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:04:52,038 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-03-04 15:04:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:52,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:04:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519895339] [2025-03-04 15:04:52,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:04:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652817370] [2025-03-04 15:04:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652817370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:52,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430807926] [2025-03-04 15:04:52,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:52,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:52,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:52,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:52,079 INFO L87 Difference]: Start difference. First operand 384 states and 556 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:04:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:52,308 INFO L93 Difference]: Finished difference Result 758 states and 1103 transitions. [2025-03-04 15:04:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:52,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 15:04:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:52,312 INFO L225 Difference]: With dead ends: 758 [2025-03-04 15:04:52,312 INFO L226 Difference]: Without dead ends: 757 [2025-03-04 15:04:52,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:04:52,313 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 525 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:52,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1469 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-03-04 15:04:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 389. [2025-03-04 15:04:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 371 states have (on average 1.471698113207547) internal successors, (546), 383 states have internal predecessors, (546), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 15:04:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 562 transitions. [2025-03-04 15:04:52,355 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 562 transitions. Word has length 7 [2025-03-04 15:04:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:52,355 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 562 transitions. [2025-03-04 15:04:52,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:04:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 562 transitions. [2025-03-04 15:04:52,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 15:04:52,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:52,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:52,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:04:52,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:52,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:52,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:52,557 INFO L85 PathProgramCache]: Analyzing trace with hash -749781412, now seen corresponding path program 1 times [2025-03-04 15:04:52,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:52,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774700809] [2025-03-04 15:04:52,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:52,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:52,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:04:52,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:04:52,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:52,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:04:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445838135] [2025-03-04 15:04:52,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:52,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:04:52,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:04:52,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:04:52,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:04:52,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:52,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:52,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:04:52,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:04:52,701 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-03-04 15:04:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:52,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:04:52,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:52,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774700809] [2025-03-04 15:04:52,720 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:04:52,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445838135] [2025-03-04 15:04:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445838135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:52,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:52,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:52,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34525953] [2025-03-04 15:04:52,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:52,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:52,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:52,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:52,722 INFO L87 Difference]: Start difference. First operand 389 states and 562 transitions. 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-03-04 15:04:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:52,924 INFO L93 Difference]: Finished difference Result 757 states and 1102 transitions. [2025-03-04 15:04:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:52,924 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-03-04 15:04:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:52,928 INFO L225 Difference]: With dead ends: 757 [2025-03-04 15:04:52,928 INFO L226 Difference]: Without dead ends: 756 [2025-03-04 15:04:52,928 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-03-04 15:04:52,929 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 523 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:52,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1544 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-03-04 15:04:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 390. [2025-03-04 15:04:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 372 states have (on average 1.4704301075268817) internal successors, (547), 384 states have internal predecessors, (547), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 15:04:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 563 transitions. [2025-03-04 15:04:52,947 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 563 transitions. Word has length 8 [2025-03-04 15:04:52,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:52,947 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 563 transitions. [2025-03-04 15:04:52,948 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-03-04 15:04:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 563 transitions. [2025-03-04 15:04:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-04 15:04:52,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:52,952 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] [2025-03-04 15:04:52,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 15:04:53,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:04:53,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:53,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:53,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2003854206, now seen corresponding path program 1 times [2025-03-04 15:04:53,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188492858] [2025-03-04 15:04:53,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:53,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-04 15:04:53,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-04 15:04:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188492858] [2025-03-04 15:04:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188492858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:04:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908789729] [2025-03-04 15:04:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:53,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:53,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:53,498 INFO L87 Difference]: Start difference. First operand 390 states and 563 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-04 15:04:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:53,681 INFO L93 Difference]: Finished difference Result 933 states and 1362 transitions. [2025-03-04 15:04:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2025-03-04 15:04:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:53,685 INFO L225 Difference]: With dead ends: 933 [2025-03-04 15:04:53,686 INFO L226 Difference]: Without dead ends: 755 [2025-03-04 15:04:53,688 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-03-04 15:04:53,688 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 525 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:53,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1475 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-03-04 15:04:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 390. [2025-03-04 15:04:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 372 states have (on average 1.467741935483871) internal successors, (546), 384 states have internal predecessors, (546), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 15:04:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 562 transitions. [2025-03-04 15:04:53,706 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 562 transitions. Word has length 62 [2025-03-04 15:04:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:53,707 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 562 transitions. [2025-03-04 15:04:53,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-03-04 15:04:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 562 transitions. [2025-03-04 15:04:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 15:04:53,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:53,712 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] [2025-03-04 15:04:53,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:04:53,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:53,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:53,712 INFO L85 PathProgramCache]: Analyzing trace with hash -329657887, now seen corresponding path program 1 times [2025-03-04 15:04:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:53,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814769390] [2025-03-04 15:04:53,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:53,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 15:04:53,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 15:04:53,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:53,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814769390] [2025-03-04 15:04:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814769390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:04:53,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929271268] [2025-03-04 15:04:53,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:53,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:53,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:53,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:53,921 INFO L87 Difference]: Start difference. First operand 390 states and 562 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 15:04:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:54,042 INFO L93 Difference]: Finished difference Result 775 states and 1119 transitions. [2025-03-04 15:04:54,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-04 15:04:54,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:54,044 INFO L225 Difference]: With dead ends: 775 [2025-03-04 15:04:54,044 INFO L226 Difference]: Without dead ends: 393 [2025-03-04 15:04:54,045 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-03-04 15:04:54,045 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 105 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:54,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1380 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:54,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-04 15:04:54,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 390. [2025-03-04 15:04:54,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 372 states have (on average 1.4489247311827957) internal successors, (539), 384 states have internal predecessors, (539), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 15:04:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 555 transitions. [2025-03-04 15:04:54,055 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 555 transitions. Word has length 79 [2025-03-04 15:04:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:54,055 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 555 transitions. [2025-03-04 15:04:54,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-03-04 15:04:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 555 transitions. [2025-03-04 15:04:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 15:04:54,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:54,058 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] [2025-03-04 15:04:54,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:04:54,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:54,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1715601606, now seen corresponding path program 1 times [2025-03-04 15:04:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:54,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931097813] [2025-03-04 15:04:54,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:54,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 15:04:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 15:04:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:54,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:04:54,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931097813] [2025-03-04 15:04:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931097813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:54,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772588652] [2025-03-04 15:04:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:54,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:04:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:54,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:04:54,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:04:54,200 INFO L87 Difference]: Start difference. First operand 390 states and 555 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-03-04 15:04:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:54,348 INFO L93 Difference]: Finished difference Result 1049 states and 1516 transitions. [2025-03-04 15:04:54,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:04:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-03-04 15:04:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:54,351 INFO L225 Difference]: With dead ends: 1049 [2025-03-04 15:04:54,351 INFO L226 Difference]: Without dead ends: 667 [2025-03-04 15:04:54,352 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-03-04 15:04:54,352 INFO L435 NwaCegarLoop]: 682 mSDtfsCounter, 351 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:54,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:04:54,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2025-03-04 15:04:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 663. [2025-03-04 15:04:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 640 states have (on average 1.4703125) internal successors, (941), 657 states have internal predecessors, (941), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 15:04:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 967 transitions. [2025-03-04 15:04:54,371 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 967 transitions. Word has length 79 [2025-03-04 15:04:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:54,371 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 967 transitions. [2025-03-04 15:04:54,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-03-04 15:04:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 967 transitions. [2025-03-04 15:04:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 15:04:54,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:54,372 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] [2025-03-04 15:04:54,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:04:54,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:54,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:54,373 INFO L85 PathProgramCache]: Analyzing trace with hash -905640991, now seen corresponding path program 1 times [2025-03-04 15:04:54,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:54,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832645026] [2025-03-04 15:04:54,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 15:04:54,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 15:04:54,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:54,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:04:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:54,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832645026] [2025-03-04 15:04:54,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832645026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:54,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:04:54,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:04:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338710747] [2025-03-04 15:04:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:54,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:04:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:04:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:04:54,729 INFO L87 Difference]: Start difference. First operand 663 states and 967 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 15:04:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:54,935 INFO L93 Difference]: Finished difference Result 922 states and 1345 transitions. [2025-03-04 15:04:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:04:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2025-03-04 15:04:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:54,941 INFO L225 Difference]: With dead ends: 922 [2025-03-04 15:04:54,942 INFO L226 Difference]: Without dead ends: 920 [2025-03-04 15:04:54,942 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-03-04 15:04:54,944 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 434 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:54,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1531 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:04:54,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-04 15:04:54,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 726. [2025-03-04 15:04:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 700 states have (on average 1.4542857142857142) internal successors, (1018), 717 states have internal predecessors, (1018), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1050 transitions. [2025-03-04 15:04:54,967 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 1050 transitions. Word has length 94 [2025-03-04 15:04:54,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:54,967 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 1050 transitions. [2025-03-04 15:04:54,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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-03-04 15:04:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 1050 transitions. [2025-03-04 15:04:54,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 15:04:54,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:54,970 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:54,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:04:54,971 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:54,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:54,971 INFO L85 PathProgramCache]: Analyzing trace with hash 682592336, now seen corresponding path program 1 times [2025-03-04 15:04:54,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:54,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927966371] [2025-03-04 15:04:54,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:54,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:55,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 15:04:55,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 15:04:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:55,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:04:55,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927966371] [2025-03-04 15:04:55,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927966371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:04:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394098902] [2025-03-04 15:04:55,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:55,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:55,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:55,432 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:04:55,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:04:55,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 15:04:55,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 15:04:55,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:55,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:55,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 15:04:55,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:04:55,674 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-03-04 15:04:55,693 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-03-04 15:04:55,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 15:04:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:04:56,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:04:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394098902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:04:56,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:04:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 15:04:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705828113] [2025-03-04 15:04:56,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:04:56,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:04:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:04:56,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:04:56,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:04:56,304 INFO L87 Difference]: Start difference. First operand 726 states and 1050 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-03-04 15:04:57,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:04:57,525 INFO L93 Difference]: Finished difference Result 1608 states and 2334 transitions. [2025-03-04 15:04:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:04:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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 100 [2025-03-04 15:04:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:04:57,531 INFO L225 Difference]: With dead ends: 1608 [2025-03-04 15:04:57,531 INFO L226 Difference]: Without dead ends: 968 [2025-03-04 15:04:57,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:04:57,533 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 790 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2515 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 15:04:57,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2515 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 15:04:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-03-04 15:04:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 751. [2025-03-04 15:04:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 725 states have (on average 1.4455172413793103) internal successors, (1048), 742 states have internal predecessors, (1048), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 8 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 15:04:57,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1080 transitions. [2025-03-04 15:04:57,555 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1080 transitions. Word has length 100 [2025-03-04 15:04:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:04:57,555 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1080 transitions. [2025-03-04 15:04:57,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-03-04 15:04:57,555 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1080 transitions. [2025-03-04 15:04:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 15:04:57,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:04:57,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:04:57,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:04:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:57,757 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 15:04:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:04:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash -550035253, now seen corresponding path program 1 times [2025-03-04 15:04:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:04:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537299969] [2025-03-04 15:04:57,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:04:57,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 15:04:57,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:04:57,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:04:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:04:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537299969] [2025-03-04 15:04:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537299969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:04:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801687383] [2025-03-04 15:04:58,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:04:58,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:04:58,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:04:58,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:04:58,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:04:58,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 15:04:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:04:58,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:04:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:04:58,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 15:04:58,316 INFO L279 TraceCheckSpWp]: Computing forward predicates...